scientific article; zbMATH DE number 1555916

MaRDI QIDQ4525679zbMATH OpenFDO

Authors Rolf Klein, Andrzej Lingas

Publication date 24 January 2001

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Abstract Voronoi diagrams from closed bisecting curves
• Forest-like abstract Voronoi diagrams in linear time
• scientific article; zbMATH DE number 18530
• Randomized incremental construction of abstract Voronoi diagrams
• scientific article; zbMATH DE number 4110186

Cited in

(11)

• A nearly parallel algorithm for the Voronoi diagram of a convex polygon
• Forest-like abstract Voronoi diagrams in linear time
• Minimizing the diameter of a spanning tree for imprecise points
• On selecting a fraction of leaves with disjoint neighborhoods in a plane tree
• The geodesic farthest-point Voronoi diagram in a simple polygon
• A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
• Improved dynamic geodesic nearest neighbor searching in a simple polygon
• Deletion in Abstract Voronoi Diagrams in Expected Linear Time.
• Deletion in abstract Voronoi diagrams in expected linear time and related problems
• The Voronoi diagram of rotating rays with applications to floodlight illumination
• Abstract Voronoi diagrams revisited

This page was built for publication:

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