The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
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
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
Spatial Tessellations: Concepts and Applications of Voronoi Diagrams
Okabe, A., Boots, B. N., & Sugihara, K. (1992) · Cited by 3,546
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
Handbook of Discrete and Computational Geometry, Second Edition
(2004) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420035315 · Cited by 1,208
The LEDA platform for combinatorial and geometric computing
Mehlhorn, K., Näher, S., & Uhrig, C. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63165-8_161 · Cited by 1,199
A sweepline algorithm for Voronoi diagrams
Fortune, S. (1987) · Algorithmica · doi:10.1007/bf01840357 · Cited by 1,134
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
Surface Reconstruction by Voronoi Filtering
Amenta, N., & Bern, M. (1999) · Discrete & Computational Geometry · doi:10.1007/pl00009475 · Cited by 705
Medial Axis Transformation of a Planar Shape
Lee, D. T. (1982) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1982.4767267 · Cited by 487
Generalization of Voronoi Diagrams in the Plane
Lee, D. T., & Drysdale, III (1981) · SIAM Journal on Computing · doi:10.1137/0210006 · Cited by 312
Cited by
3D Skeletons: A State‐of‐the‐Art Report
Tagliasacchi, A., Delame, T., Spagnuolo, M., Amenta, N., & Telea, A. (2016) · Computer Graphics Forum · doi:10.1111/cgf.12865 · Cited by 264
Sun, X., Han, X., Ping, F., Zhang, L., Zhang, K., Chen, M., & Wu, W. (2018) · Science of The Total Environment · doi:10.1016/j.scitotenv.2018.02.046 · Cited by 84
Metadata
- Authors
- Held, M.
- Venue
- Computational Geometry
- Publisher
- Elsevier BV
- Published
- 2001-03
- Volume
- 18
- Issue
- 2
- Pages
- 95-123
- ISSN
- 0925-7721 (ISSN-L)
- OpenAlex
- W2018168260
- Cited by
- 323
- References
- 22
- FWCI
- 9.28
- 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: VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments. https://app.cochat.ai/papers/10.1016/s0925-7721(01)00003-7
- The paper
- Held, M. (2001). VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments. Computational Geometry. https://doi.org/10.1016/s0925-7721(01)00003-7
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.