ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS

DOI10.1142/S0218195995000192zbMath0835.68121OpenAlexW2156742832MaRDI QIDQ4848836

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

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)

Related Items (5)

Time-space trade-offs for triangulations and Voronoi diagrams ⋮ Delaunay Triangulation of Imprecise Points Simplified and Extended ⋮ Preprocessing imprecise points for Delaunay triangulation: simplified and extended ⋮ Computing hereditary convex structures ⋮ A nearly parallel algorithm for the Voronoi diagram of a convex polygon

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