Skip to main content

All Questions

Filter by
Sorted by
Tagged with
21 votes
0 answers
271 views

The "stained glass window problem": Draw many random chords in a circle; which kind of polygon ($3$-gon, $4$-gon, etc.) occupies the most total area?

Draw $n$ random chords in a circle, where each chord connects two independent uniformly random points on the circle. As $n\to\infty$, which kind of polygon (triangle, quadrilateral, pentagon, etc.) ...
9 votes
0 answers
256 views

Compass and straightedge construction of Poncelet polygons

Gauss–Wantzel theorem states that A regular n-gon is constructible with straightedge and compass if and only if $n = 2^kp_1p_2...p_t$, where $p_i$'s are distinct Fermat primes (A Fermat prime is a ...
4 votes
1 answer
330 views

Billiard circuits in pentagons

A billiard circuit in a convex $n$-gon is a closed billiard path of $n$ segments reflecting from consecutive edges of the polygon. Every regular $n$-gon has such a billiard circuit: Recently a ...
2 votes
0 answers
48 views

Maximum coverage of an orthogonal polygon using $k$ rectangles

I have an orthogonal polygon (all edges are horizontal or vertical) which is convex (no holes in any row of column of the polygon). I would like to cover as much as possible of this orthogonal polygon ...
19 votes
5 answers
21k views

Dividing a square into 5 equal squares

Can you divide one square paper into five equal squares? You have a scissor and glue. You can measure and cut and then attach as well. Only condition is You can't waste any paper.
6 votes
1 answer
880 views

Relation of some Euclidean geometry theorems and more conjecture generalizations

In this topic I want to share relation of the Pythagorean theorem, the Stewart theorem and the British Flag theorem, the Apollonius' theorem, the Ptolemy's theorem and the Feuerbach-Luchterhand. Since ...
3 votes
2 answers
279 views

Construct by compactness (Pentagonal tiling – Rao paper)

In the (arXiv) paper, Exhaustive search of convex pentagons which tile the plane by Michael Rao, on page 4 under the proof of Lemma 2, it is said that: "… We keep a connected component $H_d'$ of $...
7 votes
1 answer
497 views

Is there a bicyclic irregular pentagon in integers?

Is there a bicyclic irregular pentagon in integers, i.e. is there a pentagon, the length of each side is integer and unique such that it has a circumcircle and an inner circle as well? If it does ...
3 votes
1 answer
427 views

Generalization of some plane geometry theorems

