Computing a Geodesic Two-Center of Points in a Simple Polygon

10/27/2019
by   Eunjin Oh, et al.
0

Given a simple polygon P and a set Q of points contained in P, we consider the geodesic k-center problem where we want to find k points, called centers, in P to minimize the maximum geodesic distance of any point of Q to its closest center. In this paper, we focus on the case for k=2 and present the first exact algorithm that efficiently computes an optimal 2-center of Q with respect to the geodesic distance in P.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2017

The Geodesic 2-center Problem in a Simple Polygon

The geodesic k-center problem in a simple polygon with n vertices consis...
research
05/07/2018

Capturing points with a rotating polygon (and a 3D extension)

We study the problem of rotating a simple polygon to contain the maximum...
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...
research
12/18/2017

Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading

We consider dynamic loading and unloading problems for heavy geometric o...
research
12/24/2018

3-Colorable Delaunay Triangulations

We propose an algorithm to create a 3-colorable Delaunay Triangulation. ...
research
02/18/2020

Coreset-based Strategies for Robust Center-type Problems

Given a dataset V of points from some metric space, the popular k-center...
research
04/20/2023

Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities

In this paper, we study the problems of computing the 1-center, centroid...

Please sign up or login with your details

Forgot password? Click here to reset