Reference health

Applications of random sampling in computational geometry, II

https://doi.org/10.1007/bf02187740
CiteStamped reference-health badge
36/36 checkable references clean · checked 2026-09-03

Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.

8 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.

The 36 checked references that resolve
resolves10.1145/73833.73835
A deterministic algorithm for partitioning arrangements of lines and its application
resolves10.1016/0097-3165(86)90122-6
The number of small semispaces of a finite set of points in the plane
resolves10.1145/41958.41994
Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension
resolves10.1109/SFCS.1988.21975
An optimal algorithm for intersecting line segments in the plane
resolves10.1007/BF01934990
The power of geometric duality
resolves10.1007/BF02187685
Halfspace range search: An algorithmic application ofk-sets
resolves10.1145/22145.22165
A probabilistic algorithm for the post office problem
resolves10.1007/BF02187879
New applications of random sampling in computational geometry
resolves10.1109/SFCS.1988.21970
A deterministic view of random sampling and its use in geometry
resolves10.1109/SFCS.1988.21961
A Las Vegas algorithm for linear programming when the dimension is small
resolves10.1145/73393.73394
Applications of random sampling in computational geometry, II
resolves10.1109/SFCS.1988.21973
Combinatorial complexity bounds for arrangements of curves and surfaces
resolves10.1145/73393.73395
Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental
resolves10.1007/BF02187741
A fast las vegas algorithm for triangulating a simple polygon
resolves10.1137/0216005
On <i>k</i> -Hulls and Related Problems
resolves10.1007/978-3-642-61568-9
Algorithms in Combinatorial Geometry
resolves10.1109/TIT.1983.1056714
On the shape of a set of points in the plane
resolves10.1145/73393.73406
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
resolves10.1137/0215024
Constructing Arrangements of Lines and Hyperplanes with Applications
resolves10.1016/0097-3165(84)90081-5
On the number of k-subsets of a set of n points in the plane
resolves10.1145/282918.282923
Primitives for the manipulation of general subdivisions and the computation of Voronoi
resolves10.1007/BF02187876
ɛ-nets and simplex range queries
resolves10.1007/BF02020540
Beweis einer Vermutung von A. Vázsonyi
resolves10.1093/comjnl/5.1.10
Quicksort
resolves10.1137/0215021
The Ultimate Planar Convex Hull Algorithm?
resolves10.1145/73833.73834
Construction of epsilon nets
resolves10.1145/2422.322418
Linear Programming in Linear Time When the Dimension Is Fixed
resolves10.1016/0304-3975(78)90051-8
Finding the intersection of two convex polyhedra
resolves10.1109/SFCS.1988.21974
A fast planar partition algorithm. I
resolves10.1145/359423.359430
Convex hulls of finite sets of points in two and three dimensions
resolves10.1007/978-1-4612-1098-6
Computational Geometry
resolves10.1145/73007.73045
Polling: a new randomized sampling technique for computational geometry
resolves10.1145/12130.12172
Constructing higher-dimensional convex hulls at logarithmic cost per face
resolves10.1007/BF02187686
More onk-sets of finite sets in the plane
resolves10.1145/73393.73397
Partition trees for triangle counting and other range searching problems
resolves10.1145/73393.73407
A geometric consistency theorem for a symbolic perturbation scheme
The 8 references without a DOI — listed, not checked
no DOI — not checkedA. Aggarwal. Personal communication.
no DOI — not checkedB. Chazelle and E. Welzl. Range searching and VC-dimension: a characterization of efficiency. Technical Report B-88-09, Freie Universität Berlin, Institut für Mathematik III, Arnimallee 2-6, 1000 Berlin 33, 1989.
no DOI — not checkedL. P. Chew. Building Voronoi diagrams for convex polygons in linear expected time. Unpublished manuscript, 1986.
no DOI — not checkedH. Edelsbrunner. Personal communication.
no DOI — not checkedP. Erdös and J. Spencer.Probabilistic Methods in Combinatorics. Academic Press, New York, 1974.
no DOI — not checkedD. H. Greene and D. E. Knuth.Mathematics for the Analysis of Algorithms. Birkhäuser, Boston, 1981.
no DOI — not checkedJ. Reif and S. Sen. Optimal parallel algorithms for computational geometry. InProceedings of the 16th International Conference on Parallel Processing, 1987.
no DOI — not checkedR. Seidel. A convex hull algorithm optimal for point sets in even dimensions. Technical Report 81/14, Dept. Computer Science, University of British Columbia, 1981.
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. It says nothing about the quality, findings, or importance of the work itself, and nothing about references deposited without a DOI.

checked 2026-09-03 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

view as graph · paper page

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.

<a href="https://citestamp.com/citestamped/10.1007/bf02187740"><img src="https://citestamp.com/citestamped/10.1007/bf02187740/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.1007/bf02187740/badge.svg)](https://citestamp.com/citestamped/10.1007/bf02187740)