Guaranteed‐quality triangular mesh generation for domains with curved boundaries
Why is this work in the frame?
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Full frame distilled prediction
Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
- Candidate categories
- none
- Consensus categories
- none
- Domain
- Candidate signal: noneConsensus signal: none
- Study design
- Candidate signal: Simulation or modelingConsensus signal: Simulation or modeling
- Genre
- Candidate signal: MethodsConsensus signal: Methods
- Teacher disagreement score
- 0.427
- Threshold uncertainty score
- 0.568
- Validation status
machine_predicted_unvalidated·codex-gemma-dda1882f352a
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
- Teacher spread
- 0.322 · how far apart the two teachers sit on this one work
- Validation status
score_only:v0-immature-baseline· verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it
Abstract
Abstract Guaranteed‐quality unstructured meshing algorithms facilitate the development of automatic meshing tools. However, these algorithms require domains discretized using a set of linear segments, leading to numerical errors in domains with curved boundaries. We introduce an extension of Ruppert's Delaunay refinement algorithm to two‐dimensional domains with curved boundaries and prove that the same quality bounds apply with curved boundaries as with straight boundaries. We provide implementation details for two‐dimensional boundary patches such as lines, circular arcs, cubic parametric curves, and interpolated splines. We present guaranteed‐quality triangular meshes generated with curved boundaries, and propose solutions to some problems associated with the use of curved boundaries. Copyright © 2002 John Wiley & Sons, Ltd.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
The record
- Venue
- International Journal for Numerical Methods in Engineering
- Topic
- Computational Geometry and Mesh Generation
- Field
- Computer Science
- Canadian institutions
- University of British Columbia
- Funders
- not available
- Keywords
- Boundary (topology)Polygon meshDiscretizationMesh generationChew's second algorithmRuppert's algorithmDelaunay triangulationParametric statisticsMathematicsAlgorithmComputer scienceSet (abstract data type)GeometryFinite element methodMathematical analysisConstrained Delaunay triangulationEngineeringStructural engineering
- Has abstract in OpenAlex
- yes