Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 2,115Computational Geometry and Mesh GenerationComputer Graphics and Visualization TechniquesAdvanced Numerical Analysis Techniques

The DOI matches its Crossref record; 19 of the 20 references it cites were found in a registry or an index.

Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator

Shewchuk, Jonathan Richard·1996·Lecture Notes in Computer Science
DOI 10.1007/bfb0014497
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1007/bfb0014497

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Cited by

See all 2,115

Related

See all

Metadata

Authors
Shewchuk, J. R.
Affiliations
Carnegie Mellon University (US)
Corresponding author
Shewchuk, Jonathan Richard
ORCID
Shewchuk, Jonathan Richard
Venue
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Published
1996
Pages
203-222
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/bfb0014497
OpenAlex
W2129412583
Cited by
2,115
References
20
Citations by year
2026: 29 · 2025: 50 · 2024: 52 · 2023: 53 · 2022: 64 · 2021: 70 · 2020: 80 · 2019: 73 · 2018: 83 · 2017: 98 · 2016: 88 · 2015: 94 · 2014: 86 · 2013: 96 · 2012: 116
FWCI
17.33
Type
conference paper
Language
en
Open access
closed
Locations
Lecture notes in computer science (publishedVersion)
Funders
  • National Science Foundation
  • Natural Sciences and Engineering Research Council of Canada
Topics
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
  • Physical Sciences › Engineering › Computational Mechanics › Advanced Numerical Analysis Techniques
Keywords
constrained Delaunay triangulation, Delaunay refinement, planar straight-line graphs, mesh quality, triangulation algorithms, data structures, robustness

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.