scientific article; zbMATH DE number 140455

zbMATH Open0794.68062MaRDI QIDQ4028871FDOQ4028871

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

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

parallel algorithmVoronoi diagrampolygonal scene

Mathematics Subject Classification ID

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

Cited In (9)

• Title not available (Why is that?)
• Bisectors and Voronoï Diagram of a Family of Parallel Half-Lines
• An optimal algorithm for finding the separation of simple polygons
• Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane
• Voronoi Diagrams for Parallel Halflines and Line Segments in Space
• A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
• Title not available (Why is that?)
• Computing the topology of Voronoï diagrams of parallel half-lines
• Constructing the Voronoi diagram of a set of line segments in parallel

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)