Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes

DOI10.1137/1.9781611973105.117zbMath1422.68251OpenAlexW4231400019MaRDI QIDQ5741826

Chih-Hung Liu, Der-Tsai Lee

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ed54746a815040c21353e146411d4a14d212fbc7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (8)

A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams ⋮ A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams ⋮ An efficient randomized algorithm for higher-order abstract Voronoi diagrams ⋮ Dynamic data structures for \(k\)-nearest neighbor queries ⋮ Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon ⋮ Shortest rectilinear path queries to rectangles in a rectangular domain ⋮ Voronoi diagrams for a moderate-sized point-set in a simple polygon ⋮ Unnamed Item

This page was built for publication: Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes