Questions tagged [plane-geometry]
Plane Geometry is about flat shapes like lines, circles and triangles , shapes that can be drawn on a piece of paper
479
questions
18
votes
1
answer
1k
views
Does greedy circle packing exhaust the measure of every bounded open set in the plane?
The greedy circle packing of a bounded region in the plane is the result of placing at each stage the largest possible disk into the region that remains uncovered.
The greedy circle packing of a ...
4
votes
0
answers
103
views
Curiosity about "conditional trig identities"
Perhaps this should be cross-posted on Math Stackexchange, but it came up in the context of some research mathematics (quaternion orders, etc.) In this context, I have three angles $\alpha, \beta, \...
0
votes
2
answers
156
views
Radical line of two ellipses
The equation of an ellipse with focal points $(a_1,b_1)$ and $(a_2,b_2)$ which passes through the point $(a_3,b_3)$ is given by the equation
$$\begin{gathered}
\sqrt{ (x-a_1)^2+(y-b_1)^2 } + \sqrt{ (x-...
1
vote
3
answers
194
views
A rational distance problem with (possibly) multiple solutions
Background: It is not known if any point exists on the XY plane that is at rational distance from all 4 vertices of a unit square lying on the XY plane (https://mathworld.wolfram.com/...
2
votes
1
answer
89
views
Mandelbrot boundary and component of $\infty$
Let $M$ be the Mandelbrot set, and $\partial M$ its boundary. So $\partial M$ is the set of those points $z\in M$ such that every neighborhood of $z$ contains a point of $\mathbb R^2\setminus M$.
Let $...
3
votes
1
answer
188
views
Simple closed curves in a simply connected domain
Let $U$ be a bounded simply connected domain in the plane. Let $K$ be the boundary (or frontier) of $U$. For every $\varepsilon>0$ is there a simple closed curve $S\subset U$ such that the ...
-1
votes
2
answers
166
views
Locus of points for which the sum of the angles subtended there by two different line segments is a constant
Given a line segment AB, the locus of points P such that the angle APB has a constant value is a 'biconvex lens' formed by 2 circular arcs that passes through the points A and B. Special case: if APB ...
5
votes
5
answers
888
views
Two arcs in the complement of a disc must intersect?
Let $D=\{z\in \mathbb C:|z|\leq 1\}$ be the unit disc in the complex plane, with interior $U=\{z\in \mathbb C:|z|<1\}$.
Let $A\subset \mathbb C\setminus U$ be an arc intersecting $D$ only at its ...
0
votes
1
answer
121
views
On 'special' points on uniform planar convex regions defined in terms of moment of inertia
The following can be easily proved using perpendicular axes theorem and intermediate value theorem:
Lemma: Given any uniform planar convex region $C$ and any point on it, $P$, there will be at least ...
0
votes
0
answers
103
views
A surprising result with the Riccati difference equation
I was looking at the Riccati difference equation with positive and negative indices
$$
R_n=\frac{aR_{n-1}+b}{cR_{n-1}+d}\quad n\in[0,N]\\
R_n=\frac{-dR_{n+1}+b}{cR_{n+1}-a}\quad n\in[-N,0]\\
$$
along ...
2
votes
1
answer
132
views
On the moment of inertia of planar convex regions and possible special nature of circular disks
We consider uniform convex planar regions and lines through their center of mass and lying in the same plane as the region; each line is parametrized by an angle $\alpha$ it makes with some reference ...
2
votes
0
answers
136
views
On segments of equal area cut from planar convex regions by chords
Consider a planar convex region $C$ of unit area and all chords of it that cut off a segment of area $\alpha$ from $C$. Obviously, if $C$ is a circular disk of unit area, all segments of area $\alpha$ ...
2
votes
1
answer
181
views
Minimal degree of a polynomial such that $|p(z_1)| > |p(z_2)|, |p(z_3)|, ..., |p(z_n)|$
I was investigating the behavior of $p(x)^n \mod {q(x)}$, for some polynomials $p, q \in \mathbb{C}[x]$. We'll assume $q$ is squarefree. If $q(x) = (x - z_1) (x - z_2) (x - z_3) ... (x - z_n)$ for ...
0
votes
0
answers
17
views
Is the impression of an ideal boundary point (=end) the union of the impressions of the prime ends of the circle of prime ends associated to this end?
Let S be a compact orientable surface and U an open connected subset of S with finitely many ideal boundary points (or ends). U has a prime ends compactification which is a surface with boundary (...
1
vote
0
answers
37
views
The optimal embedded and enclosing cardioids for a triangle
Ref: https://en.wikipedia.org/wiki/Cardioid
Earlier posts with similar questions: Smallest 3-ellipses that contain triangles and Curves of constant width that contain triangles
Questions: Given any ...
2
votes
0
answers
34
views
The trajectory of the midpoint of perimeter-bisecting pair of points of a closed convex curve and its area
Given a closed convex curve $C\subset \mathbb{R}^2$, there is a continuous family of pair of points in $C$ that bisects the perimeter of $C$. The midpoint of such pair draws a closed curve inside $C$; ...
1
vote
0
answers
49
views
On points in the interior of planar convex regions and inscribed triangles
Given any planar convex region C, it is easy to show that every point in the interior C is the mid point of at least one chord of C. Likewise,
Question: Is every point in the interior of C the ...
1
vote
1
answer
104
views
A claim on the concurrency of area bisectors of planar convex regions
We add a little bit to On 'fair bisectors' of planar convex regions and Bisectors and partitioning lines for convex regions defined with respect to the moment of inertia
Definitions: Given a ...
2
votes
0
answers
202
views
A generalization of the Archimedean circle
I proposed a generalization of the Archimedean circle : In this figure $M$ is the midpoint of $AB$, $DE$; $(G)$, $(H)$, $(M)$ are the semicircles. Then two yellow circles are congruent.
Question: Is ...
3
votes
2
answers
182
views
Recovering a set from its projections in varying coordinate systems - a projection hull?
Let me describe the simplest non-trivial case of what I have in mind. Let $V$ be a 2-dimensional $\mathbb{R}$-vector space and fix an isomorphism $V \cong \mathbb{R}^2$, where $\mathbb{R}^2$ is ...
3
votes
0
answers
68
views
Is every weakly $1$-dimensional space embeddable in the plane?
A $1$-dimensional (separable metric) space $X$ is weakly $1$-dimensional if $$\Lambda(X)=\{x\in X:X\text{ is 1-dimensional at }x\}$$
is zero-dimensional (i.e. the space $\Lambda(X)$ has a basis of ...
1
vote
0
answers
85
views
A special configuration of Nine Circles Theorem and Eight Circle Theorem
The result as follows from special configuration of merge Nine Circle Theorem and Eight Circle theorem but it is new:
Problem: Let three circle $(A)$, $(B)$, $(C)$ , let $A_c$ be arbitrary point in ...
1
vote
0
answers
95
views
Tiling the plane with pair-wise non-congruent and mutually similar triangles
Question: Is it possible to tile the plane with triangles that are (1) mutually similar, (2) pairwise non-congruent and (3)non-right? No other constraints.
Note 1: Reg requirement 3 above: since any ...
0
votes
0
answers
116
views
On partitioning convex planar regions into congruent pieces - 2
We add a bit to A claim on partitioning a convex planar region into congruent pieces .
Definition: A perfect congruent partition of a planar region $C$ is a partition of it into some finite number $n$ ...
6
votes
2
answers
612
views
Is there an L-system for aperiodic tilings of the plane with the "hat" monotile?
Most aperiodic tilings of the plane, except possibly for spiral tilings like the Voderberg tiling, exhibit a fractal pattern of self-similarity. This is no exception for the recently discovered "...
5
votes
1
answer
401
views
On the aperiodic monotile
One of the more mind-boggling aspects of the Penrose tiles is that there are uncountably many distinct tilings of the plane, but every tiling contains every finite region that appears in another ...
0
votes
0
answers
111
views
Concurrencies determined by intersections of angle trisectors (and isogonal lines) in a triangle
The famous Morley’s theorem, states that in a triangle the interior angle trisectors, proximal to sides respectively, meet at the vertices of an equilateral. However the six trisectors meet at 12 ...
22
votes
1
answer
1k
views
Aperiodic monotile without reflections?
The recently discovered amazing aperiodic monotile (or "einstein") of David Smith, Joseph Samuel Myers, Craig S. Kaplan, and Chaim Goodman-Strauss tiles the plane only if reflections of the ...
14
votes
5
answers
1k
views
How can one construct a four-coloring of a tiling of the plane with Smith, Myers, Kaplan, and Goodman-Strauss's aperiodic monotile?
This is motivated by the new paper of Smith, Myers, Kaplan, and Goodman-Strauss, wherein they define the existence of an aperiodic monotile. Clearly their tiling is not three-colorable, so we have ...
0
votes
0
answers
98
views
Is Morley’s observation complete?
Morley’s observation states that in a triangle the intersections of trisectors proximal to a (triangle) side lie six by six on three triples of parallel lines that make angles of 60° with each other. ...
1
vote
1
answer
111
views
Reconstructing an ellipse from an arc, synthetically
Given only an arc of a circle, we can easily reconstruct it fully without any use of analytic geometry - indeed using only compass and straightedge. Note that by "given only an arc", we mean ...
14
votes
1
answer
497
views
Interpolating between disks in the plane
Below, a "disk" means a compact subspace $D \subset \mathbb R^2$ whose boundary is a smooth simple closed curve.
Task: Find a procedure which takes as input a pairs
of disks
$
D_0 \subseteq ...
1
vote
0
answers
68
views
Show that a region in a plane defined by a polynomial contains integer points
Let $F \in \mathbb{Z}[x,y]$ be a polynomial of degree $2n$ such that the homogeneous degree $2n$ part of $F$, say $F_{2n}$, is positive semi-definite. How does one show that for some $\delta_n > 0$ ...
4
votes
0
answers
174
views
The closest ellipse to a given triangle
Definition: The Hausdorff distance between two point sets is the greatest of all the distances from a point in one set to the closest point in the other set.
Question: Given a general triangle T, to ...
0
votes
1
answer
50
views
On 'axiality' of planar convex regions
Axiality has been studied under a definition given here: https://en.wikipedia.org/wiki/Axiality_(geometry)
Consider an alternative definition of axiality as follows: For a convex region C, consider a ...
10
votes
0
answers
196
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 ...
16
votes
0
answers
387
views
Is "Escherian metamorphosis" always possible?
$\DeclareMathOperator\int{int}\DeclareMathOperator\diam{diam}\DeclareMathOperator\area{area}\DeclareMathOperator\cl{cl}\DeclareMathOperator\ran{ran}\DeclareMathOperator\dom{dom}$This is a tweaked ...
3
votes
1
answer
158
views
Minimize total area bounded by $N$ lines in general position
Suppose we have $N$ lines in general position (any two lines, but no three lines, meet at a point) ($N\geq 3$). Let the smallest bounded region have area $1$. Determine the minimum (or possibly ...
2
votes
0
answers
101
views
Ellipse of least perimeter that contains a given triangle
This post is related to Smallest 3-ellipses that contain triangles and tries to clarify a basic issue.
Question: Given a general triangle T, How does one find and characterize the ellipse of least ...
6
votes
0
answers
110
views
How many equilaterals have vertices intersections of angle trisectors of a triangle?
The celebrated Morley’s theorem ensures that the interior trisectors, proximal to sides respectively, meet at vertices of an equilateral.
In the paper Trisectors like Bisectors with Equilaterals ...
2
votes
0
answers
228
views
Generalization of the Napoleon equilateral triangle to higher dimention
When I researched the Fermat-Dao-Nhi equilateral triangle in preamble before points X(33602) of the Kimberling triangle center. I discovered the general result for polygon as follows:
Let $A_1$, $A_2$...
3
votes
1
answer
90
views
Convex polygon shadows: Shortest equivalent segments
Let $P$ be a convex polygon.
Q1. What is the shortest collection of line segments $S$ inside $P$
with the property that both $P$ and $S$ have the same sequence of orthogonal shadows
as $P$ and $S$ ...
16
votes
1
answer
868
views
Kakeya crossed-needles problem
The Kakeya needle problem asks for the
minimum area planar region in which one can completely turn around a line segment through
a series of translations and rotations. There is no minimum: There are &...
2
votes
1
answer
128
views
Triangles that can be cut into mutually congruent and non-convex polygons
It is easy to note that an equilateral triangle can be cut into 3 mutually congruent and non-convex polygons (replace the 3 lines meeting at centroid and separating out the 3 congruent quadrilaterals ...
10
votes
1
answer
540
views
Formula for "cointersection" of three circles?
I am working on the problem of finding "rational" dodecahedrons, and I have run across an interesting subproblem: How do you tell if three circles have a common intersection point?
...
19
votes
1
answer
810
views
All saddles in the unit ball have area $<2\pi$?
Let $M$ be the saddle surface in $\mathbb R^3$ defined by $x^2-y^2+z=0$. For any $r\geq 0$ and $(x_0,y_0,z_0)\in\mathbb R^3$, let $rM+(x_0,y_0,z_0)$ denotes the surface obtained by scaling $M$ by $r$ ...
2
votes
1
answer
147
views
Concyclic point made from Six arbitrary points
Let $A_1A_2A_3A_4A_5$ be irregular convex Pentagon and Let $P$ be arbitrary point anywhere in Plane geometry.
Let $X_1,X_2,X_3,X_4,X_5$ be Circumcircle of $\triangle PA1A3$; $\triangle PA2A4$; $\...
33
votes
16
answers
5k
views
Which theorems have Pythagoras' Theorem as a special case?
Loomis famously wrote hundreds of proofs of Pythagoras' Theorem (reference below), but these are all basically proofs "from below". Today on Twitter @panlepan mentioned Carnot's theorem ...
1
vote
0
answers
36
views
Fermat point amidst polygonal obstacles
Consider $k$ distinct points in 2D-plane with $n$ convex polygonal obstacles. Is there a poly-time algorithm (poly in $k$ and the total number of obstacle vertices) to find a point outside of all ...
1
vote
0
answers
179
views
Writing the plane as {(x,y,z): x+y+z=0} [closed]
One can coordinatize the plane by choosing three axes at 120 degree angles and representing points by triples $(x,y,z)$ with $x+y+z=0$. Is there an accepted name for this kind of coordinate system? (...