MétaCan
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
Sort
Language
Type
Field
Venue
International Journal of Computational Geometry & Applications
Topic
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

87 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
87 works in the cohort · of 4,299,418page 1 of 2

Labels cover 0 of 87 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 87 of 87 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
David Kirkpatrick, Jack Snoeyink, Bettina Speckmann
2002· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
66
citations
afffundunlabeled
PATHWIDTH AND LAYERED DRAWINGS OF TREES
Matthew Suderman
2004· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
50
citations
affunlabeled
ON THE DISCRETE UNIT DISK COVER PROBLEM
Gautam K. Das, Robert Fraser, ALEJANDRO LÓOPEZ-ORTIZ, Bradford G. Nickerson
2012· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
49
citations
affunlabeled
ONLINE ROUTING IN CONVEX SUBDIVISIONS
Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortíz +2 more
2002· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
47
citations
affunlabeled
SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
I. Suzuki, YUICHI TAZOE, Masafumi Yamashita, Tiko Kameda
2001· article· en· International Journal of Computational Geometry & Applications· Engineering
distilled prediction:candidate · noneconsensus · none
31
citations
affunlabeled
GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING
Danny Z. Chen, Michiel Smid, Bin Xu
2005· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
27
citations
affunlabeled
MAXIMIZING A VORONOI REGION: THE CONVEX CASE
Frank Dehne, Rolf Klein, Raimund Seidel
2005· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
affunlabeled
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω
Prosenjit Bose, Vida Dujmović, Ferrán Hurtado, John Iacono, Stefan Langerman, Henk Meijer +3 more
2012· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
affunlabeled
PROPERTIES OF ARRANGEMENT GRAPHS
Prosenjit Bose, Hazel Everett, STEPHEN WISMATH
2003· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
22
citations
affunlabeled
THE LARGEST EMPTY ANNULUS PROBLEM
José Miguel Díaz-Báñez, F. Hurtado, Henk Meijer, David Rappaport, J. Antoni Sellarès
2003· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
21
citations
affunlabeled
π/2-ANGLE YAO GRAPHS ARE SPANNERS
2012· article· en· International Journal of Computational Geometry & Applications· Mathematics
distilled prediction:candidate · noneconsensus · none
20
citations
affunlabeled
SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
Erik D. Demaine, Jeff Erickson, Ferrán Hurtado, John Iacono, Stefan Langerman, Henk Meijer +2 more
2005· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affunlabeled
OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir
2000· article· en· International Journal of Computational Geometry & Applications· Business, Management and Accounting
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
19
citations
affunlabeled
EXACT AND OPTIMAL CONVEX HULLS IN 2D
H. Ratschek, Jon Rokne
2000· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
18
citations
affunlabeled
GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS
Timothy M. Chan, Bashir Sadjad
2006· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
17
citations
affunlabeled
THREE PROBLEMS ABOUT DYNAMIC CONVEX HULLS
Timothy M. Chan
2012· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
14
citations
affunlabeled
SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM
Mustaq Ahmed, Anna Lubiw
2011· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affunlabeled
CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen Wismath
2010· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING
Peter Braß, Ferrán Hurtado, Benjamin Lafreniere, Anna Lubiw
2010· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
COMPUTING SIGNED PERMUTATIONS OF POLYGONS
Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark Overmars +1 more
2011· article· en· International Journal of Computational Geometry & Applications· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
Peter Braß, Laura Heinrich-Litan, Pat Morin
2003· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
BOUNDARY-OPTIMAL TRIANGULATION FLOODING
Richard J. Nowakowski, Norbert Zeh
2006· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
Thérèse Biedl, Martin Vatshelle
2013· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Planar Matchings for Weighted Straight Skeletons
Thérèse Biedl, Stefan Huber, Peter Palfrader
2016· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations

How this was built: Screen · Findings · About