Conjecture: Let $A_1, A_2,\dotsc,A_n$; $B_1, B_2,\dotsc,B_n$ and $C_1, C_2,\dotsc,C_n$ be $3n$ points in the plane such that $\angle{\overrightarrow{A_iB_i}, \overrightarrow{A_{i+1}B_{i+1}}}=\frac{2\...
10 votes
0 answers
199 views

Do cut-length-minimizing equidissections exist?

Suppose $A,B$ are polygons of equal area. By the Wallace-Bolyai-Gerwien theorem, $A$ and $B$ are equidissectable: we can make finitely many straight-line cuts in $A$ and rearrange the resulting pieces ...
5 votes
0 answers
184 views

Question about $n$ random points in a regular polygon, and a limiting probability

Suppose we choose $n$ uniformly random points in a disk, then draw the smallest circle that encloses all of those points. There is evidence suggesting that the probability that the enclosing circle is ...
1 vote
0 answers
103 views

A regular $n$-gon contains a regular $m$-gon, with $n,m$ coprime, no sides coinciding. What is the maximum number of contact points between them?

A regular $n$-gon contains a regular $m$-gon, where $n$ and $m$ are coprime, with no sides coinciding. What is the maximum number of contact points between the $n$-gon and the $m$-gon? (I'm not ...
1 vote
0 answers
93 views

All the regular $n$-gons are nested tightly around a unit circle. How to order them to minimize the outer radius, and what is that minimum radius?

Let $u_1,u_2,u_3,\dots$ be a permutation of the integers greater than $2$. A unit circle is in a regular $u_1$-gon, which is a regular $u_2$-gon, which is in a regular $u_3$-gon, ad infinitum. Each ...
4 votes
0 answers
232 views

Illuminating a just-barely irrational polygon

As has been discussed earlier on MO,1,2 recently an impressive advance was proved concerning internally illuminating a mirrored polygon. Here is the result: Let $P$ be a rational polygon. Then for ...
10 votes
0 answers
177 views

Minimum reflection paths in a mirror polygon

Let $P$ be a simple, orthogonal polygon of $n$ edges, i.e., one whose edges meet at right angles, and is non-self-intersecting; also known as a rectilinear polygon. Treat every edge of $P$ as a ...
14 votes
0 answers
270 views

Regular $n$-gon with diagonals: bounds on area of largest cell?

Consider a regular $n$-gon of side length $1$ with diagonals. Here is an example with $n=11$ (from geogebra applet). I've been trying to find, in terms of $n$, bounds on the area of the largest cell, ...
15 votes
2 answers
779 views

How to characterize the regularity of a polygon?

In my research, I've recently started to play with Voronoi tessellations. I currently have a Python code that creates the tessellation and I am trying to color the polygonal regions according to their ...
20 votes
2 answers
25k views

Partitioning a polygon into convex parts

I'm looking for an algorithm to partition any simple closed polygon into convex sub-polygons--preferably as few as possible. I know almost nothing about this subject, so I've been searching on Google ...
0 votes
0 answers
115 views

Explicit equation for border of the Minkowski sum of sets

Assume we have sets of the form $$ M_j = \{x\in\mathbb{R}^d : f_j(x) \le 0,x \ge 0\} $$ where $x\ge 0$ means $x_i \ge 0 \quad \forall i=1,\dots, d$. Goal I am looking for an (explicit) representation ...
15 votes
4 answers
815 views

Unlinked interlocking planar polygons

Let $P$ and $Q$ be the boundary segments of two planar simple polygons. View these boundaries as rigid wires. Fix $Q$ in, say, the $xy$-plane, and imagine $P$ arranged in $\mathbb{R}^3$ so that $P$ ...
6 votes
4 answers
584 views

Necessary and sufficient condition for quadrilateral to be cyclic

Can you provide a proof for the following proposition: Proposition. Given any quadrilateral $ABCD$. Let $P,Q,R,S$ be nine-point centers of triangles $\triangle ABD$,$\triangle ABC$,$\triangle BCD$ ...
9 votes
5 answers
13k views

Get a point inside a polygon

I have a 2D polygon of arbitrary geometry. I need to find any point that is inside of that polygon. Taking the center won't work, because the polygon might not be convex. Is there a way to quickly ...
1 vote
0 answers
65 views

To extend the Steiner-Lehmus theorem

The Steiner Lehmus theorem (https://en.wikipedia.org/wiki/Steiner%E2%80%93Lehmus_theorem) states: Every triangle with two angle bisectors of equal lengths is isosceles. Question: What could one say ...
3 votes
1 answer
69 views

Scissor congruence for foliated polygons

Given two polygons of equal area with horizontal foliations, can one describe the obstruction (if there is any but I suspect the answer to be yes) to scissor-equivalence respecting the horizontal ...
3 votes
1 answer
158 views

The product of the lengths of two line segments that belong to Newton line [closed]

I am looking for the proof of the following claim: Consider a family of bicentric quadrilaterals with the same inradius length and the same distance between incenter and circumcenter. Denote by $P$ ...
1 vote
1 answer
111 views

Collinearity in tangential pentagon [closed]

I am looking for a proof of the following claim: Given tangential pentagon. Touching point of the incircle and the side of the pentagon,the vertex opposite to that side and the intersection point of ...
3 votes
1 answer
286 views

Need help with finding all angles of 11 sided 3D object [closed]

Question: I'm an artist trying to build a hendecahedron for a project (Image below to see the shape). This object consists of 5 pentagons at the base, 1 pentagon on the bottom, then 5 quadrilaterals ...
1 vote
1 answer
51 views

On triangulations and "coverage" of circumcircles

Let $P$ be a convex quadrilateral defined by four vertices $a$, $b$, $c$, and $d$. Suppose that the circumcircle of $\triangle abd$ contains $c$.* Let $D(\triangle abc)$ to denote the area enclosed by ...
2 votes
0 answers
83 views

Principal diagonals of octagon meet in a single point

Can you provide a proof for the following claim: Claim. Given octagon circumscribed about an ellipse. If the vertices of the octagon lie on another ellipse then its principal diagonals meet in a ...
1 vote
1 answer
84 views

Equal products of triangle areas

Can you prove the following claim: Claim. Given hexagon circumscribed about an ellipse. Let $A_1,A_2,A_3,A_4,A_5,A_6$ be the vertices of the hexagon and let $B$ be the intersection point of its ...
3 votes
1 answer
103 views

Equal sums of line segments

I would like to see a proof of the following Claim. Let $A_1,A_2,A_3,A_4,A_5$ be vertices of bicentric pentagon. Let $B_1$ be the intersection point of $A_1A_3$ and $A_2A_5$, $B_2$ the intersection ...
8 votes
2 answers
339 views

Angle subtended by the shortest segment that bisects the area of a convex polygon

Let $C$ be a convex polygon in the plane and let $s$ be the shortest line segment (I believe this is called a "chord") that divides the area of $C$ in half. What is the smallest angle that $s$ could ...
15 votes
1 answer
616 views

Acute triangles in "obtuse" polygons?

Let $P$ be a convex polygon. Suppose every interior angle of $P$ is obtuse. Is it always the case that there exist three vertices $p, q, r$ of $P$ such that $\triangle pqr$ is acute? I conjecture ...
3 votes
1 answer
123 views

Collinearity of three significant points of bicentric pentagon

Can you provide a proof for the following claim? Claim. Given bicentric pentagon. Consider the triangle whose sides are two diagonals drawn from the same vertex and side of pentagon opposite from ...
1 vote
0 answers
187 views

Does there exist an isometry between a regular polygon and a circle?

In order to define the question in a meaningful fashion, I am referring to a smooth manifold $\mathcal{M}$ within an $\epsilon$-neighborhood of a regular polygon $\mathcal{P}$ satisfying $$\max\{\|x-p\...
4 votes
1 answer
320 views

Collinearity in bicentric polygons

Can you provide a proofs for the following two claims? Claim 1. The circumcenter, the incenter, and the intersection of the principal diagonals in a bicentric even-sided polygon are collinear. Claim ...
6 votes
1 answer
224 views

Necessary and sufficient condition for tangential polygon to be cyclic

Can you prove or disprove the following claim? Claim. Let $A_1,A_2, \ldots ,A_n$ be the vertices of an $n$-sided tangential polygon and let $B_1,B_2, \ldots ,B_n$ be the contact points of the ...
1 vote
1 answer
317 views

A generalization of Harcourt's theorem

This question is closely related to my previous question. Can you prove the claim given below? The following claim is a conjectured generalization of Harcourt's theorem. Claim. Let $A_1,A_2 \ldots ...
1 vote
1 answer
320 views

A formula for the area of bicentric quadrilateral

Can you provide a proof for the claim given below? The following claim is inspired by Harcourt's theorem and can be seen as its generalization to quadrilaterals. Claim. Given bicentric quadrilateral $...
0 votes
0 answers
34 views

Maintain the area of a polygon when offsetting one side

I have an irregular polygon with the a specific area (area_red). How can I get the (parallel) offset value (y) of n selected sides in order to maintain the same area (area _red = area_green) when (...
3 votes
1 answer
303 views

How can construct three circles in a given triangle such that three internal tangent form an equilateral triangle

How can construct three circles in a given triangle such that three internal tangent form an equilateral triangle? See also: Malfatti circles
3 votes
1 answer
805 views

Brother of Japanese theorem for cyclic quadrilaterals

I am looking for a proof of a like result as follows and Higher-dimensional generalizations? Let $A, B, C, D$ be four point with lengths of $AB, BC, CD, DA$ are $a, b, c, d$ respectively. Let $F \in ...
1 vote
0 answers
129 views

Is the mean center of the vertices of a convex polygon always inside the polygon? [closed]

As simple as that. I'm doing an R program where I need to order clockwise a bunch of points that describe a regular polygon and to do that I figured I could find a point inside, change to polar ...
4 votes
1 answer
332 views

Construct closed chain of $k$-gon around $n$ points-$n, k$ are odd primes number

Question 1: I am looking for a proof of the conjectures 1, 2, 3 as follows? Question 2: In conjecture 3, in general case, I can not give a formula of $X$. But I think, If $n, k$ are odd primes number ...
4 votes
1 answer
266 views

A closed chain of $2n+1$-gon around $2n+1$-points

I posed a generalization of Theorem 3.2 In my paper Conjecture: Let $P_1, P_2,....,P_{2n+1}$ and $O$ be $2n+2$ points in plane. Construct a chain $2n+1$ regular ${2n+1}$-gons $A_{1\;1}A_{1\;2}...A_{1\;...
1 vote
0 answers
84 views

How can construct the equilateral $A''B''C''$ such that area of $A''B''C''$ is biggest

Let $ABC$ be arbitrary triangle in a plane. Let $A'B'C'$ and $A''B''C''$ be two equilateral triangles such that $A \in B'C'$, $B \in C'A'$, $C \in A'B'$ and $A \in B''C''$, $B \in C''A''$, $C \in A''B'...
16 votes
2 answers
1k views

Maximum area of the intersection of a parallelogram and a triangle

How large can the intersection of a parallelogram (or a square, if you prefer) with a triangle be, if each of them is of unit area? It is easy to see that the intersection can be of area 3/4 – is this ...
3 votes
3 answers
2k views

Is there a simple criterion to determine if two parallelograms intersect?

Assume we are given two parallelograms in the plane. How can I check if their intersection is nonempty? Note that I do not need to actually find the intersection.
11 votes
2 answers
863 views

Strange formula for area of a convex polygon

Consider a convex $n-$gon in $\mathbb{R}^2$ with sides contained in the lines $y=k_ix+b_i, 1\leq i\leq n.$ Then its area equals to $$ S=\frac{1}{2}\sum_{i=1}^{n} \frac{(b_{i+1}-b_i)^2}{k_{i+1}-k_i}. $$...
2 votes
1 answer
440 views

Build reversed No-Fit-Polygon

I need some robust algorithm to optimally fit one non-convex polygon into another. The destination one can contain holes. Recently I found scholarly articles on this subject: One of them describes ...