The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
New applications of random sampling in computational geometry
Open accessOverview
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 Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
Computational Geometry--An Introduction.
Atallah, M. J., Preparata, F. P., & Shamos, M. I. (1986) · Mathematics of Computation · doi:10.2307/2008200 · Cited by 4,238
The Art of Computer Programming: Volume 3: Sorting and Searching
Knuth, D. E. (1973) · Cited by 3,955
Preparata, F. P., & Shamos, M. I. (1985) · Springer eBooks · doi:10.1007/978-1-4612-1098-6 · Cited by 3,655
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (2015) · Measures of Complexity · doi:10.1007/978-3-319-21852-6_3 · Cited by 3,105
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
Algorithms in Combinatorial Geometry.
Goodman, J. E., & Edelsbrunner, H. (1989) · The American Mathematical Monthly · doi:10.2307/2325168 · Cited by 1,788
On the shape of a set of points in the plane
Edelsbrunner, H., Kirkpatrick, D., & Seidel, R. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056714 · Cited by 1,634
Primitives for the manipulation of general subdivisions and the computation of Voronoi
Guibas, L., & Stolfi, J. (1985) · ACM Transactions on Graphics · doi:10.1145/282918.282923 · Cited by 1,260
The Art of Computer Programming, Vol. 2
Knuth, D. E. (1981) · Medical Entomology and Zoology · Cited by 886
Cited by
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
(1993) · doi:10.5555/313559.313789 · Cited by 998
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
Self-citationCoresets, sparse greedy approximation, and the Frank-Wolfe algorithm
Clarkson, K. L. (2010) · ACM Transactions on Algorithms · doi:10.1145/1824777.1824783 · Cited by 379
Self-citationImpact of Vehicles as Obstacles in Vehicular Ad Hoc Networks
Boban, M., Vinhoza, T. T. V., Ferreira, M., Barros, J., & Tonguz, O. K. (2011) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2011.110103 · Cited by 351
A subexponential bound for linear programming
Matoušek, J., Sharir, M., & Welzl, E. (1996) · Algorithmica · doi:10.1007/bf01940877 · Cited by 300
Cutting hyperplanes for divide-and-conquer
Chazelle, B. (1993) · Discrete & Computational Geometry · doi:10.1007/bf02189314 · Cited by 270
Metadata
- Authors
- Clarkson, K. L.
- Venue
- Discrete & Computational Geometry
- Published
- 1987-06
- Volume
- 2
- Issue
- 2
- Pages
- 195-222
- ISSN
- 0179-5376 (ISSN-L)
- 1432-0444
- OpenAlex
- W2067631433
- Cited by
- 317
- References
- 26
- FWCI
- 19.92
- 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.
