The Ultimate Planar Convex Hull Algorithm ?
| dc.contributor.author | Kirkpatrick, David G. | en_US |
| dc.contributor.author | Seidel, Raimund | en_US |
| dc.date.accessioned | 2007-04-23T16:49:25Z | |
| dc.date.available | 2007-04-23T16:49:25Z | |
| dc.date.issued | 1983-10 | en_US |
| dc.description.abstract | We 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.extent | 1229097 bytes | |
| dc.format.extent | 378517 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR83-577 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6417 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | The Ultimate Planar Convex Hull Algorithm ? | en_US |
| dc.type | technical report | en_US |