Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 514

The DOI matches its Crossref record.

MESH GENERATION AND OPTIMAL TRIANGULATION

BERN, MARSHALL, EPPSTEIN, DAVID · 1995 · Lecture Notes Series on Computing

Abstract

We survey the computational geometry relevant to finite element mesh generation. We especially focus on optimal triangulations of geometric domains in two- and three-dimensions. An optimal triangulation is a partition of the domain into triangles or tetrahedra, that is best according to some criterion that measures the size, shape, or number of triangles. We discuss algorithms both for the optimization of triangulations on a fixed set of vertices and for the placement of new vertices (Steiner points). We briefly survey the heuristic algorithms used in some practical mesh generators. 1. Introduction Computational geometry claims the two aims of solving practical problems and producing beautiful mathematics. There is a natural tension between these goals: the most elegant formulation of a problem rarely occurs in practice. But surprisingly often the aims complement each other. This chapter discusses the interplay between an important practical problem---finite element mesh gener...

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1142/9789812831699_0003

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

See all 514

Metadata

Authors
BERN, M., & EPPSTEIN, D.
Venue
Lecture Notes Series on Computing
Published
1995-01
Pages
47-123
ISSN
1793-1223 (ISSN-L)
OpenAlex
W1659568777
Cited by
514
References
0
FWCI
37.26
Type
book chapter
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: MESH GENERATION AND OPTIMAL TRIANGULATION. https://app.cochat.ai/papers/10.1142/9789812831699_0003
The paper
BERN, M., & EPPSTEIN, D. (1995). MESH GENERATION AND OPTIMAL TRIANGULATION. Lecture Notes Series on Computing. https://doi.org/10.1142/9789812831699_0003

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.