60 research outputs found
Counting Triangulations and other Crossing-Free Structures Approximately
We consider the problem of counting straight-edge triangulations of a given
set of points in the plane. Until very recently it was not known
whether the exact number of triangulations of can be computed
asymptotically faster than by enumerating all triangulations. We now know that
the number of triangulations of can be computed in time,
which is less than the lower bound of on the number of
triangulations of any point set. In this paper we address the question of
whether one can approximately count triangulations in sub-exponential time. We
present an algorithm with sub-exponential running time and sub-exponential
approximation ratio, that is, denoting by the output of our
algorithm, and by the exact number of triangulations of , for some
positive constant , we prove that . This is the first algorithm that in sub-exponential time computes a
-approximation of the base of the number of triangulations, more
precisely, . Our algorithm can be
adapted to approximately count other crossing-free structures on , keeping
the quality of approximation and running time intact. In this paper we show how
to do this for matchings and spanning trees.Comment: 19 pages, 2 figures. A preliminary version appeared at CCCG 201
Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
Given a set of n points S in the plane, a triangulation T of S is a maximal set of non-crossing segments with endpoints in S. We present an algorithm that computes the number of triangulations on a given set of n points in time n^{ (11+ o(1)) sqrt{n} }, significantly improving the previous best running time of O(2^n n^2) by Alvarez and Seidel [SoCG 2013]. Our main tool is identifying separators of size O(sqrt{n}) of a triangulation in a canonical way. The definition of the separators are based on the decomposition of the triangulation into nested layers ("cactus graphs"). Based on the above algorithm, we develop a simple and formal framework to count other non-crossing straight-line graphs in n^{O(sqrt{n})} time. We demonstrate the usefulness of the framework by applying it to counting non-crossing Hamilton cycles, spanning trees, perfect matchings, 3-colorable triangulations, connected graphs, cycle decompositions, quadrangulations, 3-regular graphs, and more
Peeling and nibbling the cactus: Subexponential-time algorithms for counting triangulations and related problems
Given a set of points in the plane, a triangulation of is a
maximal set of non-crossing segments with endpoints in . We present an
algorithm that computes the number of triangulations on a given set of
points in time , significantly improving the previous
best running time of by Alvarez and Seidel [SoCG 2013]. Our main
tool is identifying separators of size of a triangulation in a
canonical way. The definition of the separators are based on the decomposition
of the triangulation into nested layers ("cactus graphs"). Based on the above
algorithm, we develop a simple and formal framework to count other non-crossing
straight-line graphs in time. We demonstrate the usefulness
of the framework by applying it to counting non-crossing Hamilton cycles,
spanning trees, perfect matchings, -colorable triangulations, connected
graphs, cycle decompositions, quadrangulations, -regular graphs, and more.Comment: 47 pages, 23 Figures, to appear in SoCG 201
Selected topics in algorithmic geometry
Let P be a set of n points on the plane with no three points on a line. A crossing-free structure on P is a straight-edge plane graph whose vertex set is P. In this thesis we consider problems of two different topics in the area of algorithmic geometry: Geometry using Steiner points, and counting algorithms. These topics have certain crossing-free structures on P as our primary objects of study. Our results can roughly be described as follows:
i) Given a k-coloring of P, with k >= 3 colors, we will show how to construct a set of Steiner points S = S(P) such that a k-colored quadrangulation can always be constructed on (P U S). The bound we show of |S| significantly improves on previously known results.
ii) We also show how to construct a se S = S(P) of Steiner points such that a triangulation of (P U S) having all its vertices of even (odd) degree can always be constructed. We show that |S| <= n/3 + c, where c is a constant. We also look at other variants of this problem.
iii) With respect to counting algorithms, we show new algorithms for counting triangulations, pseudo-triangulations, crossing-free matchings and crossing-free spanning cycles on P. Our algorithms are simple and allow good analysis of their running times. These algorithms significantly improve over previously known results. We also show an algorithm that counts triangulations approximately, and a hardness result of a particular instance of the problem of counting triangulations exactly.
iv) We show experiments comparing our algorithms for counting triangulations with another well-known algorithm that is supposed to be very fast in practice.Sei P eine Menge von n Punkte in der Ebene, so dass keine drei Punkten auf einer Geraden liegen. Eine kreuzungsfreie Struktur von P ist ein geradliniger ebener Graph, der P als Knotenmenge hat. In dieser Dissertation behandeln wir zwei verschiedene Problemkreise auf dem Gebiet der algorithmischen Geometrie: Geometrie mit Steinerpunkten und Anzahl bestimmende Algorithmen auf P und auf gewissen kreuzungsfreien Strukturen von P. Unsere Resultate können wie folgt beschrieben werden:
i) Gegeben sei eine k-FĂ€rbung von P, mit k >= 3 Farben. Es wird gezeigt, wie eine Menge S = S(P) von Steiner Punkten konstruiert werden kann, die die Konstruktion einer k-gefĂ€rbten Quadrangulierung von (P U S) ermöglicht. Die von uns gezeigte Schranke fĂŒr |S| verbessert die bisher bekannte Schranke.
ii) Gezeigt wird auch die Konstruktion einer Menge S = S(P) von Steiner Punkten, so dass eine Triangulierung von (P U S) konstruiert werden kann, bei der der Grad aller Knoten gerade (ungerade) ist. Wir zeigen, dass |S| <= n/3 + c möglich ist, wobei c eine Konstante ist. Wir betrachten auch andere Varianten dieses Problems.
iii) Was die Anzahl bestimmenden Algorithmen betrifft, zeigen wir neue Algorithmen, um Triangulierungen, Pseudotriangulierungen, kreuzungsfreie Matchings und kreuzungsfreie aufspannende Zyklen von P zu zÀhlen. Unsere Algorithmen sind einfach und lassen eine gute Analyse der Laufzeiten zu. Diese neuen Algorithmen verbessern wesentlich die bisherigen Ergebnisse. Weiter zeigen wir einen Algorithmus, der Triangulierungen approximativ zÀhlt, und bestimmen die KomplexitÀtsklasse einer bestimmten Variante des Problems des exakten ZÀhlens von Triangulierungen.
iv) Wir zeigen Experimente, die unsere triangulierungszÀhlenden Algorithmen mit einem anderen bekannten Algorithmus vergleichen, der in der Praxis als besonders schnell bekannt ist
Counting Polygon Triangulations is Hard
We prove that it is #P-complete to count the triangulations of a (non-simple) polygon
An Improved Lower Bound on the Minimum Number of Triangulations
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points in the plane have been intensively studied in recent years. For most classes of geometric graphs it is now known that point sets in convex position minimize their number. However, it is still unclear which point sets minimize the number of geometric triangulations; the so-called double circles are conjectured to be the minimizing sets. In this paper we prove that any set of n points in general position in the plane has at least Omega(2.631^n) geometric triangulations. Our result improves the previously best general lower bound of Omega(2.43^n) and also covers the previously best lower bound of Omega(2.63^n) for a fixed number of extreme points. We achieve our bound by showing and combining several new results, which are of independent interest:
(1) Adding a point on the second convex layer of a given point set (of 7 or more points) at least doubles the number of triangulations.
(2) Generalized configurations of points that minimize the number of triangulations have at most n/2 points on their convex hull.
(3) We provide tight lower bounds for the number of triangulations of point sets with up to 15 points. These bounds further support the double circle conjecture
Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
We show that, for planar point sets, the number of non-crossing Hamiltonian paths is polynomially bounded in the number of non-crossing paths, and the number of non-crossing Hamiltonian cycles (polygonalizations) is polynomially bounded in the number of surrounding cycles. As a consequence, we can list the non-crossing Hamiltonian paths or the polygonalizations, in time polynomial in the output size, by filtering the output of simple backtracking algorithms for non-crossing paths or surrounding cycles respectively. To prove these results we relate the numbers of non-crossing structures to two easily-computed parameters of the point set: the minimum number of points whose removal results in a collinear set, and the number of points interior to the convex hull. These relations also lead to polynomial-time approximation algorithms for the numbers of structures of all four types, accurate to within a constant factor of the logarithm of these numbers
- âŠ