Search Results

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 …

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$ …

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 …

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 …

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 $ …