The DOI matches its Crossref record.
Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes
Abstract
The Delaunay tessellation in n-dimensional space is a space-filling aggregate of n-simplices. These n-simplices are the dual forms of the vertices in the commonly used Voronoi tessellation. Several efforts have been made to simulate the 2-dimensional Voronoi tessellation on the computer. Additional problems occur for the 3 and higher dimensional implementations but some of these can be avoided by alternatively computing the dual Delaunay tessellation. An algorithm that finds the topological relationships in these tessellations is given.
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
Cited by
Robust structural identification via polyhedral template matching
Larsen, P. M., Schmidt, S., & Schiøtz, J. (2016) · Modelling and Simulation in Materials Science and Engineering · doi:10.1088/0965-0393/24/5/055007 · Cited by 1,121
Three-dimensional modeling for functional analysis of cardiac images, a review
Frangi, A. F., Niessen, W. J., & Viergever, M. A. (2001) · IEEE Transactions on Medical Imaging · doi:10.1109/42.906421 · Cited by 533
Tetrahedral mesh generation by Delaunay refinement
Shewchuk, J. R. (1998) · Proceedings of the fourteenth annual symposium on Computational geometry - SCG '98 · doi:10.1145/276884.276894 · Cited by 373
Dong, H., Wen, B., & Melnik, R. (2014) · Scientific Reports · doi:10.1038/srep07037 · Cited by 228
Metadata
- Authors
- Watson, D. F.
- Venue
- The Computer Journal
- Publisher
- Oxford University Press (OUP)
- Published
- 1981-02-01
- Volume
- 24
- Issue
- 2
- Pages
- 167-172
- ISSN
- 0010-4620 (ISSN-L)
- 1460-2067
- OpenAlex
- W2128672663
- Cited by
- 1,487
- References
- 0
- FWCI
- 9.46
- Type
- journal article
- Language
- en
- Open access
- closed
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.
