MétaCan
Menu
Back to cohort
Record W121933743

Area-Proportional Drawings of Intersecting Families of Simple Closed Curves.

2005· article· en· W121933743 on OpenAlexaff
Stirling Chow, Frank Ruskey

Bibliographic record

VenueCanadian Conference on Computational Geometry · 2005
Typearticle
Languageen
FieldComputer Science
TopicComputational Geometry and Mesh Generation
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsJordan curve theoremMathematicsCombinatoricsPlane curveSimple (philosophy)GraphPlane (geometry)Geometry
DOInot available

Abstract

fetched live from OpenAlex

A FISC, or family of intersecting simple closed curves, is a collection of simple closed curves in the plane with the properties that there is some open region common to the interiors of all the curves, and that every two curves intersect in finitely many points or arcs. Let F be a FISC with a set of open regions R. F is said to be area-proportional with respect to weight function ω : R → R if there is a positive constant α such that for any two finite regions, r1 and r2, area(r1)/area(r2) = αω(r1)/ω(r2). We consider F as a directed plane graph, ~ G(F), where the curve intersections are vertices and the curve arcs between vertices are edges. Edges are directed so that each of F ’s curves is traversed in a clockwise fashion. The directed plane dual of ~ G(F), denoted ~ D(F), has edges oriented to indicate inclusion in fewer interiors of the curves. The graph ~ G(F) has an area-proportional drawing with respect to ω if there is some FISC C that is area-proportional to ω and where F can be transformed into C by a continuous transformation of the plane. We describe an O(n|V |) algorithm for creating an area-proportional drawing of ~ G(F) = (V,E) where F is a FISC with n curves and ~ D(F) has only one source and only one sink. For the case of n-Venn diagrams, since |V | ≤ 2 − 2, this yields an O(|V |lg|V |) drawing algorithm.

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

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.003
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.002
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0120.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.029
GPT teacher head0.256
Teacher spread0.228 · 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

Citations0
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueCanadian Conference on Computational GeometrySame topicComputational Geometry and Mesh GenerationFrench-language works237,207