An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments

DOI10.1007/978-3-319-15612-5_12zbMath1432.68485OpenAlexW2224227658MaRDI QIDQ5176578

Sang Won Bae

Publication date: 27 February 2015

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15612-5_12

Mathematics Subject Classification ID

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

Related Items (1)

An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments

This page was built for publication: An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments