Constructing strongly convex hulls using exact or rounded arithmetic

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

15 Citations (Scopus)

Abstract

One useful generalization of the convex hull of a set S of points is the ε-strongly convex δ-hull. It is defined to be a convex polygon P with vertices taken from S such that no point in S lies farther than δ outside P and such that even if the vertices of P are perturbed by as much as ε, P remains convex. It was an open question as to whether an ε-strongly convex O(ε)-hull existed for all positive ε. We give here an O(n log n) algorithm for constructing it (which thus proves its existence). This algorithm uses exact rational arithmetic. We also show how to construct an ε-strongly convex O(ε + μ)-hull in O(n log n) time using rounded arithmetic with rounding unit μ. This is the first rounded arithmetic convex hull algorithm which guarantees a convex output and which has error independent of n.

Original languageEnglish (US)
Title of host publicationProc Sixth Annu Symp Comput Geom
PublisherPubl by ACM
Pages235-243
Number of pages9
ISBN (Print)0897913620
StatePublished - 1990
Externally publishedYes
EventProceedings of the Sixth Annual Symposium on Computational Geometry - Berkeley, CA, USA
Duration: Jun 6 1990Jun 8 1990

Other

OtherProceedings of the Sixth Annual Symposium on Computational Geometry
CityBerkeley, CA, USA
Period6/6/906/8/90

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Li, Z., & Milenkovic, V. (1990). Constructing strongly convex hulls using exact or rounded arithmetic. In Proc Sixth Annu Symp Comput Geom (pp. 235-243). Publ by ACM.

Constructing strongly convex hulls using exact or rounded arithmetic. / Li, Zhenyu; Milenkovic, Victor.

Proc Sixth Annu Symp Comput Geom. Publ by ACM, 1990. p. 235-243.

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

Li, Z & Milenkovic, V 1990, Constructing strongly convex hulls using exact or rounded arithmetic. in Proc Sixth Annu Symp Comput Geom. Publ by ACM, pp. 235-243, Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, 6/6/90.
Li Z, Milenkovic V. Constructing strongly convex hulls using exact or rounded arithmetic. In Proc Sixth Annu Symp Comput Geom. Publ by ACM. 1990. p. 235-243
Li, Zhenyu ; Milenkovic, Victor. / Constructing strongly convex hulls using exact or rounded arithmetic. Proc Sixth Annu Symp Comput Geom. Publ by ACM, 1990. pp. 235-243
@inproceedings{d8ee6a589e1f4d24814ae8fbe02154e1,
title = "Constructing strongly convex hulls using exact or rounded arithmetic",
abstract = "One useful generalization of the convex hull of a set S of points is the ε-strongly convex δ-hull. It is defined to be a convex polygon P with vertices taken from S such that no point in S lies farther than δ outside P and such that even if the vertices of P are perturbed by as much as ε, P remains convex. It was an open question as to whether an ε-strongly convex O(ε)-hull existed for all positive ε. We give here an O(n log n) algorithm for constructing it (which thus proves its existence). This algorithm uses exact rational arithmetic. We also show how to construct an ε-strongly convex O(ε + μ)-hull in O(n log n) time using rounded arithmetic with rounding unit μ. This is the first rounded arithmetic convex hull algorithm which guarantees a convex output and which has error independent of n.",
author = "Zhenyu Li and Victor Milenkovic",
year = "1990",
language = "English (US)",
isbn = "0897913620",
pages = "235--243",
booktitle = "Proc Sixth Annu Symp Comput Geom",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Constructing strongly convex hulls using exact or rounded arithmetic

AU - Li, Zhenyu

AU - Milenkovic, Victor

PY - 1990

Y1 - 1990

N2 - One useful generalization of the convex hull of a set S of points is the ε-strongly convex δ-hull. It is defined to be a convex polygon P with vertices taken from S such that no point in S lies farther than δ outside P and such that even if the vertices of P are perturbed by as much as ε, P remains convex. It was an open question as to whether an ε-strongly convex O(ε)-hull existed for all positive ε. We give here an O(n log n) algorithm for constructing it (which thus proves its existence). This algorithm uses exact rational arithmetic. We also show how to construct an ε-strongly convex O(ε + μ)-hull in O(n log n) time using rounded arithmetic with rounding unit μ. This is the first rounded arithmetic convex hull algorithm which guarantees a convex output and which has error independent of n.

AB - One useful generalization of the convex hull of a set S of points is the ε-strongly convex δ-hull. It is defined to be a convex polygon P with vertices taken from S such that no point in S lies farther than δ outside P and such that even if the vertices of P are perturbed by as much as ε, P remains convex. It was an open question as to whether an ε-strongly convex O(ε)-hull existed for all positive ε. We give here an O(n log n) algorithm for constructing it (which thus proves its existence). This algorithm uses exact rational arithmetic. We also show how to construct an ε-strongly convex O(ε + μ)-hull in O(n log n) time using rounded arithmetic with rounding unit μ. This is the first rounded arithmetic convex hull algorithm which guarantees a convex output and which has error independent of n.

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

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

M3 - Conference contribution

SN - 0897913620

SP - 235

EP - 243

BT - Proc Sixth Annu Symp Comput Geom

PB - Publ by ACM

ER -