MétaCan
Menu
Back to cohort
Record W2144674749 · doi:10.1142/s0218195906002038

BOUNDARY-OPTIMAL TRIANGULATION FLOODING

2006· article· en· W2144674749 on OpenAlexafffund
Richard J. Nowakowski, Norbert Zeh

Bibliographic record

VenueInternational Journal of Computational Geometry & Applications · 2006
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Graph Theory Research
Canadian institutionsDalhousie University
FundersNatural Sciences and Engineering Research Council of CanadaMitacs
KeywordsTriangulationMathematicsBoundary (topology)CombinatoricsPoint set triangulationFlooding (psychology)Pitteway triangulationGeometryDiscrete mathematicsDelaunay triangulationMathematical analysis

Abstract

fetched live from OpenAlex

Given a planar triangulation all of whose faces are initially white, we study the problem of colouring the faces black one by one so that the boundary between black and white faces as well as the number of connected black and white regions are small at all times. We call such a colouring sequence of the triangles a flooding. We prove that a flooding with boundary size [Formula: see text] and [Formula: see text] regions can be computed in [Formula: see text] time. We also prove that it is in general impossible to guarantee boundary size [Formula: see text], for any ∊ > 0, and a number of regions that is o( log n), where n is the number of faces of the triangulation.

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.001
metaresearch head score (Gemma)0.010
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.019

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.010
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.003
Open science0.0020.004
Research integrity0.0020.001
Insufficient payload (model declined to judge)0.0060.001

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.014
GPT teacher head0.319
Teacher spread0.305 · 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 designTheoretical or conceptual
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

Citations5
Published2006
Admission routes2
Has abstractyes

Explore more

Same venueInternational Journal of Computational Geometry & ApplicationsSame topicAdvanced Graph Theory ResearchFrench-language works237,207