MétaCan
Menu
Back to cohort
Record W2296144646 · doi:10.1109/cgi.2004.19

BlobTree trees

2004· article· en· W2296144646 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

VenueComputer Graphics International · 2004
Typearticle
Languageen
FieldAgricultural and Biological Sciences
TopicHorticultural and Viticultural Research
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsBranching (polymer chemistry)Tree (set theory)Tree structureComputer scienceImage warpingTopology (electrical circuits)AlgorithmGeometryMathematicsBinary treeArtificial intelligenceMathematical analysisCombinatorics

Abstract

fetched live from OpenAlex

In recent years several methods for modeling botanical trees have been proposed. The geometry and topology of tree skeletons can be well described by L-systems; however, there are several approaches to modeling smooth surfaces to represent branches, and not all of the observed phenomena can be represented by current methods. Many tree types exhibit nonsmooth features such as branch bark ridges and collars. In this research a hierarchical implicit modeling system is used to produce models of branching structures that capture smooth branching, branch collars and branch bark ridges. The BlobTree provides several techniques to control the combination of primitives, allowing both smooth and nonsmooth effects to be intuitively combined in a single blend volume. Irregular effects are implemented using precise contact modeling, constructive solid geometry and space warping. We show that smooth blends can be obtained, without noticeable bulging, using summation of distance based implicit surfaces. L-systems are used to create the branching structure allowing botanically based simulations to be used as input

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: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.815
Threshold uncertainty score0.358

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.037
GPT teacher head0.274
Teacher spread0.237 · 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