The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Convex hulls of finite sets of points in two and three dimensions
Open accessAbstract
The convex hulls of sets of n points in two and three dimensions can be determined with O(n log n) operations. The presented algorithms use the “divide and conquer” technique and recursively apply a merge procedure for two nonintersecting convex hulls. Since any convex hull algorithm requires at least O(n log n) operations, the time complexity of the proposed algorithms is optimal within a multiplicative constant.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
An efficient algorith for determining the convex hull of a finite planar set
Graham, R. L. (1972) · Information Processing Letters · doi:10.1016/0020-0190(72)90045-2 · Cited by 1,653
Gilbert, E. N., & Pollak, H. O. (1968) · SIAM Journal on Applied Mathematics · doi:10.1137/0116001 · Cited by 690
On the identification of the convex hull of a finite set of points in the plane
Jarvis, R. A. (1973) · Information Processing Letters · doi:10.1016/0020-0190(73)90020-3 · Cited by 652
Cited by
Spatial Planning: A Configuration Space Approach
Lozano-Perez (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676196 · Cited by 2,113
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
Edelsbrunner, H., & Mücke, E. P. (1990) · ACM Transactions on Graphics · doi:10.1145/77635.77639 · Cited by 711
Slime mould computes planar shapes
Adamatzky, A. (2012) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2012.047239 · Cited by 31
Metadata
- Authors
- Preparata, F. P., & Hong, S. J.
- Venue
- Communications of the ACM
- Published
- 1977-02
- Volume
- 20
- Issue
- 2
- Pages
- 87-93
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2041775009
- Cited by
- 710
- References
- 4
- FWCI
- 17.78
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Convex hulls of finite sets of points in two and three dimensions. https://app.cochat.ai/papers/10.1145/359423.359430
- The paper
- Preparata, F. P., & Hong, S. J. (1977). Convex hulls of finite sets of points in two and three dimensions. Communications of the ACM. https://doi.org/10.1145/359423.359430
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.
