scientific article; zbMATH DE number 3562002

zbMATH Open0361.50003MaRDI QIDQ4134504FDOQ4134504

Authors: F. P. Preparata 

Publication date: 1977

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

Mathematics Subject Classification ID

Algorithms in computer science (68W99) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to geometry (51-01) Real and complex geometry (51M99)

Cited In (16)

• A straightforward algorithm for computing the medial axis of a simple polygon
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Isoperimetric enclosures
• On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon
• The intersection graph of the disks with diameters the sides of a convex \(n\)-gon
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• A sweepline algorithm for Voronoi diagrams
• Optimal divisions of a convex body
• Conformal mapping in linear time
• Boundary surface recovery from skeleton curves and surfaces
• VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
• Voronoi diagram and medial axis algorithm for planar domains with curved boundaries. II: Detailed algorithm description
• Voronoi diagram and medial axis algorithm for planar domains with curved boundaries. I: Theoretical foundations
• Asynchronous deterministic rendezvous in bounded terrains
• Constructing the Voronoi diagram of a set of line segments in parallel
• Exploiting curvatures to compute the medial axis for domains with smooth boundary

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