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
Topic
Computational Geometry and Mesh Generation
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.

1,616 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.
1,616 works in the cohort · of 4,299,418page 2 of 33

Labels cover 0 of 1,616 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 1,616 of 1,616 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

afffundno abstractunlabeled
Computing Cartograms with Optimal Complexity
Md. Jawaherul Alam, Thérèse Biedl, Stefan Felsner, Michael Kaufmann, Stephen Kobourov, Torsten Ueckerdt
2013· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
56
citations
afffundno abstractunlabeled
Recognizing and drawing IC-planar graphs
Franz J. Brandenburg, Walter Didimo, William Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani
2016· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
55
citations
fundno affno abstractunlabeled
Multi-Pass Geometric Algorithms
Timothy M. Chan, Eric Chen
2006· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
55
citations
afffundno abstractunlabeled
Curve-constrained drawings of planar graphs
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen Wismath
2004· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
54
citations
affno abstractunlabeled
On Dominance Reporting in 3D
Peyman Afshani
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
54
citations
fundno affunlabeled
Track Layouts of Graphs
Vida Dujmović, Attila Pór, David R. Wood
2004· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
52
citations
affno abstractunlabeled
Space-efficient planar convex hull algorithms
Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried Toussaint
2004· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
52
citations
affno abstractunlabeled
Compatible geometric matchings
Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo Garcı́a, Clemens Huemer, Ferrán Hurtado +7 more
2009· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
affno abstractunlabeled
Separating an object from its cast
Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jiřı́ Matoušek +1 more
2002· article· en· Computer-Aided Design· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
affunlabeled
Delaunay mesh construction
Ramsay Dyer, Hao Zhang, Torsten Möller
2007· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
afffundunlabeled
PATHWIDTH AND LAYERED DRAWINGS OF TREES
Matthew Suderman
2004· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · noneconsensus · none
50
citations
affunlabeled
<i>LoopyCuts</i>
Marco Livesu, Nico Pietroni, Enrico Puppo, Alla Sheffer, Paolo Cignoni
2020· article· en· ACM Transactions on Graphics· Computer Science
machine prediction:candidate · noneconsensus · none
50
citations
affno abstractunlabeled
Folding and Cutting Paper
Erik D. Demaine, Martin L. Demaine, Anna Lubiw
2000· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
49
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
machine prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
Expected time analysis for Delaunay point location
Luc Devroye, Christophe Lemaire, Jean-Michel Moreau
2004· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations
affunlabeled
Symmetric moving frames
Étienne Corman, Keenan Crane
2019· article· en· ACM Transactions on Graphics· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations
affunlabeled
Weighted straight skeletons in the plane
Thérèse Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader
2014· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
Immobilizing a polytope
Jurek Czyzowicz, Ivan Stojmenović, Jorge Urrutia
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
Matroid Enumeration for Incidence Geometry
Yoshitake Matsumoto, Sonoko Moriyama, Hiroshi Imai, David Avis
2011· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
Extremal problems for convex polygons
Charles Audet, Pierre Hansen, Frédéric Messine
2006· article· en· Journal of Global Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
On simplifying dot maps
Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin
2003· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
A Fixed-Parameter Approach to 2-Layer Planarization
Vida Dujmović, Michael R. Fellows, Michael Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin +6 more
2006· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affunlabeled
Instance-Optimal Geometric Algorithms
Peyman Afshani, Jérémy Barbay, Timothy M. Chan
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
Shattering News
R.P. Anstee, Lajos Rónyai, Attila Sali
2002· article· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
42
citations
affno abstractunlabeled
Rectangular drawings of planar graphs
Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh
2003· article· en· Journal of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
42
citations
affno abstractunlabeled
Graph drawings with few slopes
Vida Dujmović, Matthew Suderman, David R. Wood
2006· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affunlabeled
Approximate distance oracles for geometric spanners
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel Smid
2008· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations

How this was built: Screen · Findings · About