ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS

DOI10.1142/S0218195995000192zbMATH Open0835.68121OpenAlexW2156742832MaRDI QIDQ4848836FDOQ4848836

Authors: Hristo N. Djidjev, Andrzej Lingas 

Publication date: 16 April 1996

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195995000192

Recommendations

• scientific article; zbMATH DE number 177538
• On parallel computation of Voronoi diagrams
• Sorting helps for Voronoi diagrams
• A sweepline algorithm for Voronoi diagrams
• scientific article; zbMATH DE number 4098181

zbMATH Keywords

Voronoi diagramtime complexitymonotone histograms

Mathematics Subject Classification ID

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

Cited In (12)

• Computing convex-straight-skeleton Voronoi diagrams for segments and convex polygons
• Title not available (Why is that?)
• Optimal computation of the Voronoi diagram of disjoint clusters
• Robust Point-Location in Generalized Voronoi Diagrams
• Time-space trade-offs for triangulations and Voronoi diagrams
• Voronoi diagrams for a moderate-sized point-set in a simple polygon
• Delaunay Triangulation of Imprecise Points Simplified and Extended
• Computing hereditary convex structures
• VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• A nearly parallel algorithm for the Voronoi diagram of a convex polygon
• Title not available (Why is that?)

This page was built for publication: ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS

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