Abstract:
We consider finite sets of oriented spheres in R^{k1} and, by interpreting such spheres as points in R^{k}, study the Voronoi diagrams they induce for several variants of distance between spheres. We give bounds on the combinatorial complexity of these diagrams in R^{2} and R^{3} and derive properties useful for constructing them. Our results are motivated by applications to special relativity theory.
Bibtex:
@incollection{aurenhammer2007isvd, author = "F. Aurenhammer and J. Wallner and M. Peternell and H. Pottmann", title = "Voronoi Diagrams for Oriented Spheres", booktitle = "Proc. ISVD'07: 4th Int. Conf. Voronoi Diagrams in Science and Engineering", year = "2007", publisher = "IEEE Computer Society", editor = "Chris Gold", isbn = {0769528694}, pages="3337", url = "http://www.geometrie.tugraz.at/wallner/zykel_ieee.pdf", }

