scientific article; zbMATH DE number 140459

zbMATH Open0767.68098MaRDI QIDQ4028875FDOQ4028875

Authors: David Rappaport 

Publication date: 28 March 1993

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

Recommendations

• The furthest-site geodesic Voronoi diagram
• scientific article; zbMATH DE number 3945378
• ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS
• Optimal computation of the Voronoi diagram of disjoint clusters
• The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
• scientific article; zbMATH DE number 7559212
• An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
• scientific article; zbMATH DE number 177538
• Farthest-point Voronoi diagrams in the presence of rectangular obstacles
• A parallel algorithm for computing Voronoi diagram of a set of circles using touching disc and topology matching

zbMATH Keywords

furthest site Voronoi diagram

Mathematics Subject Classification ID

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

Cited In (8)

• Voronoi diagrams for polygon-offset distance functions
• The higher-order Voronoi diagram of line segments
• A convex hull algorithm for discs, and applications
• Voronoi diagrams for convex polygon-offset distance functions
• Intersection and Closest-Pair Problems for a Set of Planar Discs
• A sweepline algorithm for Euclidean Voronoi diagram of circles
• Convex-straight-skeleton Voronoi diagrams for segments and convex polygons
• A parallel algorithm for computing Voronoi diagram of a set of circles using touching disc and topology matching

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