Plane point sets with many squares or isosceles right triangles
Sascha Kurz

TL;DR
This paper investigates the maximum number of squares and isosceles right triangles that can be formed by n points in the plane, providing exact counts for small n and bounds for larger n, along with some structural insights.
Contribution
It determines exact maximum counts for small n and establishes lower bounds for larger n for both squares and isosceles right triangles, advancing understanding of geometric configurations.
Findings
Exact values for maximum squares for n ≤ 17.
Exact values for maximum isosceles right triangles for n ≤ 14.
Lower bounds for larger n for both shapes.
Abstract
How many squares are spanned by points in the plane? Here we study the corresponding maximum possible number of squares and determine the exact values for all . For we give lower bounds for . Besides that a few preliminary structural results are obtained. For the related problem of the maximum possible number of isosceles right triangles we determine the exact values for and give lower bounds for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Computational Geometry and Mesh Generation · Advanced Numerical Analysis Techniques
