MétaCan
Menu
Back to cohort
Record W75743518

ACM: atlas of connectivity maps for semiregular models

2013· article· en· W75743518 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueGraphics Interface · 2013
Typearticle
Languageen
FieldEngineering
TopicAdvanced Numerical Analysis Techniques
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsAtlas (anatomy)Computer scienceSubdivisionData structureComputer graphicsTransformation (genetics)Theoretical computer scienceGraphicsAlgorithmData miningComputer graphics (images)Geography
DOInot available

Abstract

fetched live from OpenAlex

Semiregular models are an important subset of models in computer graphics. They are typically obtained by applying repetitive regular refinements on an initial arbitrary model. As a result, their connectivity strongly resembles regularity due to these refinement operations. Although data structures exist for regular or irregular models, a data structure designed to take advantage of this semiregularity is desirable. In this paper, we introduce such a data structure called atlas of connectivity maps for semiregular models resulting from arbitrary refinements. This atlas maps the connectivity information of vertices and faces on separate 2D domains called connectivity maps. The connectivity information between adjacent connectivity maps is determined by a linear transformation between their 2D domains. We also demonstrate the effectiveness of our data structure on subdivision and multiresolution applications.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.806
Threshold uncertainty score0.558

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.020
GPT teacher head0.260
Teacher spread0.240 · 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