Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets

DOI10.1007/PL00009388zbMath0910.68216OpenAlexW2051635527MaRDI QIDQ1272958

K. Appert

Publication date: 19 April 1999

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009388

zbMATH Keywords

largest common point set problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

The maximal number of 3-term arithmetic progressions in finite sets in different geometries ⋮ Improved Bounds for Incidences Between Points and Circles ⋮ Simple algorithms for partial point set pattern matching under rigid motion ⋮ Approximate input sensitive algorithms for point pattern matching ⋮ ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES ⋮ MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION ⋮ On finding maximum-cardinality symmetric subsets

This page was built for publication: Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets