Computing the link center of a simple polygon

W. Lenhart, R. Pollack, J. Sack, R. Seidel, M. Sharir, S. Suri, Godfried Toussaint, S. Whitesides, Chee Yap

Research output: Contribution to journalArticle

Abstract

The link center of a simple polygon P is the set of points x inside P at which the maximal link-distance from x to any other point in P is minimized. Here the link distance between two points x, y inside P is defined to be the smallest number of straight edges in a polygonal path inside P connecting x to y. We prove several geometric properties of the link center and present an algorithm that calculates this set in time O(n2), where n is the number of sides of P. We also give an O(n log n) algorithm for finding an approximate link center, that is, a point x such that the maximal link distance from x to any point in P is at most one more than the value attained from the true link center.

Original languageEnglish (US)
Pages (from-to)281-293
Number of pages13
JournalDiscrete and Computational Geometry
Volume3
Issue number1
DOIs
StatePublished - Dec 1988

Fingerprint

Simple Polygon
Computing
Set of points
Straight
Calculate
Path

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this

Lenhart, W., Pollack, R., Sack, J., Seidel, R., Sharir, M., Suri, S., ... Yap, C. (1988). Computing the link center of a simple polygon. Discrete and Computational Geometry, 3(1), 281-293. https://doi.org/10.1007/BF02187913

Computing the link center of a simple polygon. / Lenhart, W.; Pollack, R.; Sack, J.; Seidel, R.; Sharir, M.; Suri, S.; Toussaint, Godfried; Whitesides, S.; Yap, Chee.

In: Discrete and Computational Geometry, Vol. 3, No. 1, 12.1988, p. 281-293.

Research output: Contribution to journalArticle

Lenhart, W, Pollack, R, Sack, J, Seidel, R, Sharir, M, Suri, S, Toussaint, G, Whitesides, S & Yap, C 1988, 'Computing the link center of a simple polygon', Discrete and Computational Geometry, vol. 3, no. 1, pp. 281-293. https://doi.org/10.1007/BF02187913
Lenhart W, Pollack R, Sack J, Seidel R, Sharir M, Suri S et al. Computing the link center of a simple polygon. Discrete and Computational Geometry. 1988 Dec;3(1):281-293. https://doi.org/10.1007/BF02187913
Lenhart, W. ; Pollack, R. ; Sack, J. ; Seidel, R. ; Sharir, M. ; Suri, S. ; Toussaint, Godfried ; Whitesides, S. ; Yap, Chee. / Computing the link center of a simple polygon. In: Discrete and Computational Geometry. 1988 ; Vol. 3, No. 1. pp. 281-293.
@article{514d2abeb0f941b8ba5e7b3552cd34e6,
title = "Computing the link center of a simple polygon",
abstract = "The link center of a simple polygon P is the set of points x inside P at which the maximal link-distance from x to any other point in P is minimized. Here the link distance between two points x, y inside P is defined to be the smallest number of straight edges in a polygonal path inside P connecting x to y. We prove several geometric properties of the link center and present an algorithm that calculates this set in time O(n2), where n is the number of sides of P. We also give an O(n log n) algorithm for finding an approximate link center, that is, a point x such that the maximal link distance from x to any point in P is at most one more than the value attained from the true link center.",
author = "W. Lenhart and R. Pollack and J. Sack and R. Seidel and M. Sharir and S. Suri and Godfried Toussaint and S. Whitesides and Chee Yap",
year = "1988",
month = "12",
doi = "10.1007/BF02187913",
language = "English (US)",
volume = "3",
pages = "281--293",
journal = "Discrete and Computational Geometry",
issn = "0179-5376",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - Computing the link center of a simple polygon

AU - Lenhart, W.

AU - Pollack, R.

AU - Sack, J.

AU - Seidel, R.

AU - Sharir, M.

AU - Suri, S.

AU - Toussaint, Godfried

AU - Whitesides, S.

AU - Yap, Chee

PY - 1988/12

Y1 - 1988/12

N2 - The link center of a simple polygon P is the set of points x inside P at which the maximal link-distance from x to any other point in P is minimized. Here the link distance between two points x, y inside P is defined to be the smallest number of straight edges in a polygonal path inside P connecting x to y. We prove several geometric properties of the link center and present an algorithm that calculates this set in time O(n2), where n is the number of sides of P. We also give an O(n log n) algorithm for finding an approximate link center, that is, a point x such that the maximal link distance from x to any point in P is at most one more than the value attained from the true link center.

AB - The link center of a simple polygon P is the set of points x inside P at which the maximal link-distance from x to any other point in P is minimized. Here the link distance between two points x, y inside P is defined to be the smallest number of straight edges in a polygonal path inside P connecting x to y. We prove several geometric properties of the link center and present an algorithm that calculates this set in time O(n2), where n is the number of sides of P. We also give an O(n log n) algorithm for finding an approximate link center, that is, a point x such that the maximal link distance from x to any point in P is at most one more than the value attained from the true link center.

UR - http://www.scopus.com/inward/record.url?scp=0041111213&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0041111213&partnerID=8YFLogxK

U2 - 10.1007/BF02187913

DO - 10.1007/BF02187913

M3 - Article

VL - 3

SP - 281

EP - 293

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

SN - 0179-5376

IS - 1

ER -