Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes
From MaRDI portal
Publication:5741826
DOI10.1137/1.9781611973105.117zbMath1422.68251MaRDI QIDQ5741826
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
68Q25: Analysis of algorithms and problem complexity
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Unnamed Item, Shortest rectilinear path queries to rectangles in a rectangular domain, Dynamic data structures for \(k\)-nearest neighbor queries, Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon, A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams, Voronoi diagrams for a moderate-sized point-set in a simple polygon, An efficient randomized algorithm for higher-order abstract Voronoi diagrams, A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams