Personal tools
You are here: Home Projects 3d-lines-vor
« October 2017 »
October
SuMoTuWeThFrSa
1234567
891011121314
15161718192021
22232425262728
293031
Log in


Forgot your password?
 

Exact Voronoi Diagram of Arbitrary Lines in Space

Spindle 4
Voronoi Diagram of 4 lines, obtained
by rotating  one line around the z-axis

This is a joint project with Geometrica, INRIA Sophia Antipolis - Mediterrane.

Abstract

We introduce a new, efficient, and complete algorithm, and its exact implementation, to compute the Voronoi diagram of lines in three-dimensions. This is a major milestone towards the robust construction of the Voronoi diagram of polyhedra. Following the exact geometric computation paradigm, it is guaranteed that we always computes the mathematically correct result. The algorithm is complete in the sense that it can handle all configurations, in particular all degenerate ones. The algorithm requires On3eps time and space, where n is the number of lines. The Voronoi diagram is represented by a data structure that permits answering point location queries in  OlogSquaredNexpected time. The implementation employs the CGAL packages for constructing arrangements and lower envelopes on parametric surfaces together with advanced algebraic tools.

 

 

Bisectors

The bisector of two lines in space is:

Generic 2
Parallel 2 Intersect 2
(a)
(b)
(c)

(a) 2 generic lines - Hyperbolic paraboloid
(b) 2 parallel lines - a plane
(c) 2 intersecting lines - pair of orthogonal planes

More Diagrams

Flower 4
Intersect 4 Parallel 5
(a)
(b)
(c)

(a) 4 lines intersecting at a single point
(b) 4 lines - 2 intersect and 2 others are parallel to each of them
(c) 5 parallel lines

Open Question and Further Work

  •  A tight bound on the combinatorial complexity of the Voronoi diagram of  n lines or line segments in R3 is unknown; it is conjectured that the complexity is near-quadratic; the known lower bound is OmegaN2, but the best known upper bound is On3eps. In the case of lines with a fixed number c of orientations the upper bound was improved to Oc4n2eps. Thus, the open question is to close this gap.
  • The exact computation is currently based on pure algebraic methods, which slows down the algorithm. Thus, it is necessary to introduce filters that avoid the use of exact arithmetic. Moreover, it would be useful to decrease the complexity of algebraic methods. 
  • So far it is only possible to compute the Voronoi diagram of lines. The next steps are to allow also line segments, points, triangles, and finally polyhedra.

Links

  • Michael Hemmer, Ophir Setter, and Dan Halperin.
    Constructing the Exact Voronoi Diagram of Arbitrary Lines in Space with Fast Point-Location [preliminary version]
    [WWW] [doi:10.1007/978-3-642-15775-2_34]
  • The package for constructing 3D Voronoi diagram of lines including the point location structure can be download here (as a CGAL package).
  • The internal CGAL on which the package is based on can be downloaded here.
  • CGAL homepage: www.cgal.org

Contacts

Michael Hemmer
http://mpi-inf.mpg.de/~eric eric@mpi-inf.mpg.de
Ophir Setter

efif@post.tau.ac.il
Dan Halperin http://acg.cs.tau.ac.il/danhalperin danha@post.tau.ac.il









Document Actions