Voronoi Diagrams for Oriented Spheres

14 years 5 months ago

Download www.geometrie.tugraz.at

We consider ﬁnite sets of oriented spheres in Rk−1 and, by interpreting such spheres as points in Rk , study the Voronoi diagrams they induce for several variants of distance between spheres. We give bounds on the combinatorial complexity of these diagrams in R2 and R3 and derive properties useful for constructing them. Our results are motivated by applications to special relativity theory.

Franz Aurenhammer, Johannes Wallner, Martin Petern

Real-time Traffic

ISVD 2007 | Oriented Spheres | Special Relativity Theory | Theoretical Computer Science | Voronoi Diagrams |

claim paper

» Euclidean Voronoi diagram of 3D balls and its computation via tracing edges

» Arrangements of geodesic arcs on the sphere

» Edgetracing algorithm for euclidean voronoi diagram of 3d spheres

» Arrangements on Parametric Surfaces II Concretizations and Applications

» A Topology Oriented Algorithm for the Voronoi Diagram of Polygons

» From the KneserPoulsen conjecture to ballpolyhedra via Voronoi diagrams

» Bubble mesh automated triangular meshing of nonmanifold geometry by sphere packing

» Voronoi A Dynamic Page Segmentation Approach Based on Voronoi and Docstrum Features

Post Info
More Details (n/a)

Added	04 Jun 2010
Updated	04 Jun 2010
Type	Conference
Year	2007
Where	ISVD
Authors	Franz Aurenhammer, Johannes Wallner, Martin Peternell, Helmut Pottmann

Comments (0)

Sciweavers

Voronoi Diagrams for Oriented Spheres

ISVD 2007 | Oriented Spheres | Special Relativity Theory | Theoretical Computer Science | Voronoi Diagrams |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers