Approximating Voronoi Diagrams of Convex Sites in Any Dimension

DOI10.1142/S0218195998000114zbMath1035.68542MaRDI QIDQ4513208

Jules Vleugels, Mark H. Overmars

Publication date: 7 November 2000

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

motion planningcell decomposition

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (10)

Efficient preprocessing of complex geometries for CFD simulations ⋮ A fast robust algorithm for computing discrete Voronoi diagrams ⋮ Exact computation of the medial axis of a polyhedron ⋮ Hunting Voronoi vertices ⋮ A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS ⋮ Approximations of 2D and 3D generalized Voronoi diagrams ⋮ Computing Voronoi skeletons of a 3-D polyhedron by space subdivision ⋮ Higher Order Voronoi Diagrams and Distance Functions in Art and Visualization ⋮ Computing the topology of Voronoï diagrams of parallel half-lines ⋮ Non-centered Voronoi Skeletons

Cites Work

• Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
• Randomized incremental construction of Delaunay and Voronoi diagrams
• Hunting Voronoi vertices
• A “retraction” method for planning the motion of a disc

This page was built for publication: Approximating Voronoi Diagrams of Convex Sites in Any Dimension