The number of congruent simplices in a point set

DOI10.1007/s00454-002-0727-xzbMath1018.52011OpenAlexW2071423278MaRDI QIDQ1864184

Pankaj K. Agarwal, Micha Sharir

Publication date: 17 March 2003

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

Full work available at URL: https://doi.org/10.1007/s00454-002-0727-x

zbMATH Keywords

number of \(k\)-simplices

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Erd?s problems and related topics of discrete geometry (52C10)

Related Items (4)

Output sensitive algorithms for approximate incidences and their applications ⋮ Geometric pattern matching reduces to \(k\)-SUM ⋮ Pinned distance sets, \(k\)-simplices, Wolff's exponent in finite fields and sum-product estimates ⋮ Geometric Pattern Matching Reduces to k-SUM.

This page was built for publication: The number of congruent simplices in a point set