Counting triangulations and other crossing-free structures approximately

@article{Alvarez2015CountingTA,
  title={Counting triangulations and other crossing-free structures approximately},
  author={Victor Alvarez and K. Bringmann and Saurabh Ray and R. Seidel},
  journal={Comput. Geom.},
  year={2015},
  volume={48},
  pages={386-397}
}
  • Victor Alvarez, K. Bringmann, +1 author R. Seidel
  • Published 2015
  • Computer Science, Mathematics
  • Comput. Geom.
  • We consider the problem of counting straight-edge triangulations of a given set P of n points in the plane. Until very recently it was not known whether the exact number of triangulations of P can be computed asymptotically faster than by enumerating all triangulations. We now know that the number of triangulations of P can be computed in O * ( 2 n ) time 9, which is less than the lower bound of ? ( 2.43 n ) on the number of triangulations of any point set 30. In this paper we address the… CONTINUE READING
    13 Citations
    A QPTAS for the base of the number of crossing-free structures on a planar point set
    • 4
    • Highly Influenced
    • PDF
    A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
    • 2
    • Highly Influenced
    • PDF
    Counting and Enumerating Crossing-free Geometric Graphs
    • Manuel Wettstein
    • Mathematics, Computer Science
    • Symposium on Computational Geometry
    • 2014
    • 20
    • Highly Influenced
    • PDF
    Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
    • 13
    • PDF
    Counting Triangulations and Other Crossing-Free Structures via Onion Layers
    • 14
    • PDF
    Convex Polygons in Geometric Triangulations
    • 3
    • PDF
    Convex Polygons in Geometric Triangulations
    • 1
    • PDF
    Exact uniform sampling over catalan structures
    • PDF
    Studies in Efficient Discrete Algorithms
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 43 REFERENCES
    Counting crossing-free structures
    • 14
    • PDF
    Counting Plane Graphs with Exponential Speed-Up
    • 15
    A simple aggregative algorithm for counting triangulations of planar point sets and related problems
    • 23
    • PDF
    A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations
    • 8
    • PDF
    Counting Triangulations of Planar Point Sets
    • 64
    • PDF
    Counting and Enumerating Crossing-free Geometric Graphs
    • Manuel Wettstein
    • Mathematics, Computer Science
    • Symposium on Computational Geometry
    • 2014
    • 20
    • PDF
    On degrees in random triangulations of point sets
    • 11
    Enumerating Triangulation Paths
    • 15
    • PDF
    Counting Plane Graphs: Flippability and Its Applications
    • 41
    • PDF