MétaCan
Menu
Back to cohort
Record W2032750179 · doi:10.1117/12.872227

Exploring height fields: interactive visualization and applications

2011· article· en· W2032750179 on OpenAlexaff
Madjid Állili, David Corriveau, Alvaro Villares

Bibliographic record

VenueProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2011
Typearticle
Languageen
FieldComputer Science
TopicTopological and Geometric Data Analysis
Canadian institutionsUniversité de SherbrookeBishop's University
Fundersnot available
KeywordsVisualizationComputer scienceComputer graphicsTriangulationComputational geometryField (mathematics)AlgorithmComputer graphics (images)MathematicsGeometryArtificial intelligence

Abstract

fetched live from OpenAlex

Height fields are an important modeling and visualization tool in many applications and their exploration requires their display at interactive frame rates. This is hard to achieve even with high performance graphics computers due to their inherent geometric complexity. Typical solutions consist of using polygonal approximations of the height field to reduce the number of geometric primitives that need to be rendered. Starting from a rough approximation, a refinement process is operated until a desired level of detail is reached. In this work, we present a novel efficient algorithm that starts with an approximation that carries enough information about the height field so that only few refinement steps are needed to achieve any desired level of detail. Our initial approximation is a simple triangulation whose nodes are the critical points of the height field, that is the peaks, pits, and passes of the surface which give its overall shape. The extraction of critical points of the surface, which is a discrete structure, is done using a newly designed algorithm based on discrete Morse theory and computational homology algorithms. 1-3

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

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.000
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.014
Threshold uncertainty score0.048

Distilled classifier scores by category (both heads)

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

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.036
GPT teacher head0.246
Teacher spread0.209 · 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

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations0
Published2011
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIESame topicTopological and Geometric Data AnalysisFrench-language works237,207