All Questions
Tagged with mg.metric-geometry discrete-geometry
159 questions
7
votes
2
answers
393
views
Partitioning convex polygons into triangles of equal area and perimeter
This post is based on https://math.stackexchange.com/questions/2822589/dissect-square-into-triangles-of-same-perimeter, On a possible variant of Monsky's theorem and Cutting convex polygons into ...
- 5,979
7
votes
0
answers
162
views
Approximating any convex shape in $\mathbb{R}^d$ with a polytope having $\mathrm{poly}(d)$ facets
We denote by $V(A)$ the $d$-volume of any convex set $A$. Furthermore, given any two convex sets $A,B\in\mathbb{R}^d$, we denote by $V_{A,B}$ the $d$-volume of the symmetric difference $V\left(A \...
- 1,677
7
votes
3
answers
1k
views
How can we count lines in an n-x-n rectangular array?
Is there a formula for the number of lines that contain exactly two points through an n x n rectangular array of points?
- 79
6
votes
1
answer
513
views
The Universality Theorem by Mnev for uniform oriented matroids of rank 4 and higher
According to the Universality Theorem by Mnev (see below theorem 8.6.6 from [1]), for any open semialgebraic variety V there is a uniform oriented matroid of rank 3 whose realization space is stably ...
- 245
6
votes
2
answers
189
views
Finding the point within a convex n-gon that maximizes the least angle subtended there by an edge of the n-gon
For any point P in the interior of a convex polygon, the sum of the angles subtended by the edges of the polygon is obviously 2π.
Given a convex polygon, how does one algorithmically find the point (...
- 5,979
6
votes
2
answers
217
views
Untangling entwined rigid chains in 3-space
I am interested in exploring the degree of "tangledness"
of two rigid chains in space.
A polygonal chain is a simple (non-self-intersecting) path
of segments in
$\mathbb{R}^3$, viewed as a rigid body. ...
- 151k
6
votes
0
answers
219
views
How big a box can you wrap with a given polygon?
Question: Given a convex polygonal region, how does one find the box (rectangular parallelopiped) of maximum volume that can be wrapped with this region? While wrapping, if needed, some portions of ...
- 5,979
6
votes
2
answers
444
views
On planar sections of 3D convex bodies
Consider the space of planar sections of any given convex 3D body.
Basic Question: What is the lower bound for the ratio
$$\frac{\text{area of section of greatest perimeter}}
{\text{area of section of ...
- 5,979
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
1
answer
928
views
To find the Largest Regular n-gon contained in a given convex region
Given a general convex region C, to find the largest regular polygon that is contained in it (shared boundaries allowed). Basically, one needs to find that particular value of n for which a regular n-...
- 5,979
6
votes
1
answer
212
views
A polytope with congruent facets and an insphere that is not facet-transitive?
Is there a $d$-dimensional convex polytope (convex hull of finitely many points, not contained in a proper subspace), with $d\ge 4$ and the following properties?
All facets are congruent,
it has an ...
- 13.6k
5
votes
0
answers
214
views
Visibility in a prime orchard
This suggests a variant on Polya's orchard problem.
That problem asks1
for which radius $\epsilon$ of trees at each lattice point within a distance $R$ of the origin block all lines of sight to the ...
- 151k
5
votes
4
answers
540
views
How hard is it to determine if a weighted graph can be isometrically embedded in R^3?
Consider a graph $G$ with nonnegative edge weights.
Question: In $\mathbb{R}^3$, how hard is it to assign coordinates to vertices such that the Euclidean length of each edge is equal to its weight?
...
- 3,059
5
votes
0
answers
139
views
On convex regions containing (and contained within) a given triangle
Given an arbitrary triangle T.
How does one find the convex region C_M of largest area containing T such that T is also the largest area triangle that is contained within C_M?
Guess: for any T, ...
- 5,979
5
votes
1
answer
547
views
Cover of a n-simplex with balls
Consider a n-simplex. For each edge (i,j), consider a n-ball, such that vertices i and j are antipodal on this ball. Is the simplex covered by the union of these balls? Thank you.
- 195
5
votes
1
answer
383
views
cover and hide with squares
I am studying two numbers, related to squares, that can characterize a polygon P:
MinCoverNumber = the minimum number of axis-aligned squares required to exactly cover P (the covering squares may ...
- 3,549
5
votes
2
answers
441
views
Touching-tetrahedra graphs
Have the graphs representable by touching tetrahedra been explored?
Let $\cal T$ be a collection of tetrahedra in $\mathbb{R}^3$
with pairwise disjoint interiors.
Define a graph $G_{\cal T}$ to have ...
- 151k
5
votes
1
answer
246
views
Convex polyhedra with non-congruent faces
Question: Are there convex polyhedra wherein all faces are convex polygons with same area and perimeter and no two faces are mutually congruent?
Remarks: If the answer to above is "no", then,...
- 5,979
5
votes
0
answers
508
views
Longest simple path through hypercube corners
This is a variation on a previously answered question,
Longest path through hypercube corners.
Here I am seeking the longest simple (non-self-intersecting) path through
the unit hypercube's vertices,
...
- 151k
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,776
4
votes
0
answers
144
views
Approximation of a convex shape in the $d$-dimensional Euclidean space for $d\gg 1$
We are given a convex shape $C$ lying inside the hypercube $[0,1]^d$ in the $d$-dimensional Euclidean space. Let the volume of $C$ be $\tfrac12$ (I guess nothing changes for any other fixed constant ...
- 1,677
4
votes
0
answers
123
views
From a given triangle, to cut 2 mutually congruent convex pieces that together 'use' maximum area of the triangle
Two planar regions are congruent if one can be made to perfectly coincide with the other by translation, rotation or reflection (flipping over).
The Problem: Given a triangular region T, how will we cut ...
- 5,979
4
votes
2
answers
2k
views
Breaking a rectangle into smaller rectangles with small diagonals
Say I am given a rectangle with dimensions $a \times b$ and an integer $n$. I'd like to break this rectangle into $n$ smaller rectangles $R_i$, and I'd like to make the maximum diagonal of any of ...
- 4,049
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 ...
- 151k
4
votes
2
answers
312
views
Which convex pentagon gives least packing density?
Among all convex pentagons, does the regular pentagon give least packing density?
Further question: For each $n > 6$, is the regular $n$-gon the minimum of packing density?
An analogous question ...
- 5,979
4
votes
1
answer
363
views
Trade-off between hypervolume and diameter of $d$-dimensional shapes having a hypercubic smallest bounding box
Given any $d$-dimensional shape $X$, let $V(X)$ be its $d$-dimensional volume, and let $\ell(X)$ be the length of the longest line segment connecting two points of $X$.
Let $\mathcal{S}_C$ be the set ...
- 1,677
4
votes
0
answers
132
views
Can a polytopal graph be "centrally symmetric" in more than one way?
Let $P,Q$ be two centrally symmetric convex polytopes, potentially of different dimensions and combinatorial type, but with the same edge-graph $G$.
The central symmetry of $P$ induces an involutory ...
- 13.6k
4
votes
1
answer
438
views
Perfect squaring of rectangles
A perfect squaring of a rectangle may be defined as a partition of the rectangle into finitely many squares all of which are mutually non-congruent. https://en.wikipedia.org/wiki/Squaring_the_square ...
- 5,979
4
votes
1
answer
422
views
Can $n$ circles on a plane generate $m$ intersection points where at least $k$ circles intersect?
Can $n$ circles on a plane generate $m$ intersection points where at least $k$ circles intersect?
For $k = 2$ the answer is obvious since we can always place circles so that every one of them ...
- 63
4
votes
1
answer
303
views
On maximum perimeter triangles inscribed in convex regions with one vertex fixed
Ref: Convex curves with many inscribed triangles maximizing perimeter
Given a planar convex region C. Let P be a variable point on its boundary.
Observations: When C is an ellipse, the variation in ...
- 5,979
3
votes
0
answers
135
views
Intersecting the unit n-cube and (n-1)-planes
(Is this a known problem?)
Question Let $\ 1<n\in\mathbb N.\ $ What is the greatest $(n-1)$-area
$\ S(n)\ $ of $\ L\cap I^n\ $ where $\ I^n\subseteq\mathbb R^n\ $ is the unit cube, and $\ L\ $ ...
- 4,786
3
votes
1
answer
152
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 ...
- 5,979
3
votes
1
answer
197
views
Three-dimensional Apollonian spirals
Given mutually (externally) tangent spheres $S_1$, $S_2$, $S_3$, $S_4$, let $S_n$ be the unique sphere externally tangent to $S_{n-1}$, $S_{n-2}$, $S_{n-3}$, and $S_{n-4}$ for $n \geq 5$.
Let $P_{\...
- 19.7k
3
votes
1
answer
366
views
Illumination from visible lattice points with inverse square intensity
It is well known that the number of $\mathbb{Z}^2$ lattice points visible from
the origin is $6/\pi^2$, about $61$%.
See, e.g.,
What fraction of the integer lattice can be seen from the origin?.
I am ...
- 151k
3
votes
1
answer
373
views
Radial tilings with variable area ratios
I was looking at this neat page on logarithmic spiral tilings when a question popped up:
http://www.uwgb.edu/dutchs/symmetry/log-spir.htm
It seems that in all of the tilings shown, the area of each ...
- 93
3
votes
0
answers
98
views
Convex region $C$ with least kissing number of copies of $C$
Given a 2D convex region $C$, let us define its kissing number $K_0$ to be the largest possible number of copies of $C$ that can be arranged around a central copy of $C$ (call this $C_0$) and touching ...
- 5,979
3
votes
0
answers
214
views
Volume of intersection of a ball and cube with arbitrary position in $n$ dimension
Let $ A(n, r, x) = B^n_r(x) \cap [0,1]^n $ denote the intersection between an $n$ ball $B^n_r(x)$ with arbitrary radius $r$ and arbitrary center $x \in \mathbb{R}^n$ that intersects a unit $n$ cube $ [...
- 365
2
votes
0
answers
95
views
Is there an exact solution for the number of points within a circle of radius r for an honeycomb lattice?
I want to ask if exists an exact solution for the number of points within a circle of radius r for an honeycomb lattice.
I know that it is exist for an square lattice https://mathworld.wolfram.com/...
- 31
2
votes
1
answer
308
views
Intersection of the simplex with a linear subspace of codimension $2$
The sets are defined in $\mathbb{R}_+^n$ $(n\geq 1)$. The relative interior of a convex set $C$ is denoted $\mathring C$.
Let $S$ be the $n$-simplex:
$$S=\left\{x\in\mathbb{R}_+^n,\,\sum_{i=1}^n x_i=1\...
- 449
2
votes
1
answer
302
views
Are two convex solids with all corresponding shadows equal in area congruent?
By shadow we mean the orthogonal projection of a convex 3D body P onto a 2D plane, for example, the shadow on the xy-plane, with P above (z>0) that plane and the light at L=(0,0,+∞). P an be freely ...
- 5,979
2
votes
1
answer
101
views
Another lemma on intersections of $d$-simplices
Let $d\ge1$. A $d$-simplex $S$ is the convex hull in $\mathbb R^d$ of the vertices $v_0,\dots,v_d\in\mathbb R^d$ where $\{v_1-v_0,\dots,v_d-v_0\}$ is a linearly independent set of $d$ vectors; for ...
- 1,644
2
votes
1
answer
107
views
To find the convex planar region minimizing diameter when area and perimeter are given
The basic question is to find that planar convex region for which diameter is a minimum when area and perimeter are specified.
A partial answer is given here: http://nandacumar.blogspot.com/2012/11/...
- 5,979
2
votes
0
answers
84
views
Another variant of the Malfatti problem
We try to add to A Variant of the Malfatti Problem
As stated in the Wikipedia entry on Malfatti circles, it is an open problem to decide, given a number $n$ and any triangle, whether a greedy method ...
- 5,979
2
votes
1
answer
84
views
'Constrained morphing' of planar convex regions
Morphing may be defined as a continuous transition of one shape to another. This post is about modifying planar regions continuously from one form to another under some constraints.
Qn: If $C_1$ and $...
- 5,979
2
votes
1
answer
116
views
Convex polyhedra that can be folded from convex polygons
This question is based on http://www.science.smith.edu/~jorourke/Papers/FoldingPP.pdf.
Therein is stated the theorem: Every convex polygon folds to an infinite number (a continuum) of noncongruent ...
- 5,979
2
votes
1
answer
292
views
Facility location on manifolds
Facility location studies optimal placement of a certain number $n$ of points (facilities) in some region $R$. (https://en.wikipedia.org/wiki/Facility_location_problem)
The minimax facility location ...
- 5,979
2
votes
0
answers
71
views
On cutting convex regions with average values of quantities minimized
This post continues from Cutting convex regions into equal diameter and equal least width pieces - 2 and Cutting convex regions into equal diameter and equal least width pieces - 3
A basic (and to my ...
- 5,979
2
votes
1
answer
151
views
On congruent partitions of planar regions
Given any integer $n$, any rectangular region or any sector of a disc (including the full disk as a boundary case) can be cut into $n$ mutually congruent pieces - by equally spaced parallel lines and ...
- 5,979
1
vote
2
answers
153
views
Smallest triangles that contain 2D convex regions with reflection symmetry
Given any 2D convex region $C$ with a mirror symmetry. Two pairs of questions:
We need to find the smallest area (likewise, smallest perimeter) triangle that contains $C$. Is it sufficient to only ...
- 5,979
1
vote
0
answers
59
views
What can be said about 2 convex solids with corresponding maximal planar sections having equal area?
This post follows Are two convex solids with all corresponding shadows equal in area congruent?
Every convex 3D body has planar sections with normals in any given direction. We consider the maximum ...
- 5,979