Computing the link center of a simple polygon

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The link center of a simple polygon P is the set of points x inside P at which the maximal link-distancefrom x to any other point in P is minimized, where the link distance between two points x, y inside P isdefined as the smallest number of straight edges in a polygonal path inside P connecting x to y. We proveseveral geometric properties of the link center and present an algorithm that calculates this set in time0(n2), where n is the number of sides of P. We also give an 0 (n log n) algorithm for finding apoint x in an approximate link center, namely the maximal link distance from x to any point in P is at most one more than the value attained from the link center.

Original languageEnglish (US)
Title of host publicationProceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987
PublisherAssociation for Computing Machinery, Inc
Pages1-10
Number of pages10
ISBN (Electronic)0897912314, 9780897912310
DOIs
StatePublished - Oct 1 1987
Event3rd Annual Symposium on Computational Geometry, SCG 1987 - Waterloo, Canada
Duration: Jun 8 1987Jun 10 1987

Other

Other3rd Annual Symposium on Computational Geometry, SCG 1987
CountryCanada
CityWaterloo
Period6/8/876/10/87

Fingerprint

Simple Polygon
Computing
Set of points
Straight
Calculate
Path

ASJC Scopus subject areas

  • Geometry and Topology
  • Computational Mathematics

Cite this

Lenhart, W., Pollack, R., Sack, J., Seidel, R., Shari, M., Suri, S., ... Yap, C. (1987). Computing the link center of a simple polygon. In Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987 (pp. 1-10). Association for Computing Machinery, Inc. https://doi.org/10.1145/41958.41959

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

Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987. Association for Computing Machinery, Inc, 1987. p. 1-10.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lenhart, W, Pollack, R, Sack, J, Seidel, R, Shari, M, Suri, S, Toussaint, G, Whitesides, S & Yap, C 1987, Computing the link center of a simple polygon. in Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987. Association for Computing Machinery, Inc, pp. 1-10, 3rd Annual Symposium on Computational Geometry, SCG 1987, Waterloo, Canada, 6/8/87. https://doi.org/10.1145/41958.41959
Lenhart W, Pollack R, Sack J, Seidel R, Shari M, Suri S et al. Computing the link center of a simple polygon. In Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987. Association for Computing Machinery, Inc. 1987. p. 1-10 https://doi.org/10.1145/41958.41959
Lenhart, W. ; Pollack, R. ; Sack, J. ; Seidel, R. ; Shari, M. ; Suri, S. ; Toussaint, Godfried ; Whitesides, S. ; Yap, Chee. / Computing the link center of a simple polygon. Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987. Association for Computing Machinery, Inc, 1987. pp. 1-10
@inproceedings{0b7f2e54c0c54357aa57507193d65121,
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-distancefrom x to any other point in P is minimized, where the link distance between two points x, y inside P isdefined as the smallest number of straight edges in a polygonal path inside P connecting x to y. We proveseveral geometric properties of the link center and present an algorithm that calculates this set in time0(n2), where n is the number of sides of P. We also give an 0 (n log n) algorithm for finding apoint x in an approximate link center, namely the maximal link distance from x to any point in P is at most one more than the value attained from the link center.",
author = "W. Lenhart and R. Pollack and J. Sack and R. Seidel and M. Shari and S. Suri and Godfried Toussaint and S. Whitesides and Chee Yap",
year = "1987",
month = "10",
day = "1",
doi = "10.1145/41958.41959",
language = "English (US)",
pages = "1--10",
booktitle = "Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987",
publisher = "Association for Computing Machinery, Inc",

}

TY - GEN

T1 - Computing the link center of a simple polygon

AU - Lenhart, W.

AU - Pollack, R.

AU - Sack, J.

AU - Seidel, R.

AU - Shari, M.

AU - Suri, S.

AU - Toussaint, Godfried

AU - Whitesides, S.

AU - Yap, Chee

PY - 1987/10/1

Y1 - 1987/10/1

N2 - The link center of a simple polygon P is the set of points x inside P at which the maximal link-distancefrom x to any other point in P is minimized, where the link distance between two points x, y inside P isdefined as the smallest number of straight edges in a polygonal path inside P connecting x to y. We proveseveral geometric properties of the link center and present an algorithm that calculates this set in time0(n2), where n is the number of sides of P. We also give an 0 (n log n) algorithm for finding apoint x in an approximate link center, namely the maximal link distance from x to any point in P is at most one more than the value attained from the link center.

AB - The link center of a simple polygon P is the set of points x inside P at which the maximal link-distancefrom x to any other point in P is minimized, where the link distance between two points x, y inside P isdefined as the smallest number of straight edges in a polygonal path inside P connecting x to y. We proveseveral geometric properties of the link center and present an algorithm that calculates this set in time0(n2), where n is the number of sides of P. We also give an 0 (n log n) algorithm for finding apoint x in an approximate link center, namely the maximal link distance from x to any point in P is at most one more than the value attained from the link center.

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

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

U2 - 10.1145/41958.41959

DO - 10.1145/41958.41959

M3 - Conference contribution

AN - SCOPUS:85036466524

SP - 1

EP - 10

BT - Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987

PB - Association for Computing Machinery, Inc

ER -