MétaCan
Menu
Back to cohort
Record W2145117087 · doi:10.1109/tvcg.2009.10

Subdivision Analysis of the Trilinear Interpolant

2009· article· en· W2145117087 on OpenAlexfundno aff
Hamish Carr, Nelson Max

Bibliographic record

VenueIEEE Transactions on Visualization and Computer Graphics · 2009
Typearticle
Languageen
FieldComputer Science
TopicComputer Graphics and Visualization Techniques
Canadian institutionsnot available
FundersLawrence Livermore National LaboratoryScience Foundation IrelandUniversity of British ColumbiaUCD FoundationNational Science Foundation
KeywordsCorrectnessComputer scienceSubdivisionVisualizationCompleteness (order theory)Set (abstract data type)Marching cubesScalar (mathematics)AlgorithmTheoretical computer scienceMathematicsTopology (electrical circuits)CombinatoricsGeometryArtificial intelligenceMathematical analysisProgramming language

Abstract

fetched live from OpenAlex

Isosurfaces are fundamental volumetric visualization tools and are generated by approximating contours of trilinearly interpolated scalar fields. While a complete set of cases has recently been published by Nielson, the formal proof that these cases are the only ones possible and that they are topologically correct is difficult to follow. We present a more straightforward proof of the correctness and completeness of these cases based on a variation of the Dividing Cubes algorithm. Since this proof is based on topological arguments and a divide-and-conquer approach, this also sets the stage for developing tessellation cases for higher order interpolants and the quadrilinear interpolant in four dimensions. We also demonstrate that apart from degenerate cases, Nielson's cases are, in fact, subsets of two basic configurations of the trilinear interpolant.

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.

How this classification was reachedexpand

Direct model labels (unvalidated)

Per-model category and study-design labels from the labeling rounds. They are machine output, unvalidated, and the disagreement between models ships as data. No study design here is MEDLINE-validated yet.

Model armCategoriesStudy designConfidence
gemmano category
Domain: not available · Genre: Empirical
About the Canadian research system: no · About a Canadian topic: no
Simulation or modelinglow
gptno category
Domain: not available · Genre: Methods
About the Canadian research system: no · About a Canadian topic: no
Theoretical or conceptuallow
models splitAgreement compares identical category sets and study designs across arms.

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.000

Machine scores (provisional)

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.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.016
GPT teacher head0.289
Teacher spread0.273 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Labeled directly by 2 models reading the full record.

The models applied no category: nothing in the taxonomy fit this work.

The models disagree on parts of this classification; every voice is preserved in the section at the end of the page.

Study designSimulation or modeling · Theoretical or conceptual
Domainnot available
GenreEmpirical · Methods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations12
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Visualization and Computer GraphicsSame topicComputer Graphics and Visualization TechniquesFrench-language works237,207