CoChat

Fast tetrahedral meshing in the wild

Open access
Hu, Yixin, Schneider, Teseo, Wang, Bolun, Zorin, Denis, Panozzo, Daniele · 2020 · ACM Transactions on Graphics
Cited by 181

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

Abstract

We propose a new tetrahedral meshing method, fTetWild, to convert triangle soups into high-quality tetrahedral meshes. Our method builds on the TetWild algorithm, replacing the rational triangle insertion with a new incremental approach to construct and optimize the output mesh, interleaving triangle insertion and mesh optimization. Our approach makes it possible to maintain a valid floating-point tetrahedral mesh at all algorithmic stages, eliminating the need for costly constructions with rational numbers used by TetWild, while maintaining full robustness and similar output quality. This allows us to improve on TetWild in two ways. First, our algorithm is significantly faster, with running time comparable to less robust Delaunay-based tetrahedralization algorithms. Second, our algorithm is guaranteed to produce a valid tetrahedral mesh with floating-point vertex coordinates, while TetWild produces a valid mesh with rational coordinates which is not guaranteed to be valid after floating-point conversion. As a trade-off, our algorithm no longer guarantees that all input triangles are present in the output mesh, but in practice, as confirmed by our tests on the Thingi10k dataset, the algorithm always succeeds in inserting all input triangles.

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.1145/3386569.3392385

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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

Cites

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

    Shewchuk, J. R. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014497 · Cited by 2,115 · cited 1×

    “…et al. 2002; Dey and Levine 2008; Du and Wang 2003; George et al. 2003; Jamin et al. 2015; Murphy et al. 2001; Remacle 2017; Ruppert 1995; Sheehy 2012; Shewchuk 1996, 1998, 1999, 2002a; Si 2015; Si and Gartner 2005; Si and Shewchuk 2014; Tournois et al. 2009; Weatherill and Hassan 1994].”

Cited by

  • Learning skeletal articulations with neural blend shapes

    Li, P., Aberman, K., Hanocka, R., Liu, L., Sorkine-Hornung, O., & Chen, B. (2021) · ACM Transactions on Graphics · doi:10.1145/3476576.3476702 · Cited by 4

    “In general, there should be a meaningful shape surface to propagate the deep mesh features; so in the case of an extreme polygon soup some form of remeshing [research 2020] or tetrahedralization [Hu et al. 2020] can be employed.”
    Background

See all 181

Metadata

Authors
Hu, Y., Schneider, T., Wang, B., Zorin, D., & Panozzo, D.
Venue
ACM Transactions on Graphics
Published
2020-08-12
Volume
39
Issue
4
ISSN
  • 0730-0301 (ISSN-L)
  • 1557-7368
OpenAlex
W2968267719
Cited by
181
References
1
FWCI
37.85
Type
journal article
Language
en
Open access
green

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.