Questions tagged [polygons]
The polygons tag has no usage guidance.
130
questions
0
votes
0
answers
39
views
Incenter-of-mass of a polygon
"Circumcenter of mass"
is a natural generalization of circumcenter to non-cyclic polygons.
CCM(P) can be defined as the weighted average of the circumenters
of the triangles in any ...
- 147
1
vote
0
answers
41
views
Triangle centers formed a rectangle associated with a convex cyclic quadrilateral
Similarly Japanese theorem for cyclic quadrilaterals, Napoleon theorem, Thébault's theorem, I found a result as follows and I am looking for a proof that:
Let $ABCD$ be a convex cyclic quadrilateral.
...
- 1,454
6
votes
1
answer
188
views
Inscribing one regular polygon in another
Say that one polygon $P$ is inscribed in another one $Q$, if $P$ is contained entirely in (the interior and boundary of) $Q$ and every vertex of $P$ lies on an edge of $Q$. It's clear that a regular $...
- 161
0
votes
1
answer
168
views
Density of the set of convex polygons in the Banach-Mazur distance
Is the set of convex polygons dense in the set of convex domains in $\mathbb{R}^2$, for the Banach-Mazur distance?
Any insight for a negative or positive answer is very much welcome!
- 191
5
votes
0
answers
174
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 ...
- 2,997
4
votes
1
answer
288
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 ...
- 150k
1
vote
0
answers
101
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 ...
- 2,997
1
vote
0
answers
90
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 ...
- 2,997
10
votes
0
answers
164
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 ...
- 150k
7
votes
1
answer
484
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 ...
- 71
0
votes
1
answer
49
views
What is the most dense sample for which the Crust algorithm returns an incorrect polygonal reconstruction?
The Crust algorithm by Amenta, Bern, and Eppstein computes a polygonal reconstruction of a smooth curve $C$ without boundary from a discrete set of sample points $S$. It is known that if $S$ is an a $\...
- 413
10
votes
0
answers
197
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 ...
- 20.7k
14
votes
0
answers
265
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, ...
- 2,997
14
votes
2
answers
715
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 ...
- 151
4
votes
0
answers
188
views
Happy ending problem - why not a proof by induction? (cont)
After sharing ideas on this post, I have been thinking for some time on the problem, and I think that a possible way to prove the Erdös-Szekeres conjecture could be structured as follows:
Consider ...
- 239