The DOI matches its Crossref record.
Three-Dimensional Triangulations from Local Transformations
Abstract
A new algorithm is presented that uses a local transformation procedure to construct a triangulation of a set of n three-dimensional points that is pseudo-locally optimal with respect to the sphere criterion. It is conjectured that this algorithm always constructs a Delaunay triangulation, and this conjecture is supported with experimental results. The empirical time complexity of this algorithm is $O(n^{{4 / 3}} )$ for sets of random points, which compares well with existing algorithms for constructing a three-dimensional Delaunay triangulation. Also presented is a modification of this algorithm for the case that local optimality is based on the max-min solid angle criterion.
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
Three-dimensional alpha shapes
Edelsbrunner, H., & Mücke, E. P. (1994) · ACM Transactions on Graphics · doi:10.1145/174462.156635 · Cited by 2,488
Gasoline: a flexible, parallel implementation of TreeSPH
Wadsley, J. W., Stadel, J., & Quinn, T. (2004) · New Astronomy · doi:10.1016/j.newast.2003.08.004 · Cited by 694
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
Aurenhammer, F., & Klein, R. (2000) · Handbook of Computational Geometry · doi:10.1016/b978-044482537-7/50006-1 · Cited by 392
Incremental topological flipping works for regular triangulations
Edelsbrunner, H., & Shah, N. R. (1996) · Algorithmica · doi:10.1007/bf01975867 · Cited by 303
Mavriplis, D. J. (1997) · Annual Review of Fluid Mechanics · doi:10.1146/annurev.fluid.29.1.473 · Cited by 292
Metadata
- Authors
- Joe, B.
- Venue
- SIAM Journal on Scientific and Statistical Computing
- Published
- 1989-07
- Volume
- 10
- Issue
- 4
- Pages
- 718-741
- ISSN
- 0196-5204 (ISSN-L)
- 2168-3417
- OpenAlex
- W2054090557
- Cited by
- 181
- References
- 0
- FWCI
- 6.05
- 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.