ArticleIEEE transactions on visualization and computer graphics2014
Lattice cleaving: a multimaterial tetrahedral meshing algorithm with guarantees.
Article in IEEE transactions on visualization and computer graphics, 2014. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
6 citing papers in PubMed.
- Near real-time adaptive isotropic and anisotropic image-to-mesh conversion for cerebral aneurysm simulations.Engineering with computers · 2026Article
- Image-to-mesh conversion method for multi-tissue medical image computing simulations.Engineering with computers · 2024Article
- Marching Windows: Scalable Mesh Generation for Volumetric Data With Multiple Materials.IEEE transactions on visualization and computer graphics · 2024Article
- A Structured Cleaving Mesh for Bioheat Transfer Application.IEEE open journal of engineering in medicine and biology · 2020Article
- Lattice cleaving: a multimaterial tetrahedral meshing algorithm with guarantees.IEEE transactions on visualization and computer graphics · 2014Article
- Quality Partitioned Meshing of Multi-Material Objects.Procedia engineeringArticle
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
Abstract
We introduce a new algorithm for generating tetrahedral meshes that conform to physical boundaries in volumetric domains consisting of multiple materials. The proposed method allows for an arbitrary number of materials, produces high-quality tetrahedral meshes with upper and lower bounds on dihedral angles, and guarantees geometric fidelity. Moreover, the method is combinatoric so its implementation enables rapid mesh construction. These meshes are structured in a way that also allows grading, to reduce element counts in regions of homogeneity. Additionally, we provide proofs showing that both element quality and geometric fidelity are bounded using this approach.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.