The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Applications of random sampling in computational geometry, II
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
Preparata, F. P., & Shamos, M. I. (1985) · Springer eBooks · doi:10.1007/978-1-4612-1098-6 · Cited by 3,655
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
Algorithms in Combinatorial Geometry
Edelsbrunner, H. (1987) · Springer eBooks · doi:10.1007/978-3-642-61568-9 · Cited by 1,534
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
Hoare, C. A. R. (1962) · The Computer Journal · doi:10.1093/comjnl/5.1.10 · Cited by 764
ɛ-nets and simplex range queries
Haussler, D., & Welzl, E. (1987) · Discrete & Computational Geometry · doi:10.1007/bf02187876 · Cited by 723
Convex hulls of finite sets of points in two and three dimensions
Preparata, F. P., & Hong, S. J. (1977) · Communications of the ACM · doi:10.1145/359423.359430 · Cited by 710
Linear Programming in Linear Time When the Dimension Is Fixed
Megiddo, N. (1984) · Journal of the ACM · doi:10.1145/2422.322418 · Cited by 669
Probabilistic Methods in Combinatorics
Spencer, J. (1995) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-9078-6_132 · Cited by 588
New applications of random sampling in computational geometry
Clarkson, K. L. (1987) · Discrete & Computational Geometry · doi:10.1007/bf02187879 · Cited by 317
Self-citationFinding the intersection of two convex polyhedra
Muller, D. E., & Preparata, F. P. (1978) · Theoretical Computer Science · doi:10.1016/0304-3975(78)90051-8 · Cited by 291
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
On k -Hulls and Related Problems
Cole, R. J., Sharir, M., & Yap, C. K. (1987) · SIAM Journal on Computing · doi:10.1137/0216005 · Cited by 137
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
Edelsbrunner, H., & Mücke, E. P. (1988) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/73393.73406 · Cited by 119
Partition trees for triangle counting and other range searching problems
Welzl, E. (1988) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/73393.73397 · Cited by 102
A convex hull algorithm optimal for point sets in even dimensions
Seidel, R. (2010) · cIRcle (University of British Columbia) · doi:10.14288/1.0051821 · Cited by 84
A fast las vegas algorithm for triangulating a simple polygon
Clarkson, K. L., Tarjan, R. E., & Wyk, C. J. V. (1989) · Discrete & Computational Geometry · doi:10.1007/bf02187741 · Cited by 69
Self-citationBeweis einer Vermutung von A. Vázsonyi
Heppes, A. (1956) · Acta Mathematica Academiae Scientiarum Hungaricae · doi:10.1007/bf02020540 · Cited by 66
A geometric consistency theorem for a symbolic perturbation scheme
Yap, C. K. (1988) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/73393.73407 · Cited by 54
A deterministic view of random sampling and its use in geometry
Chazelle, B., & Friedman, J. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21970 · Cited by 33
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
Delaunay refinement algorithms for triangular mesh generation
Shewchuk, J. R. (2002) · Computational Geometry · doi:10.1016/s0925-7721(01)00047-5 · Cited by 1,153
Amenta, N., Choi, S., & Kolluri, R. K. (2001) · Proceedings of the sixth ACM symposium on Solid modeling and applications · doi:10.1145/376957.376986 · Cited by 721
Almost optimal set covers in finite VC-dimension
Brönnimann, H., & Goodrich, M. T. (1995) · Discrete & Computational Geometry · doi:10.1007/bf02570718 · Cited by 441
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Metadata
- Authors
- Clarkson, K. L., & Shor, P. W.
- Venue
- Discrete & Computational Geometry
- Published
- 1989-10
- Volume
- 4
- Issue
- 5
- Pages
- 387-421
- ISSN
- 0179-5376 (ISSN-L)
- 1432-0444
- OpenAlex
- W4254977685
- Cited by
- 665
- References
- 20
- FWCI
- 17.74
- 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.
