Show simple item record

dc.contributor.authorKirkpatrick, David G.en_US
dc.contributor.authorSeidel, Raimunden_US
dc.date.accessioned2007-04-23T16:49:25Z
dc.date.available2007-04-23T16:49:25Z
dc.date.issued1983-10en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR83-577en_US
dc.identifier.urihttps://hdl.handle.net/1813/6417
dc.description.abstractWe present a new planar convex hull algorithm with worst case time complexity $O(n \log H)$ where $n$ is the size of the input set and $H$ is the size of the output set, i.e. the number of vertices found to be on the hull. We also show that this algorithm is asymptotically worst case optimal on a rather realistic model of computation even if the complexity of the problem is measured in terms of input as well as output size. The algorithm relies on a variation of the divide-and-conquer paradigm which we call the "marriage-before-conquest" principle and which appears to be interesting in its own right.en_US
dc.format.extent1229097 bytes
dc.format.extent378517 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleThe Ultimate Planar Convex Hull Algorithm ?en_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics