All Questions
65 questions
10
votes
0
answers
1k
views
Interpolating points with minimum curvature constraint
I have $n$ points $p_i$ strictly interior to a rectangle $R$,
and I would like to connect them with a curve $C$ whose curvature is as low as possible.
Let $\kappa_\max(C)$ be the sharpest (largest ...
16
votes
1
answer
1k
views
Random polycube shapes
I am wondering if it is hopeless to obtain any firm results
on the following model of a "random polycube shape."
First, a polycube in $\mathbb{R}^3$
is a connected face-to-face gluing of unit cubes.
(...
7
votes
0
answers
187
views
distance distributions on a hypersphere?
Fix a real number $0\leq t\leq 1$ and an integer $n>1$. Let
$\mathbb{S}^{n-1}\subset\mathbb{R}^n$ denote the unit hypersphere. Define
$$d_N(n;t):=\max\sum_{i<j}\Vert P_i-P_j\Vert_2^t$$
where ...
6
votes
2
answers
424
views
A class of tilings with amazing visual qualities
For more examples please see my related question on MSE:
Interesting tiling with a lot of symmetrical shapes
This is achieved by rotation of square grid over itself by atan(3/4).
Resulting ...
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'. ...
3
votes
1
answer
191
views
Maximal $\pi/2$-separated subset of the sphere
A subset $A$ of a metric space is called $\varepsilon$-separated if
$$dist(x,y)> \varepsilon \mbox{ for all } x\ne y\in A.$$
(Notice that the inequality in my definition is strict.)
What is the ...
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 $...
1
vote
0
answers
70
views
Covering number of the range of a function
I have come across the need to know a bound on a certain curious quantity: the covering number of the range of a continuous function $f: D \rightarrow \mathbb{R}^n$, where $D \subseteq \mathbb{R}^m$. ...
8
votes
4
answers
530
views
Inside-out polygonal dissections
A dissection of a polygon $P$
is a partition of $P$ into a finite number of pieces, which can then be rearranged
(via planar translations and rotations) and joined (without overlap) to form a new ...
5
votes
0
answers
1k
views
N-balls covering n-balls
This question is a follow-on question from:
Covering a unit ball with balls half the radius
The questions are these:
Given an arbitrary dimension d, and a unit n-ball in d-dimensional Euclidean ...
4
votes
2
answers
1k
views
Sphere - Symmetry and Triangulation [closed]
The sphere is symmetric with respect to any rotation. However, it loses this property as soon as it is triangulated. Are there sequences of triangulations that possess particular large symmetry groups ...
2
votes
2
answers
284
views
Three questions concerning lattice points on sphere surfaces
Pardon my ignorance of this topic.
Q1.
In which dimensions $d$ is it the case that, for every natural number $n$,
there exists a sphere having exactly $n$ lattice points on it $(d{-}1)$-...
7
votes
3
answers
377
views
Expected minimum face angle of random convex polyhedron in $\mathbb{R}^3$
Let $P_n$ be a "random convex polyhedron" in $\mathbb{R}^3$ of $n$ vertices, where "random" could follow any one
of a number of models:
(1) the convex hull of $n$ points randomly and uniformly ...
8
votes
0
answers
358
views
Coloring toroidal polyhedra with convex faces?
Consider a toroidal polyhedron, which is a topological torus, in which all faces are planar, two faces meet in at most an edge, and adjacent faces are not coplanar. The Szilassi polyhedron has 7 non-...