Skip to main content

All Questions

Filter by
Sorted by
Tagged with
8 votes
4 answers
530 views

Inside-out polygonal dissections

A dissection of a polygon $P$ is a partition of $P$ into a finite number of pieces, which can then be rearranged (via planar translations and rotations) and joined (without overlap) to form a new ...
Joseph O'Rourke's user avatar
17 votes
1 answer
458 views

The sparsest planar net that captures every unit segment

Let $\cal C = \lbrace C_i \rbrace$ be a collection of rectifiable curves in the plane with the property that every unit-length segment meets at least one curve in at least one point. Call such a ...
Joseph O'Rourke's user avatar
10 votes
2 answers
280 views

Monochromatic point sets in two-colored plane

Which are the configrations $P\subset \mathbb{R}^2$ of points, such that the following property holds: Property M (for Monochromatic): Every two-coloring of $\mathbb{R}^2$ contains a monochromatic ...
Moritz Firsching's user avatar
6 votes
2 answers
544 views

On circles and ellipses drawn on an infinite planar square lattice

Consider a plane with a square lattice formed by all points with both coordinates as integers. As can be easily seen, a simple parabola can be found that passes through infinitely many of the square ...
Nandakumar R's user avatar
  • 5,979