Skip to main content
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
Results tagged with
Search options questions only not deleted user 4556

A branch of geometry dealing with convex sets and functions. Polytopes, convex bodies, discrete geometry, linear programming, antimatroids, ...

19 votes
3 answers
2k views

Cutting convex sets

Any bounded convex set of the Euclidean plane can be cut into two convex pieces of equal area and circumference. Can one cut every bounded convex set of the Euclidean plane into an arbitrary number $ …
Roland Bacher's user avatar
10 votes
1 answer
2k views

Equations for an algebraic gömböc

A gömböc is a $3$-dimensional convex body (having uniform density) which has exactly one stable and one instable equilbrium position (see https://en.wikipedia.org/wiki/G%C3%B6mb%C3%B6c). Such a convex …
Roland Bacher's user avatar
4 votes
1 answer
209 views

Diameter of a metric on orbits under affine bijections of $n-$dimensional convex compact sets

Given two $n-$dimensional convex compact sets $A,B$, we define $d(A,B)$ as $\log({\mathrm{Vol}}(\alpha_2(A)))-\log(\mathrm{Vol}(\alpha_1(A)))$ where $\alpha_1,\alpha_2$ are two affine bijections such …
Roland Bacher's user avatar
3 votes
0 answers
234 views

Maximum of a function on $d-$dimensional convex compact sets

Let $\mathcal C_d$ denote the set of all $d-$dimensional convex compact subsets with barycenter at the origin of the $d$-dimensional Euclidean space $\mathbb E^d$. Given an element $C\in\mathcal C_d$ …
Roland Bacher's user avatar
3 votes
1 answer
255 views

Realisation of convex polygons with an interior point from combinatorial data

A convex polygon $P$ having an interior point $A$ in generic position (not on any line defined by two vertices) can be encoded combinatorially by associating to every vertex $v$ of $P$ the unique edge …
Roland Bacher's user avatar