Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
292 views

Existence of Simple Closed Straightest Geodesics

There are at least three distinct simple closed quasigeodesics on convex polyhedra [Mat. Sb. (N.S.), 1949, 25(67) :2, 275–306 Quasi-geodesic lines on a convex surface Pogorelov]. Is the same true ...
bjwbell's user avatar
  • 133
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
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
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)$-...
Joseph O'Rourke's user avatar
2 votes
1 answer
143 views

Triangles and convex hulls in high dimensions

Given a set $S_n$ of $n$ points $\mathbf{x}_1, \mathbf{x}_2, \ldots, \mathbf{x}_n\in\mathbb{R}^d$, such that every $(d+1)$-tuple in $S_n$ is affinely independent, and let $C(S_n)$ be the convex hull ...
Penelope Benenati's user avatar
2 votes
2 answers
163 views

References for geometric properties of optimal Euclidean traveling salesman tour

Consider a finite set of points $V \subseteq \mathbb{R}^2 $ as a TSP-instance under the standard $\| \cdot \|_2$ norm. (TSP stands for traveling salesman tour.) We know that every optimal TSP tour $T$ ...
mc.math's user avatar
  • 29
2 votes
2 answers
164 views

Angle between a point in a convex polytope and the nearest point of a face

Let $P \subset \mathbb{R}^d$ be a convex polytope, and let $F$ be a face of $P$ (of co-dimension 1, let's say). Now let $x \in P \setminus F$ and let $y \in F$ be the nearest point of $F$ to $x$. Then ...
paul's user avatar
  • 153
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 ...
Vladimir Zolotov's user avatar
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 [......
M. Winter's user avatar
  • 13.6k
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

1
2