Convex hulls in polygonal domains

Luis Barba, Michael Hoffmann, Matias Korman, Alexander Pilz

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

We study generalizations of convex hulls to polygonal domains with holes. Convexity in Euclidean space is based on the notion of shortest paths, which are straight-line segments. In a polygonal domain, shortest paths are polygonal paths called geodesics. One possible generalization of convex hulls is based on the “rubber band” conception of the convex hull boundary as a shortest curve that encloses a given set of sites. However, it is NP-hard to compute such a curve in a general polygonal domain. Hence, we focus on a di erent, more direct generalization of convexity, where a set X is geodesically convex if it contains all geodesics between every pair of points x, y ∈ X. The corresponding geodesic convex hull presents a few surprises, and turns out to behave quite di erently compared to the classic Euclidean setting or to the geodesic hull inside a simple polygon. We describe a class of geometric objects that su ce to represent geodesic convex hulls of sets of sites, and characterize which such domains are geodesically convex. Using such a representation we present an algorithm to construct the geodesic convex hull of a set of O(n) sites in a polygonal domain with a total of n vertices and h holes in O(n3h3+ε) time, for any constant ε > 0.

Original languageEnglish
Title of host publication16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018
PublisherSchloss Dagstuhl, Leibniz-Zentrum fü Informatik GmbH
Pages81-813
Number of pages733
Volume101
ISBN (Electronic)9783959770682
DOIs
Publication statusPublished - 1 Jun 2018
Externally publishedYes
Event16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018 - Malmo, Sweden
Duration: 18 Jun 201820 Jun 2018

Conference

Conference16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018
CountrySweden
CityMalmo
Period18/06/1820/06/18

Fingerprint

Rubber

Keywords

  • Geodesic hull
  • Phrases geometric graph
  • Polygonal domain
  • Shortest path

ASJC Scopus subject areas

  • Software

Cite this

Barba, L., Hoffmann, M., Korman, M., & Pilz, A. (2018). Convex hulls in polygonal domains. In 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018 (Vol. 101, pp. 81-813). Schloss Dagstuhl, Leibniz-Zentrum fü Informatik GmbH. https://doi.org/10.4230/LIPIcs.SWAT.2018.8

Convex hulls in polygonal domains. / Barba, Luis; Hoffmann, Michael; Korman, Matias; Pilz, Alexander.

16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018. Vol. 101 Schloss Dagstuhl, Leibniz-Zentrum fü Informatik GmbH, 2018. p. 81-813.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Barba, L, Hoffmann, M, Korman, M & Pilz, A 2018, Convex hulls in polygonal domains. in 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018. vol. 101, Schloss Dagstuhl, Leibniz-Zentrum fü Informatik GmbH, pp. 81-813, 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018, Malmo, Sweden, 18/06/18. https://doi.org/10.4230/LIPIcs.SWAT.2018.8
Barba L, Hoffmann M, Korman M, Pilz A. Convex hulls in polygonal domains. In 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018. Vol. 101. Schloss Dagstuhl, Leibniz-Zentrum fü Informatik GmbH. 2018. p. 81-813 https://doi.org/10.4230/LIPIcs.SWAT.2018.8
Barba, Luis ; Hoffmann, Michael ; Korman, Matias ; Pilz, Alexander. / Convex hulls in polygonal domains. 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018. Vol. 101 Schloss Dagstuhl, Leibniz-Zentrum fü Informatik GmbH, 2018. pp. 81-813
@inproceedings{e4528d1778934794af1853018db0d2f8,
title = "Convex hulls in polygonal domains",
abstract = "We study generalizations of convex hulls to polygonal domains with holes. Convexity in Euclidean space is based on the notion of shortest paths, which are straight-line segments. In a polygonal domain, shortest paths are polygonal paths called geodesics. One possible generalization of convex hulls is based on the “rubber band” conception of the convex hull boundary as a shortest curve that encloses a given set of sites. However, it is NP-hard to compute such a curve in a general polygonal domain. Hence, we focus on a di erent, more direct generalization of convexity, where a set X is geodesically convex if it contains all geodesics between every pair of points x, y ∈ X. The corresponding geodesic convex hull presents a few surprises, and turns out to behave quite di erently compared to the classic Euclidean setting or to the geodesic hull inside a simple polygon. We describe a class of geometric objects that su ce to represent geodesic convex hulls of sets of sites, and characterize which such domains are geodesically convex. Using such a representation we present an algorithm to construct the geodesic convex hull of a set of O(n) sites in a polygonal domain with a total of n vertices and h holes in O(n3h3+ε) time, for any constant ε > 0.",
keywords = "Geodesic hull, Phrases geometric graph, Polygonal domain, Shortest path",
author = "Luis Barba and Michael Hoffmann and Matias Korman and Alexander Pilz",
year = "2018",
month = "6",
day = "1",
doi = "10.4230/LIPIcs.SWAT.2018.8",
language = "English",
volume = "101",
pages = "81--813",
booktitle = "16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018",
publisher = "Schloss Dagstuhl, Leibniz-Zentrum f{\"u} Informatik GmbH",
address = "Germany",

}

