A straightforward iterative algorithm for the planar Voronoi diagram

DOI10.1016/0020-0190(90)90095-FzbMath0695.68046MaRDI QIDQ910230

John C. Tipper

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

triangulationVoronoi diagramgraphicsspatial data structures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Data structures (68P05)

Related Items (2)

A straightforward algorithm for computing the medial axis of a simple polygon ⋮ A Poisson-Voronoi-based finite element stress analysis of resonating polysilicon micromachines

Cites Work

• Unnamed Item
• Unnamed Item
• Simulation of nonhomogeneous poisson processes by thinning
• Delaunay triangulation and the convex hull of n points in expected linear time
• Voronoi diagrams from convex hulls
• On the homogeneous planar Poisson point process
• Two algorithms for constructing a Delaunay triangulation
• Computing Dirichlet Tessellations in the Plane
• [https://portal.mardi4nfdi.de/wiki/Publication:5728818 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten]

This page was built for publication: A straightforward iterative algorithm for the planar Voronoi diagram