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 20 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

venueno affunlabeled
Computing maxmin edge length triangulations
Sándor P. Fekete, Winfried Hellmann, Michael Hemmer, Arne Schmidt, Julian Troegel
2017· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Bounds for point recolouring in geometric graphs
Henk Meijer, Yurai Núñez-Rodríguez, David Rappaport
2009· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Triangulations without Minimum-Weight Drawing
Cao An Wang, Francis Y. L. Chin, Boting Yang
2000· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affunlabeled
Flipping your lid
Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin
2001· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
2
citations
affno abstractunlabeled
Reprint of: Face-guarding polyhedra
Giovanni Viglietta
2015· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Unexpected behaviour of crossing sequences
Matt DeVos, Bojan Mohar, Robert Šámal
2009· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Finding Specified Sections of Arrangements: 2D Results
Prosenjit Bose, F. Hurtado, Henk Meijer, Seshan Ramaswami, David Rappaport, Vera Sacristán +2 more
2002· article· en· Journal of Mathematical Modelling and Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
On Farthest-Point Information in Networks.
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2012· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Incremental Voronoi diagrams
Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman
2016· article· en· Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)· Computer Science
distilled prediction:candidate · metaepi_narrow+stsconsensus · none
2
citations
fundno affunlabeled
Infinite Dimensional Spaces
2022· book-chapter· en· WORLD SCIENTIFIC eBooks· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
2
citations
fundno affno abstractunlabeled
Lines Tangent to Four Triangles in Three-Dimensional Space
Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile
2007· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundno abstractunlabeled
Edge guards for polyhedra in three-space
Javier Cano, Csaba D. Tóth, Jorge Urrutia
2022· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Smallest and some new equiprojective polyhedra
Masud Hasan, Mohammad Monoar Hossain, Sabrina Nusrat, Alejandro López-Ortíz
2008· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Connecting a set of circles with minimum sum of radii
Erin Wolf Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan +2 more
2017· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Small-Area Orthogonal Drawings of 3-Connected Graphs
Thérèse Biedl, Jens M. Schmidt
2015· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundno abstractunlabeled
Orthogonal cartograms with at most 12 corners per face
Thérèse Biedl, Lesvia Elena Ruiz Velázquez
2013· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
2
citations
affunlabeled
Optimal covering points and curves
Justin C. Tzou, Brian Wetton
2019· article· en· AIMS Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Realizing Farthest-Point Voronoi Diagrams.
Thérèse Biedl, Carsten Grimm, Leonidas Palios, Jonathan Richard Shewchuk, Sander Verdonschot
2016· article· en· eScholarship (California Digital Library)· Computer Science
distilled prediction:candidate · scholarly_communication+insufficient_payloadconsensus · none
2
citations
affunlabeled
Smooth Morphing Delaunay Triangulation
Xin Liu, Jon Rokne, Marina L. Gavrilova
2010· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
fundno affno abstractunlabeled
Efficient operations on discrete paths
Alexandre Blondin Massé, Srečko Brlek, Hugo Tremblay
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Reconfiguring Convex Polygons.
Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferrán Hurtado, Mark H. Overmars, Michael A. Soss +1 more
2000· article· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
2
citations
affunlabeled
Automating cutting planes is NP-hard
Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi
2020· preprint· en· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Tetrahedralization of Two Nested Convex Polyhedra
Cao An Wang, Boting Yang
2000· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affno abstractunlabeled
Applications of Geometric Spanner Networks
Joachim Gudmundsson, Giri Narasimhan, Michiel Smid
2014· book-chapter· en· Encyclopedia of Algorithms· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations

How this was built: Screen · Findings · About