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

Full description

Bibliographic Details

Published in:	Computational geometry : theory and applications Vol. 34; no. 2; pp. 75 - 82
Main Authors:	Brönnimann, Hervé, Chan, Timothy M.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.05.2006
Subjects:	Computational geometry Convex hull Space-efficient algorithm Computational geometry Space-efficient algorithm Convex hull
ISSN:	0925-7721
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!