All Questions
Tagged with mg.metric-geometry discrete-geometry
671 questions
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
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
0
answers
117
views
Folding polygons into 'vessels'
This question is based on http://www.science.smith.edu/~jorourke/Papers/FoldingPP.pdf
Define an vessel as a convex polyhedron with one face removed - in other words, a vessel can be converted into a ...
- 5,979
2
votes
0
answers
125
views
Bound on covering number for overparametrized manifold
I am trying to wrap my head around the following problem:
I have $p$ real parameters $\boldsymbol{\theta} \in \Theta = [0, 2\pi)^p$ that parametrize functions $f(\boldsymbol{\theta}) \in f(\Theta)$ ...
2
votes
0
answers
131
views
Cutting polygons into mutually similar and non-congruent pieces
It is well-known that a square can be cut into a finite number of squares all of mutually different sides (hence mutually non-congruent) - for example, see https://en.wikipedia.org/wiki/...
- 5,979
2
votes
0
answers
131
views
Maximum number of regions in a disk partitioned by pairs of parallel chords
We are given a disk $D$ in $\mathbb{R}^2$. Let $C$ be its boundary (i.e., the circle bounding $D$ on its plane). Let $P(n,d)$ be a set of $n$ pairs of chords of $C$ such that for each $\{c,c'\}\in P(n,...
- 1,677
2
votes
0
answers
131
views
Optimal way to group points in the plane into clusters
Consider a strictly decreasing sequence $d = (d_k)_{k\ge 1}$ of distances in $(0,1)$. Given a constant $C>2$, we say that $d$ has the $C$-grouping property if any finite non-empty subset $S$ (of ...
- 1,761
2
votes
0
answers
221
views
Maximizing distance between points on the positive surface of the unit hyper-sphere
Suppose we want to place $k$ ($k \geq 3$) points on the positive surface of a unit hyper-sphere in $\mathbb{R}^n$ ($n \geq 3$), where all coordinates of a point are positive, such that the minimum ...
- 21
2
votes
0
answers
103
views
Polytopes with large dihedral angles
The regular $d$-simplex has dihedral angle $\arccos(1/d)<90^\circ$, and the $d$-cube has dihedral angle exactly $90^\circ$.
The maximal dihedral angle of a prism over a $(d-1)$-simplex is also $90^\...
- 13.6k
2
votes
0
answers
246
views
Recover unknown vectors with dot-product queries
Suppose there are $n$ unknown unit vectors in $\mathbb{R}^d$,
$V=\{v_1,\ldots,v_n\}$, no two identical.
Your task is to determine the vectors in $V$.
The only tool at your disposal is to query a ...
- 151k
2
votes
0
answers
69
views
Polygons such that $n^2 $ times magnification of a polygon could be covered by exactly $n^2$ original polygon
While studying about covering problems in combinatorics, I got to a simple question:
What polygons can be covered exactly, without any area that is covered twice or area that is outside the covered ...
- 103
2
votes
0
answers
98
views
8-partition of a planar convex body by 4 concurrent lines
It is known1 that any convex body $K$ in the plane can be
partitioned into $6$ equal-area pieces by $3$ concurrent lines
which meet at a point in $K$.
Call this a $6$-partition.
This result cannot be ...
- 151k
2
votes
0
answers
415
views
Find the intersection between two convex hulls, in this specific case
We work over $\mathbb{R}^K$. Let $V$ be the set of vectors whose coordinates take values $0$ or $1$, or equivalently the corners of the unit cube $[0,1]^K$.
Let $d:\{0, \ldots, K\} \to \mathbb{R}_+$ ...
- 233
2
votes
0
answers
2k
views
Find m most distant points from a set of n points [closed]
I would like to find the $m$ (where $n$ $\geq$ $m$ > 1) maximally distant subset of points from a collection of $n$ $d$-dimensional points. Maximally distant means the sum of the pairwise distances ...
- 29
2
votes
0
answers
112
views
What is the projective dual of a planar graph?
Everybody learns the usual definition of the dual of a planar graph when edges are preserved and faces are mapped to vertices. Everybody learns the projective duality. What if we apply it to a ...
- 19k
2
votes
0
answers
586
views
Partitioning the Projective Plane
Throughout this post, by projective plane I mean the set of all lines through the origin in $\mathbb{R}^3$.
Side Note: If there are more standard definitions for any of the ideas presented here, ...
- 761
2
votes
0
answers
261
views
Existence of partitions of $S^{n-1}$ with hypercubes
For which value of the integer $n$ does there exist a partition of $S^{n-1}$, the unit sphere of $\mathbb{R}^n$ for the euclidean norm, by a family of images of the standard hypercube $C=\{ (e_1, ..., ...
2
votes
1
answer
504
views
Partitioning polygons into acute isosceles triangles
Question: Given an $N$-vertex polygon (not necessarily convex). It is to be cut into the least number of acute isosceles triangles.
Based on this MathSE discussion, one can think of a method to get $\...
- 5,979
1
vote
3
answers
146
views
On packing axisymmetric bodies in 3D
Consider any 3D body with an axis of rotational symmetry (e.g. cone, cylinder...) and packing the 3d space efficiently with infinitely many copies of this body. Is the following claim valid?
Claim: ...
- 5,979
1
vote
2
answers
329
views
Can a set of tetrahedra glued together by a common vertex be isometrically embedded in R^4?
A collection of triangles with a common vertex $A_1VA_2$, $A_2VA_3$, ... $A_NVA_1$ with specified side lengths can be isometrically embedded in $R^2$ provided the angles around $V$ add up to $2\pi$. ...
- 221
1
vote
3
answers
535
views
Isometric imbedding of finite metric space into standards spaces [duplicate]
Is it true that any metric space consisting of $n$ points can be isometrically imbedded into $n-1$ dimensional Euclidean space? Hyperbolic space?
(For $n=3$ this is true.) If not, what are necessary/...
- 21.8k
1
vote
2
answers
130
views
On convex planar regions that can be cut into only a specified number of mutually congruent and connected pieces
References:
https://math.stackexchange.com/questions/1838617/dividing-an-equilateral-triangle-into-n-equal-possibly-non-connected-parts
On congruent partitions of planar regions
https://research....
- 5,979
1
vote
2
answers
227
views
A question about dense sets
Suppose that $A$ is a given subset of $I=[0,1],\ $ and
$ \left\{ x_j = \frac{j}{m} \right\}_{j=0}^{m}\ $ is the $m$-partition of $I$, and $\nu(m)$ is the number of
$\ [x_{i-1},x_{i}]\ $ such that $\ [...
- 419
1
vote
1
answer
230
views
A possible characterization of the cube?
Let $P$ be the $1$-skeleton of a convex polyhedron fixed in $\mathbb{R}^3$,
and $|P|$ the sum of the Euclidean lengths of the edges of $P$.
Let $P_1, P_2, P_3$ be the perpendicular projections of $P$
...
- 151k
1
vote
2
answers
1k
views
Is there always a parallelogram cross-section of parallelepiped contained in the smallest box
Let $M$ be a centered parallelepiped, the intersection of $M$ and any plane $P$ that passes through the origin is a parallelogram or hexagon. Each parallelogram or hexagon has a cubic box that is the ...
1
vote
1
answer
208
views
On a possible variant of Monsky's theorem
See Wikipedia for Monsky's theorem which states: it is not possible to dissect a square into an odd number of triangles all of equal area.
Questions: Are there quadrilaterals that allow partition into ...
- 5,979
1
vote
3
answers
229
views
Repeatedly halve and twist a planar shape: Limiting shape?
Consider the following iterative process.
Start with a planar region $R=R_0$ of $\mathbb{R}^2$.
I am thinking of $R$ as connected,
but it may become disconnected.
In the example below, $R$ starts as ...
- 151k
1
vote
1
answer
176
views
Helly's number from biconvex functions
Helly's Theorem states the following. Suppose $X_1,X_2,...,X_N$ are convex sets in $\mathbb{R}^d$, such that for any index-set $I$ with $|I| \leq h(d) := d+1$, we have $\bigcap_{i \in I} X_i \neq \...
- 135
1
vote
1
answer
3k
views
Covering an arbitrary polygon with minimum number of squares
I have a problem whereby, given an arbitrary polygon with any number of points, I need to cover the whole area by a number of fixed size squares. I can easily find a set of squares which covers the ...
- 51
1
vote
1
answer
322
views
Settling a circular argument: room for one more?
By using a regular hexagonal arrangement it is simple to fit 19 identical circles into a larger circle of five times the radius with no circles overlapping. This leaves an area equal to six smaller ...
- 13
1
vote
1
answer
144
views
On convex polygons contained in convex polygons
In what follows '$n$-gon' stands for '$n$-vertex polygonal region'.
Question: Given a convex $n$-gon $C$, find the smallest convex region $R$ such that $C$ is the smallest $n$-gon that contains it.
...
- 5,979
1
vote
2
answers
232
views
What does the extension theorem for tilings state?
I have seen several references to the so-called Extension Theorem in the context of tilings of Euclidean space.
E.g. in "The Local Theorem for Monotypic Tilings" one reads
The Extension Theorem [......
- 13.6k
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
1
answer
648
views
How do I find the correct distance spacing for distributing equidistant points on a sphere of a given diameter?
How do I find the correct distance spacing for distributing equidistant points on a sphere of a given diameter?
I don't need to fill the sphere with equidistant points. I just need less than a ...
- 11
1
vote
1
answer
57
views
Maximum crossings of curvature-constrained curve
Let $C$ be a curve in the plane whose curvature is everywhere $\le 1$.
If $C$ has length $L$, what is the largest number of proper self-crossings
of $C$ as a function of $L$?
For example, the curve ...
- 151k
1
vote
1
answer
524
views
How to compute the number of regular spheres needed to fill a rectangular space
Computing the volume of a sphere is straightforward 4/3*pi*R^3
As is the volume of a rectangular space length*width*height (e.g. 10*10*6)
How might I go about determining how many spheres would fit ...
- 111
1
vote
1
answer
134
views
An algorithm to arrange max number of copies of a polygon around and touching another polygon
A related post: To place copies of a planar convex region such that number of 'contacts' among them is maximized
Basic question: Given two convex polygonal regions P and Q, to arrange the max ...
- 5,979
1
vote
1
answer
98
views
To place copies of a planar convex region such that number of 'contacts' among them is maximized
A contact between two planar convex regions obviously happens either along a line segment or at a single point.
Question: Given a planar convex region $C$ and a number $n$, we need to lay out $n$ ...
- 5,979
1
vote
1
answer
61
views
On largest convex m-gons contained in a given convex n-gon where m < n
This post is the inside-out variant of On smallest convex m-gons that contain a given n-gon where m<n
Given a convex n-gon region P, and an m less than n, how to find the max area convex m-gon Q ...
- 5,979
1
vote
1
answer
75
views
When do the centers of mass of a uniform convex planar region as a whole and of its boundary alone coincide?
Given a uniform planar convex region C, let us consider 2 centers of mass - the center of mass of the region as a whole and the center of mass of its boundary alone (assuming its boundary to have ...
- 5,979
1
vote
1
answer
221
views
What properties are preserved by quasi-isometries
Recently, I came across the notion of quasi-isometries, while thinking of "discrete spaces which are surrogates for approximate continuous ones".
What (metric)/geometric properties are ...
- 5,405
1
vote
1
answer
164
views
Partitioning convex polygons into quadrilaterals of equal area and perimeter
This post records a little bit more on this question: Partitioning convex polygons into triangles of equal area and perimeter.
The basic question of the above linked post was about this claim: "&...
- 5,979
1
vote
2
answers
196
views
Partitioning unit square with equal frequency rectangles
If I had to partition the unit square $[0,1]\times[0,1]$ into $k^2$ rectangles such that the sum of their diagonals is minimum possible, I would simply choose the $k \times k$ grid of squares. Now ...
- 153
1
vote
1
answer
113
views
Folding a non-rectangular shape into a rectangle of uniform thickness
I think the following might be an interesting subproblem of this question:
Question: For an odd number $n\ge 3$, is there a non-rectangular but still convex shape of area $A=1$, that can be folded (...
- 13.6k
1
vote
1
answer
209
views
Is a polytope with vertices on a sphere and all edges of same length already rigid?
Let's say $P\subset\Bbb R^d$ is some convex polytope with the following two properties:
all vertices are on a common sphere.
all edges are of the same length.
I suspect that such a polytope is ...
- 13.6k
1
vote
1
answer
228
views
Constant hole density on the area of a circle
I need to create about 100 (small) holes in a distributor plate (hole diam = 0.5 mm; plate diameter = 100 mm). The sm. holes should be distributed in such a way that the density (hole/area) is nearly ...
- 13
1
vote
1
answer
68
views
To maximize the volume of the polyhedron resulting from perimeter-halvings of a convex polygonal region
We add one more bit to Forming paper bags that can 'trap' 3D regions of max surface area (note: some possibly open related questions are also in the comments following the answer to above ...
- 5,979
1
vote
1
answer
78
views
To optimally wrap convex laminae with paper
Ref: On folding a polygonal sheet, Multi-layered wrapping of polyhedra
Basic intent: to wrap a given convex planar lamina with a convex sheet of non-stretchable paper (such that every point on both ...
- 5,979
1
vote
1
answer
127
views
Smallest trapeziums containing a given convex n-gon
Question: Given a planar convex $n$-gon $C$, to find the smallest area / smallest perimeter trapezium (trapezoid) - a convex quadrilateral with at least one pair of mutually parallel edges - that ...
- 5,979