Finding squares and rectangles in sets of points

DOI10.1007/BF01931281MaRDI QIDQ802873zbMATH OpenFDO

Authors Mark de Berg, Marc 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)

Recommendations

• scientific article; zbMATH DE number 219276
• Fast sequential and parallel algorithms for finding the largest rectangle separating two sets
• The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
• On the maximum empty rectangle problem
• Matching points with rectangles and squares

Cites work

• scientific article; zbMATH DE number 3153711 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Arboricity and Subgraph Listing Algorithms
• On Sets of Distances of n Points
• Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs

Cited in

(11)

• Matching Points with Circles and Squares
• Improved approximation bounds for planar point pattern matching
• Finding specified sections of arrangements: 2D results
• Repeated angles in the plane and related problems
• scientific article; zbMATH DE number 7205030 (Why is no real title available?)
• scientific article; zbMATH DE number 219276 (Why is no real title available?)
• Permuting matrices to avoid forbidden submatrices
• The complexity of grid coloring
• Matching points with squares
• On the number of similar instances of a pattern in a finite set
• Homotheties and incidences

This page was built for publication: Finding squares and rectangles in sets of points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802873)