Uwe Rösler, William Steiger, David Kravitz  Home/Search
Context
Related
| rutgers.edu/~steiger/hull.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rutgers.edu/~steiger/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a very simple algorithm - NEWHULL - to find the convex hull of S = {P 1 , . . . , Pn}, n given points in R 2 . It may be thought of as a variant of Quickhull; however if the hull of S has h vertices, the algorithm runs in time #(n log h), worstcase. On the average it is much faster. Analysis suggests that NEWHULL should be twice as fast as the "ultimate" algorithm of Kirkpatrick and Seidel, and experimental evidence bears this out. (Update)
Active bibliography (related documents): More All
0.3: The Quickhull Algorithm for Convex Hulls - Barber, Dobkin, Huhdanpaa (1995) (Correct)
0.3: Randomized Quick Hull - Wenger (1995) (Correct)
0.3: Determining the Convex Hull in Large Multidimensional Databases - Böhm, Kriegel (2001) (Correct)
Similar documents based on text: More All
0.2: Primal Dividing and Dual Pruning: Output-Sensitive.. - Chan, Snoeyink, Yap (1997) (Correct)
0.1: Object-Oriented Frameworks - Concepts And Implementations - Mätzel (Correct)
0.1: On a Simple, Practical, Optimal, Output-Sensitive Randomized .. - Bhattacharya, Sen (Correct)
BibTeX entry: (Update)
@misc{ sler-new,
author = "Uwe R\"osler and William Steiger and David Kravitz",
title = "A New Ultimate Convex Hull Algorithm in $\R^2$",
url = "citeseer.ist.psu.edu/279178.html" }
Citations (may not include all citations):481 Algorithms in Combinatorial Geometry (context) - Edelsbrunner - 1987 ACM
64 The Ultimate Planar Convex Hull Algorithm (context) - Kirkpatrick, Seidel - 1986 ACM
20 A new convex hull algorithm for planar sets (context) - Eddy - 1977 ACM DBLP
7 Convex hull of a finite set of points in two dimensions (context) - Bykat - 1978
6 Constructing the convex hull of a set of points in the plane (context) - Green, Silverman - 1979 DBLP
5 the ultimate convex hull algorithm in practice (context) - McQueen, Toussaint - 1985
1 cient Algorithm for Constructing the Convex Hull of a Finite.. (context) - Graham - 1972
1 Cambridge Universityh Press (context) - O'Rourke, in et al. - 1998
1 Further comments on Bykat's convex hull algorithm (context) - Overmars, van Leeuwen - 1980
1 Randomized Quickhull Journal of Algorithms (context) - Wenger - 1997
Documents on the same site (http://www.cs.rutgers.edu/~steiger/pubs.html): More
On the Mixing Rate of the Triangulation Walk - Molloy, Reed, Steiger (1998) (Correct)
Properties of Random Triangulations and Trees - Devroye, Flajolet, Hurtado.. (1999) (Correct)
A Central Limit Theorem for Convex Chains in the Square - Barany, Rote, Steiger, Zhang (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC