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...

Celý popis

Podrobná bibliografia

Vydané v:	Computational geometry : theory and applications Ročník 34; číslo 2; s. 75 - 82
Hlavní autori:	Brönnimann, Hervé, Chan, Timothy M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.05.2006
Predmet:	Computational geometry Convex hull Space-efficient algorithm Computational geometry Space-efficient algorithm Convex hull
ISSN:	0925-7721
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!