MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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 14 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.

affunlabeled
Asymptotics of linked polygons
Andrea Bonato, Enzo Orlandini, S G Whittington
2020· article· en· Journal of Physics A Mathematical and Theoretical· Computer Science
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
venueno affunlabeled
Degree four plane spanners: Simpler and better
Iyad Kanj, Ljubomir Perković, Duru Türkoğlu
2017· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
venueno affunlabeled
Orthogonal Terrain Guarding is NP-complete
Édouard Bonnet, Panos Giannopoulos
2019· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Geometric thickness in a grid
David R. Wood
2003· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affno abstractunlabeled
On k-sets of type (2, h) in a planar space.
Nicola Durante, Domenico Olanda
2006· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Streaming Euclidean MST to a Constant Factor
Xi Chen, Vincent Cohen-Addad, Rajesh Jayaram, Amit Levi, Erik Waingarten
2023· article· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
5
citations
affno abstractunlabeled
Planar Subgraphs without Low-Degree Nodes
Evangelos Kranakis, Oscar Morales Ponce, Jukka Suomela
2011· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affno abstractunlabeled
The θ 5-Graph is a Spanner
Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
5
citations
affunlabeled
On the Inverse Beacon Attraction Region of a Point.
Bahram Kouhestani, David Rappaport, Kai Salomaa
2015· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Dilation-Optimal Edge Deletion in Polygonal Cycles
Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel Smid, Yajun Wang
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affno abstractunlabeled
Cauchy’s Theorem and Edge Lengths of Convex Polyhedra
Thérèse Biedl, Anna Lubiw, Michael J. Spriggs
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affno abstractunlabeled
Drawing Planar Graphs with Many Collinear Vertices
Giordano Da Lozzo, Vida Dujmović, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli
2016· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affunlabeled
Kinetic mesh refinement in 2D
Umut A. Acar, Benoît Hudson, Duru Türkoğlu
2011· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affunlabeled
On the Geodesic Centers of Polygonal Domains
Haitao Wang
2016· preprint· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
More Turán-Type Theorems for Triangles in Convex Point Sets
Boris Aronov, Vida Dujmović, Pat Morin, Aurélien Ooms, Luı́s Fernando Schultz Xavier da Silveira
2019· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Flying over a polyhedral terrain
Hamid Zarrabi-Zadeh
2007· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Triangulating and Guarding Realistic Polygons.
Greg Aloupis, Prosenjit Bose, Vida Dujmović, Chris Gray, Stefan Langerman, Bettina Speckmann
2008· article· en· TU/e Research Portal· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Thickness and Colorability of Geometric Graphs
Stéphane Durocher, Ellen Gethner, Debajyoti Mondal
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affno abstractunlabeled
Packing two disks in a polygon
Sergei Bespamyatnikh
2002· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Computational geometry column 54
Adrian Dumitrescu, Csaba D. Tóth
2012· article· en· ACM SIGACT News· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Crossing Numbers of Periodic Graphs
Zdenĕk Dvořák, Bojan Mohar
2015· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
On $r$-Guarding Thin Orthogonal Polygons
Thérèse Biedl, Saeed Mehrabi
2016· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
venueno affunlabeled
Planar and Poly-Arc Lombardi Drawings
Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen Kobourov, Maarten Löffler
2011· preprint· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
venueno affunlabeled
Connected rectilinear graphs on point sets
Maarten Löffler, Elena Mumford
2010· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
fundno affunlabeled
A simple formula for quad mesh singularities
Harold J. Fogg, Liang Sun, Jonathan E. Makem, Cecil Armstrong, Trevor Robinson
2017· article· en· Procedia Engineering· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
← previousnext →

How this was built: Screen · Findings · About