C. Bradford Barber, David P. Dobkin, Hannu Huhdanpaa  Home/Search
Context Related
Links: ACM DBLP | princeton.edu/reports/1995/565.ps.Z 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 Problem Downloading? From: indiana.edu/pub/ucstri/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The convex hull of a set of points is the smallest convex set that contains the points. This paper presents a practical convex hull algorithm that combines the two-dimensional Quickhull Algorithm with the general dimension Beneath-Beyond Algorithm. It is similar to the randomized, incremental algorithms for convex hull and Delaunay triangulation. We provide empirical evidence that the algorithm runs faster when the input contains nonextreme points, and that it uses less memory. Computational... (Update)
Cited by: More
Bottlenecks Identification in Multiclass Queueing Networks.. - Casale, Serazzi (2004) (Correct)
Scalable And Architecture Independent Parallel Geometric.. - With High Probability (Correct)
Blister: GPU-based rendering of Boolean - Combinations Of Free-Form (Correct)
Similar documents (at the sentence level):
79.6%: The Quickhull Algorithm for Convex Hulls - Barber, Dobkin, Huhdanpaa (1996) (Correct)
Active bibliography (related documents): More All
0.3: Randomized Quick Hull - Wenger (1995) (Correct)
0.3: A New Ultimate Convex Hull Algorithm in R² - Rösler, Steiger, Kravitz (2000) (Correct)
0.3: On The Expected Complexity Of The 3-Dimensional Voronoi Diagram - Bernal (1990) (Correct)
Similar documents based on text: More All
0.1: The QuickHull algorithm in - Fork Typical Applications (Correct)
0.1: Positive Bradford Curves through Sharpening - Finlayson, Drew (1999) (Correct)
0.1: On a Simple, Practical, Optimal, Output-Sensitive Randomized .. - Bhattacharya, Sen (Correct)
Related documents from co-citation: More All
8: the complexity of some basic problems in computational geometry (context) - Gritzmann, Klee - 1994
8: Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
8: Applications of random sampling in computational geometry - Clarkson, Shor - 1989
BibTeX entry: (Update)
C. Barber, D. Dobkin, H. Huhdanpaa, "The Quickhull Algorithm for Convex Hull", Geometry Center Technical Report GCG53, Univ. of Minnesota, MN, 1993. http://citeseer.ist.psu.edu/article/barber95quickhull.html More
@article{ barber96quickhull,
author = "C. Bradford Barber and David P. Dobkin and Hannu Huhdanpaa",
title = "The Quickhull Algorithm for Convex Hulls",
journal = "ACM Transactions on Mathematical Software",
volume = "22",
number = "4",
pages = "469--483",
year = "1996",
url = "citeseer.ist.psu.edu/article/barber95quickhull.html" }
Citations (may not include all citations):508 Computational Geometry (context) - Preparata, Shamos - 1985 ACM DBLP
335 Applications of random sampling in computational geometry - Clarkson, Shor - 1989
257 Voronoi diagrams -- a survey of a fundamental geometric data.. (context) - Aurenhammer - 1991
101 Randomized incremental construction of Delaunay and Voronoi .. (context) - Guibas, Knuth et al. - 1992 ACM DBLP
91 The Quickhull algorithm for convex hull - Barber, Dobkin et al. - 1993
64 The ultimate planar convex hull algorithm (context) - Kirkpatrick, Seidel - 1986 ACM
58 Incremental topological flipping works for regular triangula.. (context) - Edelsbrunner, Shah - 1992 ACM DBLP
56 Constructing higher-dimensional convex hulls at logarithmic .. (context) - Seidel - 1986 ACM DBLP
51 Four results on randomized incremental constructions - Clarkson, Mehlhorn et al. - 1992 ACM DBLP
48 The double description method (context) - Motzkin, Raiffa et al. - 1953
47 Voronoi diagrams from convex hulls (context) - Brown - 1979 DBLP
41 the randomized construction of the Delaunay tree - Boissonnat, Devillers-Teillaud - 1990
38 Construction of three-dimensional Delaunay triangulations us.. (context) - Joe - 1991 ACM DBLP
36 Stable maintenance of point-set triangulation in two dimensi.. (context) - Fortune - 1989
35 How good are convex hull algorithms - Avis, Bremner - 1995
33 An Introduction Through Randomized Algorithms (context) - Mulmuley - 1994
32 Safe and effective determinant evaluation - Clarkson - 1992 DBLP
32 An algorithm for convex polytopes (context) - Chand, Kapur - 1970 ACM DBLP
27 Constructing strongly convex hulls using exact or rounded ar.. - Li, Milenkovic - 1990 ACM DBLP
24 Derandomizing an output-sensitive convex hull algorithm in t.. (context) - Chazelle, Matousek - 1991 ACM DBLP
20 A new convex hull algorithm for planar sets (context) - Eddy - 1977 ACM DBLP
10 Delaunay triangulations in three dimensions with finite prec.. (context) - Dey, Sugihara et al. - 1992 ACM DBLP
8 Learning in navigation: Goal finding in graphs (context) - Cucka, Netanyahu et al. - 1995
8 Automating spectral unmixing of AVIRIS data using convex geo.. (context) - Boardman - 1993
7 Triangle: A two-dimensional quality mesh generator and Delau.. (context) - Shewchuk - 1995
7 Constructing strongly convex approximate hulls with inaccura.. (context) - Guibas, Salesin et al. - 1993 ACM DBLP
7 Convex hull of a finite set of points in two dimensions (context) - Bykat - 1978 DBLP
6 Constructing the convex hull of a set of points in the plane (context) - Green, Silverman - 1979 DBLP
5 cdd Reference Manual (context) - Fukuda - 1995
5 Personal communication (context) - Teller - 1994
4 Invariant sets for general second-order low-pass delta-sigma.. (context) - Zhang, Goodson et al. - 1994
4 Computational geometry - Fortune - 1993 ACM DBLP
3 Measures of symmetry for convex sets (context) - Grunbaum - 1961
3 Closed-form solutions to constrained control allocation prob.. (context) - Bordignon, Durham - 1995
3 Convex polytopes and linear programming (context) - Klee - 1966
3 Personal communication (context) - Milenkovic - 1994
2 A program for convex hulls (context) - Clarkson - 1995
2 Personal communications regarding qhull (context) - Belsis, Grundmann et al. - 1995
2 Personal communication (context) - Dorward - 1992
2 Topologically consistent algorithms related to convex polyhe.. (context) - Sugihara - 1992
2 Personal communication to Preparata & Shamos on Quickhull (context) - Floyd - 1976
2 Irregular grain structure in micromagnetic simulation - Porter, Glavinas et al. - 1996
1 Convex hulls and isometries of cusped hyperbolic 3-manifolds (context) - Weeks - 1991
1 evaluation of support structures in layered manufacturing (context) - Allen, Dutta - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://ftp.cs.indiana.edu/pub/ucstri/index): More
Selection of Test Points during High-Level Synthesis - Nagel (Correct)
Game Tree Search on a Massively Parallel System - Feldmann, Mysliwietz, Monien (1993) (Correct)
Computing the Discrepancy with Applications to.. - Dobkin, Eppstein.. (1996) (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