Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time

We present space-efficient algorithms for computing the convex hull of a simple polygonal line in-place, in linear time. It turns out that the problem is as hard as in-place stable partition, i.e., if there were a truly simple solution then in-place stable partition would also have a truly simple so...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computational geometry : theory and applications Jg. 34; H. 2; S. 75 - 82
Hauptverfasser:	Brönnimann, Hervé, Chan, Timothy M.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.05.2006
Schlagworte:	Computational geometry Convex hull Space-efficient algorithm Computational geometry Space-efficient algorithm Convex hull
ISSN:	0925-7721
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!