MétaCan
Menu
Back to cohort
Record W1515108012 · doi:10.1142/s0218195900000036

COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS

2000· article· en· W1515108012 on OpenAlexaff
Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec

Bibliographic record

VenueInternational Journal of Computational Geometry & Applications · 2000
Typearticle
Languageen
FieldComputer Science
TopicComputational Geometry and Mesh Generation
Canadian institutionsUniversity of OttawaUniversité du Québec en Outaouais
Fundersnot available
KeywordsAckermann functionCombinatoricsLine segmentOmegaMathematicsLine (geometry)InversePlanarBinary logarithmSet (abstract data type)Function (biology)Discrete mathematicsAlgorithmComputer scienceGeometryPhysics

Abstract

fetched live from OpenAlex

A circle C separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased while still separating the two given sets. An Θ(n log n) optimal algorithm is proposed to find all largest circles separating two given sets of line segments when line segments are allowed to meet only at their endpoints. In the general case, when line segments may intersect Ω(n 2 ) times, our algorithm can be adapted to work in O(nα(n) log n) time and O (nα(n)) space, where α(n) represents the extremely slowly growing inverse of the Ackermann function.

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 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.001
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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.683
Threshold uncertainty score0.939

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.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.012
GPT teacher head0.319
Teacher spread0.306 · 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 teacher head, not a consensus.

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

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

Citations1
Published2000
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Computational Geometry & ApplicationsSame topicComputational Geometry and Mesh GenerationFrench-language works237,207