Covering convex polygons by two congruent disks
From MaRDI portal
Publication:5918557
DOI10.1016/j.comgeo.2022.101936OpenAlexW3157966405WikidataQ114195423 ScholiaQ114195423MaRDI QIDQ5918557
Dahye Jeong, Jong Min Choi, Hee-Kap Ahn
Publication date: 16 November 2022
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2022.101936
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Computing methodologies and applications (68Uxx)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Base station placement on boundary of a convex polygon
- A linear-time algorithm for the geodesic center of a simple polygon
- An improved data stream algorithm for clustering
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Clustering to minimize the maximum intercluster distance
- The slab dividing approach to solve the Euclidean \(P\)-center problem
- On the ball spanned by balls
- A near-linear algorithm for the planar 2-center problem
- Exact and approximation algorithms for clustering
- The geodesic 2-center problem in a simple polygon
- Covering and piercing disks with two centers
- The 2-center problem in three dimensions
- More planar two-center algorithms
- On the planar two-center problem and circular hulls
- Efficient planar two-center algorithms
- Largest bounding box, smallest diameter, and related problems on imprecise points
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems
- Streaming algorithms for extent problems in high dimensions
- Adaptive sampling for geometric problems over data streams
- COMPUTING k CENTERS OVER STREAMING DATA FOR SMALL k
- Finding tailored partitions
- VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
- On the shape of a set of points in the plane
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Linear Programming in Linear Time When the Dimension Is Fixed
- Slowing down sorting networks to obtain faster sorting algorithms
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model
- Constrained k-Center Problem on a Convex Polygon
