AHD: Alternate Hierarchical Decomposition Convex decomposition of nonconvex objects into their convex hull components, represented in hierarchical tree.

Slides:



Advertisements
Similar presentations
Sorting Really Big Files Sorting Part 3. Using K Temporary Files Given  N records in file F  M records will fit into internal memory  Use K temp files,
Advertisements

Problems in curves and surfaces M. Ramanathan Problems in curves and surfaces.
1 Constructing Splits Graphs Author: Andreas W.M. Dress Daniel H. Huson Presented by: Bakhtiyar Uddin.
Lecture 3: Parallel Algorithm Design
On the Power of Discrete and of Lexicographic Helly Theorems Nir Halman, Technion, Israel This work is part of my Ph.D. thesis, held in Tel Aviv University,
Geometric Algorithms João Comba. Example: Convex Hull convex Non-convex.
Computational Geometry
Some Basic Morphological Algorithm
Algorithms and Data Structures Lecture 13. Agenda: Plane Geometry: algorithms on polygons - Verification if point belongs to a polygon - Convex hull.
Morphological Image Processing Md. Rokanujjaman Assistant Professor Dept of Computer Science and Engineering Rajshahi University.
CHAPTER 5: CONVEX POLYTOPES Anastasiya Yeremenko 1.
2. Voronoi Diagram 2.1 Definiton Given a finite set S of points in the plane , each point X of  defines a subset S X of S consisting of the points of.
Computational Geometry The art of finding algorithms for solving geometrical problems Literature: –M. De Berg et al: Computational Geometry, Springer,
1 Lecture 8: Voronoi Diagram Computational Geometry Prof. Dr. Th. Ottmann Voronoi Diagrams Definition Characteristics Size and Storage Construction Use.
Chapter 9 Morphological Image Processing. Preview Morphology: denotes a branch of biology that deals with the form and structure of animals and planets.
Computational Geometry The art of finding algorithms for solving geometrical problems Literature: –M. De Berg et al: Computational Geometry, Springer,
1 “Spatial Object Representation: Some Issues” Rod Thompson Department of Natural Resources, Mines and Water, Queensland Australia, Delft University Of.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 Chapter 4: 3D Convex Hulls Friday, 2/9/07.
Computational Geometry Algorithms Library Source: CGAL web page
1 Engineering Computation Part 4. 2 Enrique Castillo University of Cantabria An algorithm that permits solving many problems in Algebra. Applications.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 Geometric Modeling.
Lecture 15: Single-view modeling CS6670: Computer Vision Noah Snavely.
Two-Level Logic Minimization Exact minimization –problem : very large number of prime and very large number of minterm Heuristic minimization –avoid computing.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 Chapter 4: 3D Convex Hulls Monday, 2/23/04.
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
CSE53111 Computational Geometry TOPICS q Preliminaries q Point in a Polygon q Polygon Construction q Convex Hulls Further Reading.
Lecture 5. Morphological Image Processing. 10/6/20152 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of animals.
Pole/polar consider projective geometry again we may want to compute the tangents of a curve that pass through a point (e.g., visibility) let C be a conic.
Chapter 1. Functions and Models
Computational Geometry Course Summary (First Half) Spring 2008 Pay special attention to: algorithm details (able to explain correctness and carry out a.
Introduction to Computational Geometry Hackson
12. Polyhedra
Intersection of Nonconvex Polygons Using the Alternate Hierarchical Decomposition, AHD by Rizwan Bulbul, and Andrew U. Frank Department of Geoinformation.
16/5/ :47 UML Computer Graphics Conceptual Model Application Model Application Program Graphics System Output Devices Input Devices API Function.
Visual Computing Geometric Modelling 1 INFO410 & INFO350 S2 2015
Geometric Algebra 4. Algebraic Foundations and 4D Dr Chris Doran
Algorithms 1.Notion of an algorithm 2.Properties of an algorithm 3.The GCD algorithm 4.Correctness of the GCD algorithm 5.Termination of the GCD algorithm.
Program Design. The design process How do you go about writing a program? –It’s like many other things in life Understand the problem to be solved Develop.
Points, Lines, Planes and Angles. Points, Lines and Planes These basic concepts of geometry are theoretical and cannot be precisely defined. They do not.
Morphological Image Processing การทำงานกับรูปภาพด้วยวิธีมอร์โฟโลจิคัล
CS654: Digital Image Analysis
Lecture(s) 3-4. Morphological Image Processing. 3/13/20162 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of.
Digital Image Processing, Spring ECES 682 Digital Image Processing Week 8 Oleh Tretiak ECE Department Drexel University.
VORONOI DIAGRAMS BY KATHARINE TISCHER Coordinating Seminar Spring 2013.
CS552: Computer Graphics Lecture 28: Solid Modeling.
Bounding Volume Hierarchies and Spatial Partitioning
Lecture 3: Parallel Algorithm Design
2018/6/11 Intersection of Nonconvex Polygons Using the Alternate Hierarchical Decomposition, AHD by Rizwan Bulbul, and Andrew U. Frank Department of Geoinformation.
Principles of GIS Fundamental spatial concepts – Part II Shaowen Wang
Bounding Volume Hierarchies and Spatial Partitioning
Soft Computing Applied to Finite Element Tasks
Level Set Tree Feature Detection
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Computer Graphics Recitation 12.
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
CS Digital Image Processing Lecture 5
JTS Topology Suite An API for Processing Linear Geometry
CISC5835, Algorithms for Big Data
Point-Line Duality Let
Algorithm design (computational geometry)
Morphological Image Processing
Introduction to Data Structure
Quantum Foundations Lecture 3
(Convex) Cones Def: closed under nonnegative linear combinations, i.e.
Overview of Modeling 김성남.
Combinatorial Topology and Distributed Computing
1. Defining and Representing Functions
컴퓨터 그래픽스를 위한 기하학적 기초 (Line Geometry for Computer Graphics)
Convex Hull - most ubiquitous structure in computational geometry
Part One : Deterministic Finite Automata
Presentation transcript:

AHD: Alternate Hierarchical Decomposition Convex decomposition of nonconvex objects into their convex hull components, represented in hierarchical tree data structure. Two basic steps Convex hull computation – Use any existing algorithm, we used QuickHull algorithm Delta region extraction – Symmetric difference – Split connected regions

AHD: Alternate Hierarchical Decomposition-Example

Big Integers Point are represented by homogeneous big integer coordinates Big Integers – Arbitrary precision integer types supported by most programming languages e.g. Haskell, Java – Precision is limited by the size of the available memory – All straight line geometry can be performed precisely Homogeneous big integer coordinates – Avoid divisions – Duality in projective geometry can be used and topological relations are computed consistently Computation with big integers is thought to be very slow, especially for cascaded operations where the output of one operation is used as input of another operation Experiment – A cascaded intersection operation – Tested the behavior of geometry with repeatedly intersecting lines – Given two lines AB and CD, the intersection point P is P=(A x B) x (C x D)

Big Integers-Experiment

Convex Polytopes Representation of geometry of nonconvex regions is based on the representation of (convex) polytopes, which are defined by the intersection of finite set of half planes (half spaces in case of 3D). In dual space, a convex polytope is defined as the convex hull of the dual points Convex polytope is used because; – Order of points is not important – Convexity can be exploited for performing closed operations e.g. intersection of two convex hulls is always convex – Union operation is simple – intersections are dual – Facilitate dimension independence. This is possible by lifting 2D algorithms to work with 3D or more

Lifting Associates elements and operations from one class to another B i = F(A i ) g i = F(f i ) Preserves the structure and operator algebra F(e A ) = e F(A) F(f.g) = F(f).F(g) Extends a single value to list lift a = [a] = [a 1, a 2,…, a n ] lift f a = f [a] = [f a 1, f a 2,…, f a n ] A B

Representation can be used for a gradual (level of detail) rendering: Stop when enough detail is found. Level of Detail (LoD)