The Geodesic 2-center Problem in a Simple Polygon

10/25/2017
by   Eunjin Oh, et al.
0

The geodesic k-center problem in a simple polygon with n vertices consists in the following. Find a set S of k points in the polygon that minimizes the maximum geodesic distance from any point of the polygon to its closest point in S. In this paper, we focus on the case where k=2 and present an exact algorithm that returns a geodesic 2-center in O(n^2^2 n) time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2019

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

Given a simple polygon P and a set Q of points contained in P, we consid...
research
08/16/2021

The Visibility Center of a Simple Polygon

We introduce the visibility center of a set of points inside a polygon –...
research
03/24/2019

Generalization of k-means Related Algorithms

This article briefly introduced Arthur and Vassilvitshii's work on k-mea...
research
05/28/2020

Evaluation of the general applicability of Dragoon for the k-center problem

The k-center problem is a fundamental problem we often face when conside...
research
01/05/2023

The Evolutionary Computation Methods No One Should Use

The center-bias (or zero-bias) operator has recently been identified as ...
research
11/17/2021

The Polygon Burning Problem

Motivated by the k-center problem in location analysis, we consider the ...
research
11/27/2021

Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model

The k-center problem is to choose a subset of size k from a set of n poi...

Please sign up or login with your details

Forgot password? Click here to reset