Related papers: Minimum weight disk triangulations and fillings
Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…
We study the problem of computing the minimum area triangle that circumscribes a given $n$-sided convex polygon touching edge-to-edge. In other words, we compute the minimum area triangle that is the intersection of 3 half-planes out of $n$…
Given a triangulation of a closed, oriented, irreducible, atoroidal 3-manifold every oriented, incompressible surface may be isotoped into normal position relative to the triangulation. Such a normal oriented surface is then encoded by…
We provide the solution for a fundamental problem of geometric optimization by giving a complete characterization of worst-case optimal disk coverings of rectangles: For any $\lambda\geq 1$, the critical covering area $A^*(\lambda)$ is the…
For positive integers $n,d$, let $\lambda(n,d)$ be the minimal number of vertices of a triangulation of $n$-sphere which admits a degree $d$ simplicial map to the boundary of $(n+1)$-simplex. We show that…
We present a deterministic distributed $2$-approximation algorithm for the Minimum Weight Vertex Cover problem in the CONGEST model whose round complexity is $O(\log n \log \Delta / \log^2 \log \Delta)$. This improves over the currently…
This paper investigates a real-valued topological invariant of 3-manifolds called topological volume. For a given 3-manifold M it is defined as the smallest volume of the complement of a (possibly empty) hyperbolic link in M. Various…
Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomial- time heuristics that, for many instances, can find the exact MWT. Linear programs (LPs)…
Let $M$ be any compact four-dimensional PL-manifold with or without boundary (e.g. the four-dimensional sphere or ball). Consider the space $T(M)$ of all simplicial isomorphism classes of triangulations of $M$ endowed with the metric…
We study lower bounds for the number of vertices in a PL-triangulation of a given manifold $M$. While most of the previous estimates are based on the dimension and the connectivity of $M$, we show that further information can be extracted…
The minimum feature size of a crossing-free straight line drawing is the minimum distance between a vertex and a non-incident edge. This quantity measures the resolution needed to display a figure or the tool size needed to mill the figure.…
We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges (braces). We show that for any positive integer $b$ there is such an inductive…
We show that a jammed packing of disks with generic radii, in a generic container, is such that the minimal number of contacts occurs and there is only one dimension of equilibrium stresses. We also point out some connections to packings…
Given a set $P$ of $n$ points and a set $S$ of $m$ weighted disks in the plane, the disk coverage problem asks for a subset of disks of minimum total weight that cover all points of $P$. The problem is NP-hard. In this paper, we consider a…
Previous work of the authors with Bus Jaco determined a lower bound on the complexity of cusped hyperbolic 3-manifolds and showed that it is attained by the monodromy ideal triangulations of once-punctured torus bundles. This paper exhibits…
Suppose that $M$ is a compact, connected three-manifold with boundary. We show that if the universal cover has infinitely many boundary components then $M$ has an ideal triangulation which is essential: no edge can be homotoped into the…
We present a new self-contained proof of the well-known fact that the minimal area of a Voronoi cell in a unit circle packing is equal to $2\sqrt{3}$, and the minimum is achieved only on a perfect hexagon. The proof is short and, in our…
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variables. We show that the longest of these minimum-weight paths has…
We study numerically the dynamical triangulation formulation of two-dimensional quantum gravity using a restricted class of triangulation, so-called minimal triangulations, in which only vertices of coordination number 5, 6, and 7 are…
Following Riemann's idea, we prove the existence of a minimal disk in Euclidean space bounded by three lines in generic position and with three helicoidal ends of angles less than $\pi$. In the case of general angles, we prove that there…