Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
A branch of geometry dealing with convex sets and functions. Polytopes, convex bodies, discrete geometry, linear programming, antimatroids, ...
1
vote
Accepted
Parameterizing the space of convex quadrilaterals
Let $R\subseteq P$ be the region $\{(x,y)\in P:x>0,y>0, x+y>1\}$ and let $g:P\to R$ be continuous and bijective. Let $h(p_2, p_3, p_4; (x, y)) = p_3+(p_2-p_3)y + (p_4-p_3)x$. Note that $h: P^4 \to P$ …
1
vote
Check if a point is in the interior of the convex hull of some other points in high dimensio...
x is not in the interior of conv(P) iff there is an affine function $u(y) = a+ b\cdot y$ such that $u(x)\le 0$ and $u(p_i)\ge0$ for $i=0,\ldots,m$. If this problem has no feasible solution, then x is …
5
votes
Parallelotope fundamental domains of the n-torus
Instead of asking which unit-volume n-parallelotopes ($TC$, where $T\in SL_n(\mathbb{R})$, and $C=[0,1]^n$) tile $\mathbb{R}^n$ when translated by $\mathbb{Z}^n$, we can equivalently ask, which unit-d …
4
votes
Accepted
How to know if convex-hull of a set contains zero?
Like Emil noted in the comments, the question is equivalent to whether $0\in\mathrm{Conv}(\{\alpha\in\mathbb{Z}^d: \sum_{i=1}^{d}\alpha_i=0\}\setminus\{0\})$. To see that it is, note that it is the av …
2
votes
Approximating John's ellipsoid from uniform sampling of a centrally symmetric convex polyhedron
No, a fixed number of added vertices can change the John ellipsoid by an arbitrary amount when added to arbitrarily many already known vertices: consider a very thin regular n-gon prism centered about …
4
votes
Accepted
Measurement of "symmetry" of a convex body
The type of symmetry for which the simplex (not necessarily regular) is usually called "the least symmetric convex body" is the symmetry of reflection about a point (e.g. $x\mapsto-x$). There are a fe …
5
votes
Is there a midsphere theorem for 4-polytopes?
In the paper "Analogues of Steinitz's theorem about non-inscribable polytopes" by E. Schulte, which comes out of the collection "Intuitive Geometry" from 1987, the author seems to prove a negative res …
5
votes
Translative packing constant strictly larger than lattice packing constant
This is not an answer, but rather a documentation of a failed attempt to obtain an answer.
One problem for which we know there is a significant difference between unrestricted sets of translations an …
4
votes
Accepted
Extreme points and centroid
No, a line connecting a vertex to the centroid is not necessarily an area bisector. This follows easily from your observation that not every line through the centroid bisects area: take a line which g …
1
vote
Accepted
Relative interior and dense subsets
As noted in the comments, the case where $A\subseteq\mathbb{R}^2$ is the interior of the unit square and $B$ is a side of that square satisfies the assumptions posed, but in that case neither (1) nor …
16
votes
Accepted
(A question about)${}^3$ 3-dimensional convex bodies
A convex body $K\subset\mathbb{R}^n$ all of whose $(n-1)$-dimensional projections have the same $n-1$-content is known as a body of constant brightness, by analogy with bodies of constant width. The t …
11
votes
A convex curve inside the unit circle
This follows easily from the fact that the perimeter of a convex curve is in direct proportion with the mean width, and the width of the curve is in every direction smaller than the width of the circl …
1
vote
How to determine if two rational cones intersect?
The so-called separation property of convex cones tells you that $C_1$ and $C_2$ have disjoint interiors if and only if there is a hyperplane separating them. Namely, there exists $\mathbf{y}\in \math …
4
votes
How to find the minimum number of hyperplanes to define a convex hull?
There are two ways to represent convex polytopes: as the convex hull of its vertices, or as the intersection of the half-spaces whose boundaries contain the faces. If you store both of these represent …