All Questions
Tagged with mg.metric-geometry discrete-geometry
188 questions with no upvoted or accepted answers
3
votes
0
answers
169
views
Computing Voronoi poles in $\mathbb{R}^d$ (the farthest points within each cell)
Say I have a Voronoi diagram of some points $p_1,\dots,p_n\in\mathbb{R}^d$, which tesselates $\mathbb{R}^d$ into cells $V_1,\dots,V_n$. Within each cell $V_i$, the pole is defined as the vertex of $...
- 41
3
votes
0
answers
122
views
A taut string of equilateral triangles
Let $T$ be a unit edge-length equilateral triangle composed of three cylinders each
of (small) radius $r>0$. (By "small" I mean approximately $< 0.1$.)
Think of $T$ as a physical, rigid triangle,...
- 151k
3
votes
0
answers
135
views
Lattices achieving best density
Let $\Lambda \subset \mathbb{R}^n$ be an Euclidean lattice with generator matrix $B$. Define the center density $\delta(\Lambda)$ in the usual way as $\delta(\Lambda) = \rho^n/|\det{B}|$, where $\rho$ ...
- 800
2
votes
0
answers
63
views
Convex planar regions such that every boundary point has a 'fair bisector' passing thru it
We add a little to On 'fair bisectors' of planar convex regions and A claim on the concurrency of area bisectors of planar convex regions .
A fair bisector of a planar convex region is a line ...
- 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
0
answers
105
views
Minimum number of points on sphere which cannot be covered by three double caps
What is the minimum number of points on the sphere $S^d \subset \mathbb{R}^{d+1}$ which cannot be covered by $d+1$ double caps? A double cap is defined to be a set $\{x \in S^d: |\langle x,a \rangle| &...
2
votes
0
answers
114
views
More on shadows of 3D convex bodies
Ref: Shadows and planar sections of polyhedra
By shadow we mean the orthogonal projection of a convex 3D body C onto a 2D plane, for example, the shadow on the xy-plane, with C above (z>0) that ...
- 5,979
2
votes
0
answers
73
views
Is parquetability decidable?
Let $T\neq \emptyset$ be a finite subset of $\mathbb{Z}\times\mathbb{Z}$. We say that $\mathbb{Z}^2 = \mathbb{Z}\times\mathbb{Z}$ is parquettable by $T$ if there is a partition $\frak P$ of $\mathbb{Z}...
- 48.9k
2
votes
0
answers
233
views
Do you know this formula for the scalar product in barycentric coordinates?
I've found a formula for a scalar product in barycentric coordinates which I think is pretty cool. I hope that it's new. Is it?
Suppose that you have points $x_1,\dots,x_n$ sitting in general position ...
- 1,048
2
votes
0
answers
154
views
Reduced Voronoi diagram
I am currently reading Differentiable Surface Triangulation presented at Siggraph Asia 2021.
I think most of the paper is clear to me, though I keep re-reading through to see if I miss details.
The ...
- 115
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
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
0
answers
68
views
Name of the perspector of the orthic triangle and excentral triangle
The orthic triangle and tangential triangles of a given triangle are in perspective. What's the official kimberling center associated with this perspector?
- 1,109
1
vote
0
answers
67
views
Conjecture on the increasing efficiency of the shortest minimum-link polygonal chains covering any grids of the form $\{0,1,2\}^k$ as $k$ grows
From the well-known Nine dots problem, we know that we need a polygonal chain with at least $4$ edges to connect the $9$ points of the planar grid $G_{3,2}:=\{\{0, 1, 2\} \times \{0, 1, 2\}\} \subset \...
- 1,451
1
vote
0
answers
42
views
On a pair of solids with both corresponding maximal planar sections and shadows having equal area
This post pulls together Are two convex solids with all corresponding shadows equal in area congruent? and
What can be said about 2 convex solids with corresponding maximal planar sections having ...
- 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
1
vote
0
answers
44
views
On area bisectors and perimeter bisectors of planar convex regions
We try to proceed from A claim on the concurrency of area bisectors of planar convex regions
Definitions: Given a planar convex region C, an area bisector of C is any line segment that partitions C ...
- 5,979
1
vote
0
answers
52
views
'Self-similar and perfect' partitions of planar regions
Definition: A partition of a planar figure into finitely many pieces that are all similar to itself and also mutually non-congruent may be called a self-similar perfect partition.
A classical example ...
- 5,979
1
vote
0
answers
100
views
Perfect 'cuboiding' of cubes and cuboids
We try to add a bit to ref 2 listed below. In this post, by 'cuboid', we mean only rectangular cuboids - hexahedra with all faces rectangles and adjacent faces meeting only at right angles. A special ...
- 5,979
1
vote
0
answers
40
views
Polyhedra inscribed in a sphere with mutually non-congruent, equal area faces
Two constrained versions of the main question given in this post: Polyhedrons with mutually non-congruent faces, all of equal area. An earlier post that could be related: Cutting a spherical surface ...
- 5,979
1
vote
0
answers
91
views
A claim on the largest area circular segment that can be drawn inside a planar convex region
This post adds a little to To find the longest circular arc that can lie inside a given convex polygon
A circular segment is formed by a chord of a circle and the line segment connecting its endpoints....
- 5,979
1
vote
0
answers
109
views
Which polygons allow partition into rational triangles?
A triangle with all side lengths rational is said to be a rational triangle. It is known - for example, Cutting the unit square into pieces with rational length sides - that the unit square allows ...
- 5,979
1
vote
0
answers
53
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 ...
- 5,979
1
vote
0
answers
72
views
Intercept theorem in $\mathbb R^n$
The celebrated intercept theorem(also known as Thales's theorem) provides the ratios between the line segments created when two parallel lines are intercepted by two intersecting lines.
I'm looking ...
- 193
1
vote
0
answers
52
views
On families of lines that cut the boundary of a planar convex region in a specified ratio
We proceed from A claim on the concurrency of area bisectors of planar convex regions
This question is somewhat broad.
Background: 'Mathematical Omnibus' by Fuchs and Tabachnikov, Lecture 11 describes ...
- 5,979
1
vote
0
answers
57
views
Inside-out dissections of solids
We add to Inside-out dissections of polygons - a generalization. The inside-out (fully inside-out) dissections are defined on pages linked there.
How does one inside-out dissect a tetrahedron into ...
- 5,979
1
vote
0
answers
41
views
About the number of faces of the conification of a polytope
Let $P\subset\mathbb{R}^n$ be a polytope of dimension $(n-1)$ such that the origin $\vec{0}\not\in\text{Aff}(P)$, where $\text{Aff}(P)$ denotes the affine hull of $P$ in $\mathbb{R}^n$. Now, we ...
- 131
1
vote
0
answers
69
views
Least number of squares of size N that a set of R rectangles can occupy
Given a set $R$ of rectangles of different positive integer sizes, and any number of squares of the same size $N\in\mathbb{N}$, what's the least number of squares $C$ that all the rectangles together ...
- 119
1
vote
0
answers
46
views
Kissing behavior of planar regions
This post reworks a question that was stated in a slightly different form at Convex region $C$ with least kissing number of copies of $C$.
Background: Given a 2D region $C$ (not necessarily convex), ...
- 5,979
1
vote
0
answers
38
views
Possible extensions of the perpendicular axes theorem for moment of inertia
This post continues on Moment of inertia from Bisectors and partitioning lines for convex regions defined with respect to the moment of inertia.
The perpendicular axis theorem states that the moment ...
- 5,979
1
vote
0
answers
77
views
Lattice packing
Let $\Lambda$ be a lattice in $R^n$ and $R>0$ a real number.
Consider the number $N$ of points in $\Lambda$ of norm less than $R$. Let $R$ goes to infinity. What can be said about the asymptotic ...
- 237
1
vote
0
answers
100
views
All 3-dimensional symmetric reflexive polytopes
$\DeclareMathOperator\Conv{Conv}$I am finding all 3-dimensional symmetric reflexive polytopes. To do so, first, we know that all 2 dim symmetric reflexive polytopes are $X_3=\Conv((-1,-1),(1,0),(0,1))$...
- 21
1
vote
0
answers
48
views
Inside-out dissection
In a recent problem in The College Math Journal (1230) a Heronian triangle is called to have an equivalent rectangle if there exists an integer sided rectangle with the same area and perimeter. For ...
- 111
1
vote
0
answers
85
views
More on triangles inscribed in convex regions with one vertex fixed
We add a bit to On maximum perimeter triangles inscribed in convex regions with one vertex fixed. Let C be a convex planar region and P a point on its boundary.
Are there convex shapes C other than (...
- 5,979