Search arXiv⌕ Search

arXiv · cs/0310034

Minimizing the stabbing number of matchings, trees, and triangulations

Abstract

The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. This paper deals with finding perfect matchings, spanning trees, or triangulations of minimum stabbing number for a given set of points. The complexity of these problems has been a long-standing open question; in fact, it is one of the original 30 outstanding open problems in computational geometry on the list by Demaine, Mitchell, and O'Rourke. The answer we provide is negative for a number of minimum stabbing problems by showing them NP-hard by means of a general proof technique. It implies non-trivial lower bounds on the approximability. On the positive side we propose a cut-based integer programming formulation for minimizing the stabbing number of matchings and spanning trees. We obtain lower bounds (in polynomial time) from the corresponding linear programming relaxations, and show that an optimal fractional solution always contains an edge of at least constant weight. This result constitutes a crucial step towards a constant-factor approximation via an iterated rounding scheme. In computational experiments we demonstrate that our approach allows for actually solving problems with up to several hundred points optimally or near-optimally.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sandor P. Fekete, Marco Luebbecke, Henk Meijer. 2008-09-05. Minimizing the stabbing number of matchings, trees, and triangulations. https://doi.org/10.1007/s00454-008-9114-6

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Containment Problems in Convex Sets

Let $P$ be a set of $n$ points in the plane, and let $C$ be a compact, convex subset of the plane that contains the origin in its interior. We study the problem of finding two points $p$ and $q$ of $P$ with the property that any homothet of $C$ that contains $p$ and $q$ must contain at least a constant fraction of the points of $P$. We give proofs for several cases. When $C$ is strictly convex we achieve a fraction of $1/5$, and when $C$ is a general convex region we achieve a fraction of $1/6e$. We show how the ideas of this second bound can be used to prove a lower bound for a version of the problem in $\mathbb{R}^d$ when $C$ is a $d$-ball. We also consider a few special cases. When $C$ is a triangle we get a lower bound of $1/12$, and when we allow that triangle to be rotated by $π$ radians in addition to being scaled and translated we get a lower bound of $1/768$. In proving this last result, we improve the state of the art on the version of this problem in three dimensions, where $C$ is a parallelepiped. We also consider the algorithmic aspects of finding such a pair of points.

cs.CG↗

Separating Measures by Hyperplanes

Given red and blue points in $\mathbb{R}^d$, connect every red point to every blue point and weigh each segment by its length under a fixed norm. What fraction of the total weight can always be captured by a single affine hyperplane separating the segments' endpoints? We study this question for finite point configurations in affine general position and, more generally, for pairs of probability measures. For dimension one, we show that choosing the best of three thresholds determined by the means of the two distributions captures at least one third of the total red-blue distance. We also give a matching upper bound. Embedding the line construction to higher dimensions shows that the guarantee of $1/3$ cannot be improved for arbitrary measures. Thus, we pivot to the family of measures whose atoms are in affine general position and whose non-atomic part places zero mass on all hyperplanes. Crucially, we establish that the worst-case guarantee is identical for finite configurations in affine general position and several natural classes of probability measures, thereby unifying the discrete and continuous formulations of the problem. For this family of measures and for higher dimensions, we extend our guarantee of $1/3$ for all norms. Our proofs combine the ham-sandwich theorem with a novel coupling argument and, in the planar case, an integral representation of norms. We also show that the optimal guarantee improves as the dimension grows, giving a lower bound of $1/2-\operatorname{O}\left(1/\sqrt{d}\right)$ as well as an asymptotically matching upper bound of $1/2$ for every $d$. For the Euclidean distance, we refine the lower bounds to $8/(8+5π)$ and $1/2-\operatorname{O}\left(1/d\right)$ and, for $d=2$, the upper bound to $5/11$. We also derive dimension-dependent guarantees for finite point configurations, including perfect separation of $n$ points of each color when $d\geq2n-1$.

cs.CG↗

On the complexity of the free space of a translating box in R^3

Consider a convex polyhedral robot $B$ that can translate (without rotating) amidst a finite set of non-moving polyhedral obstacles in $\mathbb R^3$. The "free space" $\mathcal F$ of $B$ is the set of all positions in which $B$ is disjoint from the interior of every obstacle. Aronov and Sharir (1997) derived an upper bound of $O(n^2\log n)$ for the combinatorial complexity (number of vertices, edges, and faces) of $\mathcal F$, where $n$ is the total complexity of the obstacles, and the complexity of $B$ is assumed constant. Halperin and Yap (1993) showed that, if $B$ is either a box or a "flat" convex polygon, then a tighter bound of $O(n^2α(n))$ holds. Here $α(n)$ is the inverse Ackermann function. In this paper we prove that if $B$ is a box, then the complexity of $\mathcal F$ is $O(n^2)$. Furthermore, if $B$ is a convex polygon whose edges come in parallel pairs, then the complexity of $\mathcal F$ is $O(n^2)$ as well. These results settle the question of the asymptotical worst-case complexity of $\mathcal F$ for a box, as well as for all convex polygons.

cs.CG↗