Combinatorial Geometry Problems in Pattern Recognition

2002/11/01 by Braß · 14 citations
Computer Science · Mathematics · #Algorithm #Combinatorial optimization #Combinatorics #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #Discrete geometry #Geometry #Graph Theory and Algorithms #Matching (statistics) #Mathematics #Point (geometry)

paper · pdf · doi:10.1007/s00454-002-2884-3

published in Discrete & Computational Geometry 28(4), 495-510 (Springer Science and Business Media LLC)

crossref issued 2002/11/01 · crossref published 2002/11/01 · crossref published-online 2002/11/01 · crossref published-print 2002/11/01 · openalex publication_date 2002/11/01 · crossref created 2003/11/13 · crossref deposited 2019/05/28 · openalex created_date 2025/10/10 · crossref indexed 2026/07/06 · openalex updated_date 2026/07/23

Citations

• On the Maximum Number of Equilateral Triangles, I
• Combinatorial complexity bounds for arrangements of curves and spheres
• Range searching with efficient hierarchical cuttings
• Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets
• The Number of Congruent Simplices in a Point Set
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry

Cited by

• Unit distance graph [wikipedia]