scientific article; zbMATH DE number 140455

MaRDI QIDQ4028871zbMATHFDO

Authors Michael T. Goodrich, Colm P. O'Dunlaing, Chee K. Yap

Publication date 28 March 1993

zbMATH Keywords

parallel algorithmVoronoi diagrampolygonal scene

Mathematics Subject Classification ID

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

Recommendations

• Constructing the Voronoi diagram of a set of line segments in parallel
• A randomized algorithm for the Voronoi diagram of line segments on coarse-grained multiprocessors
• On parallel computation of Voronoi diagrams
• A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
• A nearly parallel algorithm for the Voronoi diagram of a convex polygon

Cited in

(11)

• scientific article; zbMATH DE number 177831 (Why is no real title available?)
• Computing the topology of Voronoï diagrams of parallel half-lines
• Constructing the Voronoi diagram of a set of line segments in parallel
• An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
• A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
• Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane
• A time-optimal parallel algorithm for the computing of Voronoi-diagrams
• Bisectors and Voronoï Diagram of a Family of Parallel Half-Lines
• Voronoi Diagrams for Parallel Halflines and Line Segments in Space
• An optimal algorithm for finding the separation of simple polygons
• scientific article; zbMATH DE number 4062598 (Why is no real title available?)

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 Q4028871)