TY - GEN

T1 - Convex hulls in polygonal domains

AU - Barba, Luis

AU - Hoffmann, Michael

AU - Korman, Matias

AU - Pilz, Alexander

PY - 2018/6/1

Y1 - 2018/6/1

N2 - We study generalizations of convex hulls to polygonal domains with holes. Convexity in Euclidean space is based on the notion of shortest paths, which are straight-line segments. In a polygonal domain, shortest paths are polygonal paths called geodesics. One possible generalization of convex hulls is based on the “rubber band” conception of the convex hull boundary as a shortest curve that encloses a given set of sites. However, it is NP-hard to compute such a curve in a general polygonal domain. Hence, we focus on a di erent, more direct generalization of convexity, where a set X is geodesically convex if it contains all geodesics between every pair of points x, y ∈ X. The corresponding geodesic convex hull presents a few surprises, and turns out to behave quite di erently compared to the classic Euclidean setting or to the geodesic hull inside a simple polygon. We describe a class of geometric objects that su ce to represent geodesic convex hulls of sets of sites, and characterize which such domains are geodesically convex. Using such a representation we present an algorithm to construct the geodesic convex hull of a set of O(n) sites in a polygonal domain with a total of n vertices and h holes in O(n3h3+ε) time, for any constant ε > 0.

AB - We study generalizations of convex hulls to polygonal domains with holes. Convexity in Euclidean space is based on the notion of shortest paths, which are straight-line segments. In a polygonal domain, shortest paths are polygonal paths called geodesics. One possible generalization of convex hulls is based on the “rubber band” conception of the convex hull boundary as a shortest curve that encloses a given set of sites. However, it is NP-hard to compute such a curve in a general polygonal domain. Hence, we focus on a di erent, more direct generalization of convexity, where a set X is geodesically convex if it contains all geodesics between every pair of points x, y ∈ X. The corresponding geodesic convex hull presents a few surprises, and turns out to behave quite di erently compared to the classic Euclidean setting or to the geodesic hull inside a simple polygon. We describe a class of geometric objects that su ce to represent geodesic convex hulls of sets of sites, and characterize which such domains are geodesically convex. Using such a representation we present an algorithm to construct the geodesic convex hull of a set of O(n) sites in a polygonal domain with a total of n vertices and h holes in O(n3h3+ε) time, for any constant ε > 0.

KW - Geodesic hull

KW - Phrases geometric graph

KW - Polygonal domain

KW - Shortest path

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

U2 - 10.4230/LIPIcs.SWAT.2018.8

DO - 10.4230/LIPIcs.SWAT.2018.8

M3 - Conference contribution

VL - 101

SP - 81

EP - 813

BT - 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018

PB - Schloss Dagstuhl, Leibniz-Zentrum fü Informatik GmbH

ER -