A LINEAR-TIME RANDOMIZED ALGORITHM FOR THE BOUNDED VORONOI DIAGRAM OF A SIMPLE POLYGON
From MaRDI portal
Publication:5687650
DOI10.1142/S0218195996000198zbMath0859.68113OpenAlexW2097412293MaRDI QIDQ5687650
Publication date: 16 December 1996
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195996000198
Related Items
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon, A linear-time construction of the relative neighborhood graph within a histogram, The natural volume method (NVM): Presentation and application to shallow water inviscid flows, Reale: a Reconnection-based Arbitrary-Lagrangian-Eulerian method, Conformal mapping in linear time, A nearly parallel algorithm for the Voronoi diagram of a convex polygon