Finding squares and rectangles in sets of points

DOI10.1007/BF01931281zbMath0726.68044MaRDI QIDQ802873

Mark T. de Berg, Marc J. van Kreveld

Publication date: 1991

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

sets of pointssubgraphs in bipartite graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Permuting matrices to avoid forbidden submatrices, The complexity of grid coloring, Repeated angles in the plane and related problems, On the number of similar instances of a pattern in a finite set, Homotheties and incidences, Improved approximation bounds for planar point pattern matching

Cites Work

• Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs
• Arboricity and Subgraph Listing Algorithms
• On Sets of Distances of n Points
• Unnamed Item
• Unnamed Item