The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Incremental topological flipping works for regular triangulations
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
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
Computational Geometry--An Introduction.
Atallah, M. J., Preparata, F. P., & Shamos, M. I. (1986) · Mathematics of Computation · doi:10.2307/2008200 · Cited by 4,238
Preparata, F. P., & Shamos, M. I. (1985) · Springer eBooks · doi:10.1007/978-1-4612-1098-6 · Cited by 3,655
Algorithms in Combinatorial Geometry.
Goodman, J. E., & Edelsbrunner, H. (1989) · The American Mathematical Monthly · doi:10.2307/2325168 · Cited by 1,788
Self-citationOn 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
Self-citationAlgorithms in Combinatorial Geometry
Edelsbrunner, H. (1987) · Springer eBooks · doi:10.1007/978-3-642-61568-9 · Cited by 1,534
Self-citationVoronoi, G. (1908) · Journal für die reine und angewandte Mathematik (Crelles Journal) · doi:10.1515/crll.1908.133.97 · Cited by 945
Power Diagrams: Properties, Algorithms and Applications
Aurenhammer, F. (1987) · SIAM Journal on Computing · doi:10.1137/0216006 · Cited by 832
Software for C1 Surface Interpolation
Lawson, C. L. (1977) · Mathematical Software · doi:10.1016/b978-0-12-587260-7.50011-x · Cited by 730
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
Self-citation
Cited by
E pur si muove:Galilean-invariant cosmological hydrodynamical simulations on a moving mesh
Springel, V. (2010) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2009.15715.x · Cited by 2,424
TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
Si, H. (2015) · ACM Transactions on Mathematical Software · doi:10.1145/2629697 · Cited by 1,573
Liang, J., Woodward, C., & Edelsbrunner, H. (1998) · Protein Science · doi:10.1002/pro.5560070905 · Cited by 1,057
Self-citationRoll: a new algorithm for the detection of protein pockets and cavities with a rolling probe sphere
Yu, J., Zhou, Y., Tanaka, I., & Yao, M. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btp599 · Cited by 397
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
Wang, K., & Sun, W. (2018) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2018.01.036 · Cited by 335
Analytical shape computation of macromolecules: I. molecular area and volume through alpha shape
Liang, J., Edelsbrunner, H., Fu, P., Sudhakar, P. V., & Subramaniam, S. (1998) · Proteins: Structure, Function, and Genetics · doi:10.1002/(sici)1097-0134(19981001)33:1<1::aid-prot1>3.0.co;2-o · Cited by 319
Self-citationLiang, J., & Dill, K. A. (2001) · Biophysical Journal · doi:10.1016/s0006-3495(01)75739-6 · Cited by 273
Survey of Vector Database Management Systems
Pan, J. J., Wang, J., & Li, G. (2023) · arXiv · doi:10.48550/arxiv.2310.14021 · Cited by 184
Metadata
- Authors
- Edelsbrunner, H., & Shah, N. R.
- Venue
- Algorithmica
- Published
- 1996-03
- Volume
- 15
- Issue
- 3
- Pages
- 223-241
- ISSN
- 0178-4617 (ISSN-L)
- 1432-0541
- OpenAlex
- W2009919199
- Cited by
- 303
- References
- 17
- FWCI
- 9.11
- 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.