The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
The quickhull algorithm for convex hulls
Open accessAbstract
The convex hull of a set of points is the smallest convex set that contains the points. This article 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 used less memory. computational geometry algorithms have traditionally assumed that input sets are well behaved. When an algorithm is implemented with floating-point arithmetic, this assumption can lead to serous errors. We briefly describe a solution to this problem when computing the convex hull in two, three, or four dimensions. The output is a set of “thick” facets that contain all possible exact convex hulls of the input. A variation is effective in five or more dimensions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Voronoi diagrams—a survey of a fundamental geometric data structure
Aurenhammer, F. (1991) · ACM Computing Surveys · doi:10.1145/116873.116880 · Cited by 4,340
Computational geometry. an introduction
Preparata, F. P., & Shamos, M. I. (1985) · Cited by 2,488
Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator
Shewchuk, J. R. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014497 · Cited by 2,115
Applications of random sampling in computational geometry, II
Clarkson, K. L., & Shor, P. W. (1989) · Discrete & Computational Geometry · doi:10.1007/bf02187740 · Cited by 665
Automating spectral unmixing of AVIRIS data using convex geometry concepts
Boardman, J. W. (1993) · NASA Technical Reports Server (NASA) · Cited by 484
Randomized incremental construction of Delaunay and Voronoi diagrams
Guibas, L. J., Knuth, D. E., & Sharir, M. (1992) · Algorithmica · doi:10.1007/bf01758770 · Cited by 479
Voronoi diagrams from convex hulls
Brown, K. Q. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90074-7 · Cited by 289
Construction of three-dimensional Delaunay triangulations using local transformations
Joe, B. (1991) · Computer Aided Geometric Design · doi:10.1016/0167-8396(91)90038-d · Cited by 233
Four results on randomized incremental constructions
Clarkson, K. L., Mehlhorn, K., & Seidel, R. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55210-3_205 · Cited by 170
Constructing higher-dimensional convex hulls at logarithmic cost per face
Seidel, R. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12172 · Cited by 159
Closed-form solutions to constrained control allocation problem
Bordingnon, K. A., & Durham, W. C. (1995) · Journal of Guidance Control and Dynamics · doi:10.2514/3.21497 · Cited by 130
Incremental topological flipping works for regular triangulations
Edelsbrunner, H., & Shah, N. R. (1992) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/142675.142688 · Cited by 124
Safe and effective determinant evaluation
Clarkson, K. L. (1992) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267751 · Cited by 105
Cited by
SciPy 1.0: fundamental algorithms for scientific computing in Python
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al. (2020) · Nature Methods · doi:10.1038/s41592-019-0686-2 · Cited by 38,430
SciPy 1.0: fundamental algorithms for scientific computing in Python
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al. (2019) · Apollo - University of Cambridge Repository · doi:10.17863/cam.64134 · Cited by 10,460
NEW MULTIDIMENSIONAL FUNCTIONAL DIVERSITY INDICES FOR A MULTIFACETED FRAMEWORK IN FUNCTIONAL ECOLOGY
Villéger, S., Mason, N. W. H., & Mouillot, D. (2008) · Ecology · doi:10.1890/07-1206.1 · Cited by 3,585
The Open Quantum Materials Database (OQMD): assessing the accuracy of DFT formation energies
Kirklin, S., Saal, J. E., Meredig, B., Thompson, A., Doak, J. W., Aykol, M., Rühl, S., & Wolverton, C. (2015) · npj Computational Materials · doi:10.1038/npjcompumats.2015.10 · Cited by 2,378
OBBTree: a hierarchical structure for rapid interference detection
Gottschalk, S., Lin, M. C., & Manocha, D. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237244 · Cited by 2,081
Metadata
- Authors
- Barber, C. B., Dobkin, D. P., & Huhdanpaa, H.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 1996-12
- Volume
- 22
- Issue
- 4
- Pages
- 469-483
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2153504150
- Cited by
- 5,359
- References
- 14
- FWCI
- 41.63
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.