Covering convex polygons by two congruent disks

DOI10.1007/978-3-030-79987-8_12OpenAlexW3184287481MaRDI QIDQ5970791

Dahye Jeong, Hee-Kap Ahn, Jong Min Choi

Publication date: 22 March 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.02483

zbMATH Keywords

coveringconvex polygontwo-center problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Uses Software

• Miniball

Cites Work

• 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
• 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
• 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 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

This page was built for publication: Covering convex polygons by two congruent disks