AI Chat AI Image Generator AI Video Text to Speech

Covering Convex Polygons by Two Congruent Disks

05/06/2021

∙

by Jongmin Choi, et al.

∙

∙

We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an O(nlog n)-time algorithm for the two-center problem for a convex polygon, where n is the number of vertices of the polygon. This improves upon the previous best algorithm for the problem.

Jongmin Choi
2 publications
Dahye Jeong
1 publication
Hee-Kap Ahn
21 publications

page 1

page 2

page 3

page 4

research

∙ 06/18/2020

Efficient Planar Two-Center Algorithms

We consider the planar Euclidean two-center problem in which given n poi...

0 Jongmin Choi, et al. ∙

research

∙ 04/19/2022

An Efficient Algorithm for the Proximity Connected Two Center Problem

Given a set P of n points in the plane, the k-center problem is to find ...

0 Binay Bhattacharya, et al. ∙

research

∙ 09/27/2022

An O(3.82^k) Time FPT Algorithm for Convex Flip Distance

Let P be a convex polygon in the plane, and let T be a triangulation of ...

0 Haohong Li, et al. ∙

research

∙ 07/03/2023

A numerical algorithm for attaining the Chebyshev bound in optimal learning

Given a compact subset of a Banach space, the Chebyshev center problem c...

0 Pradyumna Paruchuri, et al. ∙

research

∙ 07/01/2023

Maximum Overlap Area of Several Convex Polygons Under Translations

Let k ≥ 2 be a constant. Given any k convex polygons in the plane with a...

0 Hyuk Jun Kweon, et al. ∙

research

∙ 03/13/2023

Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023

We give an overview of the 2023 Computational Geometry Challenge targeti...

0 Sandor P. Fekete, et al. ∙

research

∙ 02/05/2018

Un-unzippable Convex Caps

An unzipping of a polyhedron P is a cut-path through its vertices that u...

0 Joseph O'Rourke, et al. ∙