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
501 questions
7
votes
1
answer
225
views
Optimal stacking of split logs
Consider firewood logs as unit-radius cylinders of the same length.
Each log is split into $k$ pieces by equiangular sectors
meeting in the circle center:
$k=2$ leads to semicircles, $180^\circ$;
$k=3$...
- 151k
7
votes
2
answers
607
views
Will (general points + small number of arbitrary points) impose independent condtions on plane curves?
It is well known that imposing vanishing at general points of $\mathbb P^2$ gives independent conditions on curves of degree $d$. Also, it is known that a small number ($\le d+1$) points always impose ...
- 1,509
7
votes
1
answer
317
views
Minimum area of the convex hull of the union of a parallelogram and a triangle
This question is somewhat dual to my previously stated question about Maximum area of the intersection of a parallelogram and a triangle, where the triangle and parallelogram each is assumed to be of ...
- 7,276
7
votes
1
answer
183
views
Stability Question for Isotopies Between Compact Sets
Suppose $X, Y$ are compact sets in $\mathbb{R}^2$ and $F$ is an ambient isotopy carrying $X$ onto $Y$.
Is there an ambient isotopy $F'$ agreeing with $F$ on $X$ and which is constant in a ...
- 439
7
votes
1
answer
131
views
another extremal property of regular polygons
$\newcommand{\R}{\mathbb{R}}\newcommand{\D}[1]{\Delta_{#1}}\newcommand{\set}[1]{\{#1\}}\newcommand{\abs}[1]{\lvert#1\rvert}\newcommand{\E}{\mathbb{1}}$
In 1984 S.D.Berman, a Soviet mathematician, ...
- 181
7
votes
0
answers
207
views
Is the derivative the unique operation on points in the plane that preserves convexity?
Let $C(n)$ be the space of multisets of size $n$ of points in the Euclidean plane, topologised appropriately, and consider a surjective continuous map: $$D:C(n)\rightarrow C(n-1)$$
Such that the ...
- 1,949
7
votes
0
answers
87
views
Universal point sets for 1-plane graphs
It is a notorious open problem to find a smallest set of $N$ points that
permit any $n$-vertex planar graph to be drawn in the plane without
crossings, using only those $N$ points as vertices, and ...
- 151k
7
votes
0
answers
277
views
Reversing shortest paths among unit disks
Twas the night before Christmas, and throughout M.O.
Not a question was posted, not even by Joe.
Well, let me remedy that. :-)
Let the plane contain a number of ...
- 151k
6
votes
5
answers
953
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 ...
- 3,317
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 ...
- 5,979
6
votes
2
answers
1k
views
Geometric explanation of Hutton's formula?
$$\frac{\pi}{4} = 2 \tan^{-1} \frac{1}{3} + \tan^{-1} \frac{1}{7} \;.$$
Is there some geometric construction that explains this beautiful equation
(known as Hutton's formula)?
Perhaps a "proof without ...
- 151k
6
votes
3
answers
3k
views
Dissecting a square
Edited - some comments may now be out-of-date.
I thought I had a complete set of solutions to this:
...
- 119
6
votes
3
answers
497
views
Polynomial threading through a monotone corridor
I have a need to find a polynomial of minimal degree that connects
two points and stays within a given
"corridor," by which I mean an $x$-monotone polygon.
Here is an example:
&...
- 151k
6
votes
3
answers
285
views
Finding a solution to a simple geometric set of equalities
Let $p_1,\dots,p_n$ be a collection of points in the plane $\mathbb{R}^2$ and let $a$ be a positive number such that $a<1$. Is there a good numerical algorithm to find points $x_1,\dots,x_n$ in ...
- 4,049
6
votes
1
answer
373
views
Symmetric black-hole curves
Is there a curve $C$ that connects $(0,1)$ to $(a,0)$ for some $a>0$, and, when reflected
to $C'$ in the $x$-axis, the shape $S=C \cup C'$ has the property that each horizontal
light ray entering $...
- 151k
6
votes
1
answer
2k
views
Continuous bijective way of representing a line on a plane
Is there a function $f(a,b)$ which maps ordered pairs to lines in a plane in a continuous, bijective manner?
Here is the definition I am using for the limit with lines: a sequence of lines $L(1), L(...
- 435
6
votes
1
answer
381
views
Who was Bickart?
The term "Bickart points" is often used for the foci of the Steiner circumellipse of a triangle. Who was Bickart, and what was the first publication to use the term?
- 3,443
6
votes
3
answers
311
views
A path in the unit square that "doubles back" on itself in a nice way
Given a path $P$ in the unit square, and two points $p_{1},p_{2}$
located on $P$, let $d_{P}(p_{1},p_{2})$ denote the distance from
$p_{1}$ to $p_{2}$ traversed along $P$. Given $a>1$, I am ...
- 4,049
6
votes
1
answer
767
views
Using mirrors to make a non-convex polygon visible from a fixed interior point
Take a point $A$ inside a non-convex polygon $P$. Is it always possible to place a finite set of mirrors given by straight segments (not necessarily along the boundary of $P$, any position inside $P$ ...
- 17.9k
6
votes
2
answers
400
views
Geometric dominating set: NP-complete?
Let $G=(V,E)$ be a geometric graph, a graph embedded in the plane whose edge lengths are
the Euclidean distance between its endpoint vertices.
Say that a set of vertices $D \subseteq V$ is a geometric ...
- 151k
6
votes
2
answers
822
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 "...
- 13.4k
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 ...
- 2,661
6
votes
2
answers
432
views
Geometric dissection theory
A few days ago, i realized that one way to prove the Pythagorean Theorem is to dissect the given right-angled triangle into 2 triangles similar to it, and apply well-known properties of ratios of ...
- 161
6
votes
2
answers
459
views
A (possibly boring) Voronoi Game
The board for this game is a compact convex region $\cal C$ of $\mathbb{R}^2$.
Below I illustrate with $\cal C$ an equilateral triangle.
Two players, $A$ and $B$, alternate turns.
At each turn they ...
- 151k
6
votes
1
answer
676
views
Does an origin-centered ellipse in the plane intersect each $L^p$-circle at most 8 times?
The question is in the title: Let $E$ be an origin-centered ellipse in ${\mathbb R}^2$ and let $S$ be an "$L^p$-circle": $S = \{(x,y) : |x|^p + |y|^p = \text{const}\}$, where $1 \leq p \leq \infty$. ...
- 6,694
6
votes
1
answer
311
views
Lemoine-Lozada circles
I made some rookie attempt to define the 4th Lemoine circle recently. The alternative name for this circle was suggested yesterday. Further investigation revealed a family of circles associated with ...
- 445
6
votes
1
answer
429
views
Bichromatic pencils
A pencil is a collection of some lines through a point, called the center of the pencil.
If the points of the plane are colored, then call a pencil bichromatic if there is a color that is present on ...
- 18.8k
6
votes
1
answer
715
views
Elementary problem about triangles inside a convex polygon
Let P be a convex polygon with area A(P), and to each side of P, attach the largest area triangle possible that lies entirely within P. Must the sum S(P) of the areas of these triangles always satisfy ...
- 1,318
6
votes
1
answer
435
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 ...
- 4,898
6
votes
1
answer
365
views
Like Bradley’s conjecture (Four incenters lie on a circle) [closed]
Please don't close this question. Because there is simple configuration with 57 vote up, and don't close. Why you vote up that question and You vote to close this question?
A problem I posed at here ...
- 1,776
6
votes
4
answers
691
views
Triangle angle bisectors, trisectors, quadrisectors, …
With the triangle
angle bisector theorem
and
Morley's trisector theorem
as background ,
are there any pretty theorems known for triangle $n$-sectors,
$n > 3$?
For example, angle quadrisectors?
The ...
- 151k
6
votes
2
answers
192
views
A non-Borel union of unit half-open squares
On the complex plane $\mathbb C$ consider the half-open square $$\square=\{z\in\mathbb C:0\le\Re(z)<1,\;0\le\Im(z)<1\}.$$
Observe that for every $z\in \mathbb C$ and $p\in\{0,1,2,3\}$ the set $...
- 41.8k
6
votes
2
answers
392
views
Solving for special rational triangles
I ran into a need for isosceles triangles that (1) have the two equal
integer side lengths $a$ (but the base $x \in \mathbb{R}$),
and (2) the apex angle $\gamma$ is a rational multiple of $\pi$.
&...
- 151k
6
votes
2
answers
207
views
On reflection properties of convex regions
It is well known that any ray of light passing thru a focus of an ellipse will pass thru the other focus after a single reflection from the ellipse boundary. If $A$ and $B$ are the foci of an ellipse, ...
- 5,979
6
votes
2
answers
515
views
On 'fair bisectors' of planar convex regions
Definitions (https://www.ias.ac.in/article/fulltext/pmsc/122/03/0459-0467):
Given a planar convex region $C$ (could be smooth or polygonal), an area bisector of $C$ is any line that partitions $C$ ...
- 5,979
6
votes
1
answer
295
views
Does any real projective plane incidence theorem follow from axioms?
Is it known whether any projective geometry statement that holds true in the real projective plane (equivalently, can be deduced from Hilbert axioms) follows from the standard projective axiomatics?
...
- 308
6
votes
1
answer
143
views
Minimizing the number of segments in drawings of planar graphs
Every planar graph has at most $3n-6$ edges, where $n$ is the number of vertices. Moreover, every planar graph can be drawn with straight-line edges in the plane, without crossings. For example, for ...
- 4,535
6
votes
2
answers
410
views
Existence of finite set of points in the revolving circles
Let $k$ and $n$ be two fixed integers. Let $C$ denotes the circle with radius $4n$ (in the plane $\mathbb{R}^2$). Suppose $\{C_1,C_2\}$ shows the set of two arbitrary tangent circles with radius $2n$ ...
- 4,784
6
votes
1
answer
127
views
Convex planar regions with all area bisectors having equal length
Following A claim on the concurrency of area bisectors of planar convex regions, let me record a couple of simple queries.
An area bisector (perimeter bisector) of a planar convex region is a chord ...
- 5,979
6
votes
1
answer
255
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
6
votes
1
answer
257
views
Constructing M-curves à la Hilbert
I have been reading some text about Harnack's theorem. The theorem basically says that for degree $d$, the maximal number of connected components in the real (projective) plane of a plane curve with ...
- 2,275
6
votes
1
answer
205
views
Hiding $k$ disks inside a larger disk
Suppose one has $k$ unit-radius disks, and the goal is to hide them inside
a disk of radius $R \gg k$.
The detection probes are rays along a line.
(Think of the disks as tumor cells, and the rays as ...
- 151k
6
votes
1
answer
273
views
Proof of a statement from Steele's "Probability theory and combinatorial optimization"
I am reading "Probability theory and combinatorial optimization" by J.M. Steele and am hung up on a statement made in Section 2.2 of Chapter 2, "Easy size bounds", in which it is stated (paraphrasing ...
6
votes
0
answers
98
views
Rigid plane curves
A curve is a continuous one-to-one image of the real line $\mathbb R$.
A space $X$ is rigid if the only homeomorphism of $X$ onto itself is the identity.
Is there a rigid curve in the plane?
I am ...
- 3,317
6
votes
0
answers
121
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 ...
6
votes
1
answer
300
views
Proof of Denjoy-Riesz Theorem and Moore's Generalization?
The Denjoy-Riesz Theorem states that any compact zero-dimensional subset of the plane can be covered by an arc, i.e. an embedded image of $[0,1]$. Sometimes it's stated just for covering a Cantor Set,...
- 439
6
votes
0
answers
320
views
Does this plane geometry theorem have a name (well-known)?
Consider three circles $(O_1)$, $(O_2)$, $(O_3)$. Denote the homothetic center of $\{$$(O_1)$, $(O_2)$$\}$ by $A$, the homothetic center of $\{$$(O_2)$, $(O_3)$$\}$ by $B$. Let $C$, $D$ be two points ...
- 1,776
6
votes
0
answers
164
views
Sets of points avoiding small angles
(1) $\mathbb{R}^2$.
I'd like to place $n$ points in the plane so that the smallest angle they
determine is as large as possible.
In a sense, such a point set is in very general position, not only
...
- 151k
6
votes
0
answers
274
views
An inequality in cyclic polygon and tangential polygon
I proposed my conjecture, it is strengthened version of the Erdős–Mordell inequality as following:
Let $A_1A_2.....A_n$ be a cyclic polygon and $B_1B_2....B_n$ be the its tangential polygon. Let $P$ ...
- 1,044
6
votes
0
answers
807
views
$ n $-Cats-in-a-Bed Problem: Picking $ n $ points in a given planar domain to maximize the sum of their pairwise distances
Let $ C $ be a connected and simply connected compact subset of the plane $ \mathbb{R}^{2} $. How can we pick $ n $ points, denoted $ x_{1},\ldots,x_{n} $, lying in $ C $ such that the total sum $ \...
- 71