Related papers: Finding Closed Quasigeodesics on Convex Polyhedra

We prove that each lower-dimensional face of a quasi-arithmetic Coxeter polytope, which happens to be itself a Coxeter polytope, is also quasi-arithmetic. We also provide a sufficient condition for a codimension $1$ face to be actually…

We study properties of Sobolev-type metrics on the space of immersed plane curves. We show that the geodesic equation for Sobolev-type metrics with constant coefficients of order 2 and higher is globally well-posed for smooth initial data…

In 2012 Driemel et al. \cite{DBLP:journals/dcg/DriemelHW12} introduced the concept of $c$-packed curves as a realistic input model. In the case when $c$ is a constant they gave a near linear time $(1+\varepsilon)$-approximation algorithm…

We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple (non-overlapping), planar polygon: cut along…

We consider Calderon's inverse problem with partial data in dimensions $n \geq 3$. If the inaccessible part of the boundary satisfies a (conformal) flatness condition in one direction, we show that this problem reduces to the invertibility…

A convex polygon $Q$ is inscribed in a convex polygon $P$ if every side of $P$ contains at least one vertex of $Q$. We present algorithms for finding a minimum area and a minimum perimeter convex polygon inscribed in any given convex…

We study a polyhedron with $n$ vertices of fixed volume having minimum surface area. Completing the proof of Fejes Toth, we show that all faces of a minimum polyhedron are triangles, and further prove that a minimum polyhedron does not…

We define a notion of a rotund quasi-uniform space and describe a new direct construction of a (right-continuous) quasi-pseudometric on a (rotund) quasi-uniform space. This new construction allows to give alternative proofs of several…

Let $M$ be a volume finite non-compact complete hyperbolic $n$-manifold with totally geodesic boundary. We show that there exists a polyhedral decomposition of $M$ such that each cell is either an ideal polyhedron or a partially truncated…

Pogorelov's rigidity theorem states that a compact convex body in the hyperbolic 3-space is determined up to isometry by the intrinsic path metric on its boundary. The main result of this paper addresses a rigidity problem for non-compact…

We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum…

A hypersurface is said to be quasihomogeneous if in suitable coordinates with assigned weights, its equation becomes weighted homogeneous in its variables. For an irreducible quasihomogeneous plane curve, the equation necessarily becomes a…

Let an orthogonal polyhedron be the union of a finite set of boxes in $\mathbb R^3$ (i.e., cuboids with edges parallel to the coordinate axes), whose surface is a connected 2-manifold. We study the NP-complete problem of guarding a…

A common approach to compute distances on continuous surfaces is by considering a discretized polygonal mesh approximating the surface and estimating distances on the polygon. We show that exact geodesic distances restricted to the polygon…

We show that a set of $n$ algebraic plane curves of constant maximum degree can be cut into $O(n^{3/2}\operatorname{polylog} n)$ Jordan arcs, so that each pair of arcs intersect at most once, i.e., they form a collection of pseudo-segments.…

We revisit a standard polygon containment problem: given a convex $k$-gon $P$ and a convex $n$-gon $Q$ in the plane, find a placement of $P$ inside $Q$ under translation and rotation (if it exists), or more generally, find the largest copy…

A quasislit is the image of a vertical line segment [0, iy], y > 0, under a quasiconformal homeomorphism of the upper half-plane fixing infinity. Quasislits correspond precisely to curves generated by the Loewner equation with a driving…

Solving the so-called geodesic endpoint problem, i.e., finding a geodesic that connects two given points on a manifold, is at the basis of virtually all data processing operations, including averaging, clustering, interpolation and…

We present an improved algorithm for {\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \log t$…

A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the property that the faces of a zonohedron are…