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

Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama

Research output: Contribution to conferencePaper

13 Citations (Scopus)

Abstract

This paper considers the following problem which we call the largest common point set problem (LCP): given two point sets P and Q in the Euclidean plane, find a subset of P with the maximum cardinality which is congruent to some subset of Q. We introduce a combinatorial-geometric quantity λ(P, Q), which we call the inner product of the distance-multiplicity vectors of P and Q, show its relevance to the complexity of various algorithms for LCP, and give a non-trivial upper bound on λ(P, Q). We generalize this notion to higher dimensions, give some upper bounds on the quantity, and apply them to algorithms for LCP in higher dimensions. Along the way, we prove a new upper bound on the number of congruent triangles in a point set in the four-dimensional space.

Original languageEnglish
Pages314-323
Number of pages10
DOIs
Publication statusPublished - 1997 Jan 1
EventProceedings of the 1997 13th Annual Symposium on Computational Geometry - Nice, Fr
Duration: 1997 Jun 41997 Jun 6

Other

OtherProceedings of the 1997 13th Annual Symposium on Computational Geometry
CityNice, Fr
Period97/6/497/6/6

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets'. Together they form a unique fingerprint.

  • Cite this

    Akutsu, T., Tamaki, H., & Tokuyama, T. (1997). Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets. 314-323. Paper presented at Proceedings of the 1997 13th Annual Symposium on Computational Geometry, Nice, Fr, . https://doi.org/10.1145/262839.262989