Intersecting disks using two congruent disks

DOI10.1016/j.comgeo.2022.101966OpenAlexW4308990269MaRDI QIDQ5925580

Jong Min Choi, Byeonguk Kang, Hee-Kap Ahn

Publication date: 9 January 2023

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2022.101966

zbMATH Keywords

disks2-center2-cover2-piercing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Computing methodologies and applications (68Uxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sweepline algorithm for Voronoi diagrams
• A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons
• The slab dividing approach to solve the Euclidean \(P\)-center problem
• A near-linear algorithm for the planar 2-center problem
• Geometric applications of a randomized optimization technique
• Covering and piercing disks with two centers
• The 2-center problem in three dimensions
• More planar two-center algorithms
• Efficient planar two-center algorithms
• Selecting distances in the plane
• The 2-Center Problem with Obstacles
• Finding tailored partitions
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Linear Programming in Linear Time When the Dimension Is Fixed
• Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming
• Slowing down sorting networks to obtain faster sorting algorithms
• On the rectangularp-center problem

This page was built for publication: Intersecting disks using two congruent disks