Finding squares and rectangles in sets of points

DOI10.1007/BF01931281zbMATH Open0726.68044MaRDI QIDQ802873FDOQ802873

Mark de Berg, Marc Van Kreveld

Publication date: 1991

Published in: BIT (Search for Journal in Brave)

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

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)

Cites Work

• Title not available (Why is that?)
• On Sets of Distances of n Points
• Arboricity and Subgraph Listing Algorithms
• Title not available (Why is that?)
• Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs

Cited In (11)

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

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)