Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions
نویسندگان
چکیده
منابع مشابه
Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
We consider the problem of ray shooting in a three-dimensional scene consisting of m (possibly intersecting) convex polyhedra or polyhedral terrains with a total of n faces, i.e., we want to preprocess them into a data structure, so that the first intersection point of a query ray and the given polyhedra can be determined quickly. We present a technique that requires O ((mn):+) preprocessing ti...
متن کاملGeneralized Voronoi Diagrams on Polyhedral Terrains
We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a polyhedral terrain in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) ...
متن کاملMost Likely Voronoi Diagrams in Higher Dimensions
The Most Likely Voronoi Diagram is a generalization of the well known Voronoi Diagrams to a stochastic setting, where a stochastic point is a point associated with a given probability of existence, and the cell for such a point is the set of points which would classify the given point as its most likely nearest neighbor. We investigate the complexity of this subdivision of space in d dimensions...
متن کاملAspects of Convex Geometry Polyhedra, Shellings, Voronoi Diagrams, Delaunay Triangulations
Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed as a tutorial and a set of notes on convex sets, polytopes, polyhedra, combinatorial topology, Voronoi Diagrams and Delaunay Triangulations. It is intended f...
متن کاملRay Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
We consider the problem of ray shooting in a 3-dimensional scene consisting of m (possibly intersecting) convex polyhedra or polyhedral terrains with a total of n faces, i.e., we want to preprocess them into a data structure, so that the rst intersection point of a query ray and the given polyhedra can be determined quickly. We present a technique that requires O((mn) 2+") preprocessing time an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2004
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-003-2950-5