All Questions
Tagged with mg.metric-geometry discrete-geometry
671 questions
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 ...
- 151k
4
votes
2
answers
294
views
Is there more than one pseudo-Catalan solid?
This question was asked on MSE a year ago. Motivation for this question can be found in other MSE questions here, here or here.
Convex solids can have all sorts of symmetries:
the platonic solids are ...
- 4,432
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
2
answers
94
views
Finding a not too slim triangulation with prescribed vertices on $\mathbb R^2$
Let us fix a constant $r>1$. Let $d(x,y)$ denote the distance between points $x,y\in \mathbb R^2$. Suppose we have a discreet subset $X\subset \mathbb R^2$ such that
1) For any two points $x,x'\...
- 14.3k
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
1
answer
258
views
The Mahler conjecture and non-zonoidal 3-polytopes (4-polytopes)
I have been working on the Mahler conjecture for over a year now and have made some progress for certain classes of convex polytopes and I'm now attempting to write up my results specified to $\mathbb{...
- 1,441
4
votes
2
answers
1k
views
Polyline averaging
I'm trying to find a method that can take a collection of polylines, each described by a list of connected points on a plane, and find an "average" path through them. The input lines do not loop.
...
- 51
4
votes
3
answers
1k
views
Number of Hyper-cube cuts
In how many ways a single hyperplane can cut a hypercube? Two "ways" are considered different, if the sets into which they divide vertices of the hypercube are different. So e.g. a line can cut 2-...
- 51
4
votes
2
answers
254
views
Does the edge-graph of a centrally symmetric polytope determine which vertices are antipodal?
Given two origin symmetric convex polytopes $P_1$ and $P_2$ (that is $P_i=-P_i$) with the same edge-graph, but potentially of different dimensions and combinatorial types.
Let $\phi: G_{P_1}\to G_{P_2}...
- 13.6k
4
votes
1
answer
142
views
On polyhedrons with specified numbers of congruent faces
Basic question: Given 3 integers n, n1 and n2 such that n1+n2 = n, to form an n-face polyhedron such that n1 of its faces are mutually congruent and the remaining n2 faces are different but congruent ...
- 5,979
4
votes
1
answer
242
views
Shadows and planar sections of polyhedra
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
4
votes
2
answers
341
views
Cutting convex regions into equal diameter and equal least width pieces - 2
This post is a spinoff from Cutting convex regions into equal diameter and equal least width pieces
Definitions: The diameter of a convex region is the greatest distance between any pair of points in ...
- 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
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 ...
- 1,776
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
333
views
n-simplex in an intersection of n balls
Consider any $n$-simplex, $n \geq 2$. For each edge $(i,j)$, consider $n$-ball $B_{ij}$ such that vertices $x_i$ and $x_j$ are antipodal on this ball. Fix a point $x_0$ in the simplex. The question: ...
- 195
4
votes
2
answers
287
views
Problems similar to Borsuk’s Theorem in the plane
Consider a 2-dimensional Borsuk's theorem:
Every bounded set $S$ in the plane can be partitioned into three parts with diameter smaller than the diameter of $S$.
I wonder if there are any results ...
- 181
4
votes
1
answer
203
views
Covering a convex body with its smaller homothetic copies
Given a convex body $C\subset R^d$ and a positive real $\lambda$, any set of the form $\lambda C + x = \{ \lambda c + x \mid c\in C \}$ for some $x\in R^d$ is called a homothetic copy of $C$. The ...
- 285
4
votes
1
answer
323
views
What properties does generalized Delaunay triangulation have?
Suppose that instead of the usual circle, we pick some other convex set D and make the Delaunay triangulation of a finite planar point set with respect to this set, i.e. connect two points if there is ...
- 19k
4
votes
1
answer
360
views
On Dehn's infinitesimal rigidity theorem
Dehn's theorem states that any simplicial strictly convex polyedron P in Euclidean 3-space is infinitesimally rigid (that is, any non-trivial first order deformation of P induces a variation of its ...
- 61
4
votes
2
answers
219
views
Algorithm for grouping tetrahedra from Voronoi diagram
I have a set of 3D Voronoi generator points and their neighbouring points, which, when connected, should result in a Delaunay tetrahedralization. However, I'm having a hard time implementing this. My ...
- 142
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
4
votes
1
answer
117
views
Given a polytope $P$ with bipartite edge-graph, if the bipartition classes are equal in size and lie on spheres, is $P$ inscribed?
Suppose that $P\subset\Bbb R^n, n\ge 3$ is a (full-dimensional) convex polytope with a bipartite edge-graph $G=(V_1\cup V_2,E)$ (for example, a zonotope). Suppose further that there are concentric ...
- 13.6k
4
votes
1
answer
215
views
On two centers of convex regions
Definition: A line segment with both end points on the boundary of a planar convex region $C$ is called a chord of $C$.
Consider any point $P$ within a given planar convex region $C$. From among all ...
- 5,979
4
votes
2
answers
207
views
Classification of symmetries of tilings in surfaces?
Is there a general study of the symmetries of tilings on surfaces?
Conway, Goodman-Strauss & Burgiel classified them on $\mathbb S^2, \mathbb R^2$ and $\mathbb H^2$, with their 'Magic Theorem'. ...
- 561
4
votes
1
answer
184
views
What are interesting 3-colorings of the plane without rainbow lines?
This question is about 3-colorings of the plane in which every line is bichromatic (or monochromatic), i.e., there are no three collinear points of different colors. Such colorings trivially exist, ...
- 19k
4
votes
2
answers
377
views
Isostatic graphs and the Henneberg conjecture
I have been reading "Combinatorial Rigidity" by Graver, Servatius and Servatius and I am interested in their chapter on rigidity in dimension $\geq$ 3. I have two questions.
What is the current ...
4
votes
2
answers
260
views
Discrete isoperimetric problems
It is well-known that among all planar curves, the circle — invariant under $O(2)$ — has the best isoperimetric ratio. Similarly, among all $n$-gons, the regular $n$-gon — invariant under the dihedral ...
- 511
4
votes
1
answer
108
views
Closed cobounded additive submonoid of $\mathbb{R}^n$
Let $M$ be a closed additive submonoid of $\mathbb{R}^n$ with $n\geq1$. Suppose also that there exists $r>0$ such that every ball of radius $r$ intersects $M$. I wonder if we can obtain more ...
- 143
4
votes
2
answers
162
views
Basic question about discrete minimal surfaces
Let $P$ be a convex polygon with $n > 3$ vertices $v_1, \ldots, v_n \in \mathbb{R}^2$, let $x$ be a point in the interior of $P$, and let $u$ be a function with prescribed values at the vertices of ...
- 133
4
votes
1
answer
377
views
Discrete gradient ascent cycles
I am wondering what can be inferred when a discrete
gradient ascent algorithm gets stuck in a cycle.
Here is the situation.
A function $f(x,y)$ is defined over a range $[0,n]^2$,
and the algorithm ...
- 151k
4
votes
1
answer
142
views
How many regular d-dimensional simplices of side length 1/2 are required to cover a regular d-dimensional simplex of side length 1?
For positive integers $n$ and $d$ satisfying $d = n-1$, let the $d$-dimensional regular simplex of side-length $\sqrt{2}$ be $X = \{(x_1, x_2, \cdots, x_n) \in \mathbb{R}^n: x_1+x_2+\cdots + x_n = 1, ...
- 333
4
votes
1
answer
293
views
Number of points in a lattice and an oblong box
I have a very simple question in geometry of numbers. (It is a slight modification of Counting points on the intersection of a box and a lattice .) There's a bound I can easily prove, and it's good ...
- 20.2k
4
votes
1
answer
124
views
Convex caps with prescribed edges and curvature
Let $G$ be the edge graph of a convex subdivision of a convex polygon $P$ in the plane. I would like to construct a convex polyhedral cap $C$ (with zero boundary values) over $P$ whose edges project ...
- 7,194
4
votes
1
answer
323
views
Blowing up spheres in a face centered cubic (fcc) packing geometry just enough to cover the volume of the lattice
Imagine I have an infinite lattice of spheres packed in a face centered cubic (fcc) lattice geometry which has the basis: $((-1, -1, 0), (1, -1, 0), (0, 1, -1))$. Here, provided that sphere-sphere ...
- 41
4
votes
1
answer
492
views
Generalization of the "double cap conjecture" to a vector space with complex field
The conjecture that I proposed in
Maximal set on hypersphere that does not contain pairs of orthogonal vectors
is in fact known as the "double cap conjecture", as noted by Guillaume Aubrun.
See for ...
- 1,207
4
votes
0
answers
66
views
Convergence of graph geodesics to geodesics on metric spaces
Let $(X,d)$ be a compact length space metric space $\mathbb{X}_{\delta}$ be a $\delta$-packing on $X$ and, for every $k\in \mathbb{N}_+$, let $G_{k,\delta}=(\mathbb{X}_{\delta},\mathcal{E}_k,W_k)$ ...
- 364
4
votes
0
answers
111
views
Advice on results for balls on regular $N$-dimensional grids
I have obtained some results regarding balls on regular $N$-dimensional grids. I would like expert opinion on wether the results are significant or interesting enough for (trying to) publish them in a ...
- 337
4
votes
0
answers
222
views
What does it mean "parallel"?
I am thinking on a strict definition of the notion of parallel affine sets in a linear space and came to the following
Definition 1: An affine set $A$ is parallel to an affine set $B$ in a linear ...
- 41.9k
4
votes
0
answers
114
views
Find at least one square-boxed subcontinuum
Recall that a plane continuum is a closed, bounded,
connected subset of the plane.
It is non-degenerate if it contains at least two points.
(We may sometimes just say "continuum" even if
we ...
- 1,375
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
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
54
views
On ways to measure the difference between two planar convex regions
This earlier post attempted to quantify the difference between a pair of planar convex regions of equal area and perimeter using Hausdorff distance:
On comparing planar convex regions of equal ...
- 5,979
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
0
answers
93
views
A variant of the Mondrian problem
Definition: The Mondrian problem consists of dissecting a square of side length n (an integer) into mutually non-congruent rectangles with integer length sides such that the difference d(n) between ...
- 5,979
4
votes
0
answers
246
views
Distance properties of the permutations of a set of points in a Euclidean space
We are given a set of $n$ distinct points $S=\{\mathbf{x}_1, \mathbf{x}_2, \ldots, \mathbf{x}_n\}$ in a Euclidean space $\mathbb{R}^d$, where the distance between two points $\mathbf{x}_i,\mathbf{x}_j\...
- 1,677
4
votes
0
answers
114
views
Can we combine the symmetries of two polytopes to create a more symmetric polytope?
Suppose that there are two combinatorially equivalent (convex) polytopes $P_1,P_2\subset\Bbb R^d$, that is, both with the same face lattice $\mathcal L$.
The symmetry group $\mathrm{Aut}(P_i)\subset\...
- 13.6k
4
votes
0
answers
81
views
Number of orders of distances between points on a line
Points $a_1, a_2, \dots, a_n$ on a line form a set from $n(n-1)/2$ distances between them. Suppose all that distances are different, numerating them from the shortest to the longest one we obtain some ...
- 1,431
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
0
answers
49
views
Equiangular lines with symmetry requirements
Listing all possible arrangements of equiangular lines is non-trivial.
Does the problem become any easier when we additionally require that the symmetry group of that line arrangement acts ...
- 13.6k