Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
From MaRDI portal
Publication:6179409
DOI10.1007/978-3-031-38906-1_13OpenAlexW4385362959MaRDI QIDQ6179409
Anthony D'Angelo, Prosenjit Bose, Stephane Durocher
Publication date: 16 January 2024
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38906-1_13
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the geodesic center of a simple polygon
- On enclosing k points by a circle
- A linear-time algorithm for the geodesic center of a simple polygon
- Visibility and intersection problems in plane geometry
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Applications of the theory of records in the study of random trees
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Triangulating a simple polygon in linear time
- A new data structure for shortest path queries in a simple polygon
- The furthest-site geodesic Voronoi diagram
- Iterated nearest neighbors and finding minimal polytopes
- Computing the smallest \(k\)-enclosing circle and related problems
- Time bounds for selection
- Lectures on analysis on metric spaces
- The geodesic 2-center problem in a simple polygon
- Computing the geodesic centers of a polygonal domain
- Fast algorithms for computing the smallest \(k\)-enclosing circle
- Geometric applications of a randomized optimization technique
- Optimal shortest path queries in a simple polygon
- On geometric optimization with few violated constraints
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- Computing a geodesic two-center of points in a simple polygon
- Finding k points with minimum diameter and related problems
- Euclidean shortest paths in the presence of rectilinear barriers
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Routing past unions of disjoint linear barriers
- Optimal Search in Planar Subdivisions
- Fast Deterministic Selection
- GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON
- Static and Dynamic Algorithms for k-Point Clustering Problems
- Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons
- GEODESIC-PRESERVING POLYGON SIMPLIFICATION
- Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes
- Dynamic data structures for \(k\)-nearest neighbor queries
