Skip to main content

All Questions

14 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
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 ...
Joseph O'Rourke's user avatar
9 votes
0 answers
100 views

A characterization of root systems via their intersections with halfspaces

In a recent preprint I obtained a nice characterization of root systems as a side product. I can imagine that this was known before, and that a source for this statement can shorten the proof of my ...
M. Winter's user avatar
  • 13.6k
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-...
Leah Wrenn Berman's user avatar
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 ...
T. Amdeberhan's user avatar
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 ...
Rob Bird's user avatar
  • 151
4 votes
0 answers
153 views

Perimeters of nested convex spherical polygons

I seek a reference—not a proof—that if $P_1$ and $P_2$ are two convex polygons on a sphere composed of geodesic segments, contained in a hemisphere, and $P_1 \subseteq P_2$, then the ...
Joseph O'Rourke's user avatar
3 votes
0 answers
208 views

Reference request: Carathéodory-type theorem for convex hulls of closed sets

I'm looking for a reference for the following theorem. Theorem Let $X$ be a closed subset of $\mathbb{R}^N$, and let $a$ be a point of its convex hull $\operatorname{conv}(X)$. Then there exist ...
Tom Leinster's user avatar
  • 27.7k
3 votes
0 answers
93 views

Minkowski problem for polytopes: the origin of necessary condition

Minkowski's uniqueness theorem for polytopes concerns the specification of the shape of a polytope by the directions and measures of its facets. Theorem (Minkowski). Let $A_i$ be positive faces areas ...
Alexey Ustinov's user avatar
3 votes
0 answers
234 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 ...
Vladimir Zolotov's user avatar
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\ $ ...
Wlod AA's user avatar
  • 4,786
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 $...
Victor Tu's user avatar
1 vote
0 answers
69 views

Can sufficiently symmetric polytopes be uniquely reconstructed from their 1-skeleton?

General convex polytopes can not be uniquely reconstructed from their 1-skeleton1, as explained here. Not even the dimension is known from the skeleton, as e.g. the complete graph $K_n,n\ge 5$ is the ...
M. Winter's user avatar
  • 13.6k
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$. ...
Ankur's user avatar
  • 183
1 vote
0 answers
371 views

Simple development of simple curve on a cone

Let $\Lambda$ be a cone with apex $a$ and apex angle $\alpha$. Draw a simple (non-self-intersecting) curve $C=(x,y)$ on $\Lambda$, and then develop it to a curve $\overline{C}$ on a plane by rolling $...
Joseph O'Rourke's user avatar