Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
The higher-order Voronoi diagram of line segments
On the complexity of d-dimensional Voronoi diagrams
On levels in arrangements and Voronoi diagrams
Farthest line segment Voronoi diagrams
The upper envelope of piecewise linear functions: Algorithms and applications
The Voronoi diagram of three lines
Voronoi diagrams and arrangements
The upper envelope of Voronoi surfaces and its applications
Almost tight upper bounds for lower envelopes in higher dimensions
Polyhedral Voronoi diagrams of polyhedra in three dimensions
Applications of random sampling in computational geometry. II
A lower bound on Voronoi diagram complexity.
The Hausdorff Voronoi diagram of point clusters in the plane
Farthest color Voronoi diagrams: complexity and algorithms
Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space
On the Zone Theorem for Hyperplane Arrangements
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations
Voronoi Diagrams for Parallel Halflines and Line Segments in Space
The maximum numbers of faces of a convex polytope
THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH

This page was built for publication: Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624198)