Counting crossing-free structures

Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Let P be a set of n points in the plane. A crossing-free structure on P is a straight-edge planar graph with vertex set in P. Examples of crossing-free structures include triangulations of P, and spanning cycles of P, also known as polygonalizations of P, among others. There has been a large amount of research trying to bound the number of such structures. In particular, bounding the number of triangulations spanned by P has received considerable attention. It is currently known that every set of n points has at most O(30n) and at least Ω(2.43n) triangulations. However, much less is known about the algorithmic problem of counting crossing-free structures of a given set P. For example, no algorithm for counting triangulations is known that, on all instances, performs faster than enumerating all triangulations. In this paper we develop a general technique for computing the number of crossing-free structures of an input set P. We apply the technique to obtain algorithms for computing the number of triangulations and spanning cycles of P. The running time of our algorithms is upper bounded by n O(k), where k is the number of onion layers of P. In particular, we show that our algorithm for counting triangulations is not slower than O(3.1414n). Given that there are several well-studied configurations of points with at least Ω(3.464n) triangulations, and some even with Ω(8n) triangulations, our algorithm is the first to asymptotically outperform any enumeration algorithm for such instances. In fact, it is widely believed that any set of n points must have at least Ω(3.464n) triangulations. If this is true, then our algorithm is strictly sub-linear in the number of triangulations counted. We also show that our techniques are general enough to solve the restricted triangulation counting problem, which we prove to be W [2]-hard in the parameter k. This implies a "no free lunch" result: In order to be fixed-parameter tractable, our general algorithm must rely on additional properties that are specific to the considered class of structures.

Original languageEnglish (US)
Title of host publicationProceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012
Pages61-68
Number of pages8
DOIs
StatePublished - Jul 23 2012
Event28th Annual Symposuim on Computational Geometry, SCG 2012 - Chapel Hill, NC, United States
Duration: Jun 17 2012Jun 20 2012

Other

Other28th Annual Symposuim on Computational Geometry, SCG 2012
CountryUnited States
CityChapel Hill, NC
Period6/17/126/20/12

Fingerprint

Triangulation
Counting
Onion
Cycle
Counting Problems
Computing
Planar graph
Straight
Enumeration
Strictly
Imply

Keywords

  • Counting
  • Onion layers
  • Parameterized complexity
  • Triangulations

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Cite this

Alvarez, V., Bringmann, K., Curticapean, R., & Ray, S. (2012). Counting crossing-free structures. In Proceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012 (pp. 61-68) https://doi.org/10.1145/2261250.2261259

Counting crossing-free structures. / Alvarez, Victor; Bringmann, Karl; Curticapean, Radu; Ray, Saurabh.

Proceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012. 2012. p. 61-68.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Alvarez, V, Bringmann, K, Curticapean, R & Ray, S 2012, Counting crossing-free structures. in Proceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012. pp. 61-68, 28th Annual Symposuim on Computational Geometry, SCG 2012, Chapel Hill, NC, United States, 6/17/12. https://doi.org/10.1145/2261250.2261259
Alvarez V, Bringmann K, Curticapean R, Ray S. Counting crossing-free structures. In Proceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012. 2012. p. 61-68 https://doi.org/10.1145/2261250.2261259
Alvarez, Victor ; Bringmann, Karl ; Curticapean, Radu ; Ray, Saurabh. / Counting crossing-free structures. Proceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012. 2012. pp. 61-68
@inproceedings{d986e8ec0600469c9e2d689a1d9fdccd,
title = "Counting crossing-free structures",
abstract = "Let P be a set of n points in the plane. A crossing-free structure on P is a straight-edge planar graph with vertex set in P. Examples of crossing-free structures include triangulations of P, and spanning cycles of P, also known as polygonalizations of P, among others. There has been a large amount of research trying to bound the number of such structures. In particular, bounding the number of triangulations spanned by P has received considerable attention. It is currently known that every set of n points has at most O(30n) and at least Ω(2.43n) triangulations. However, much less is known about the algorithmic problem of counting crossing-free structures of a given set P. For example, no algorithm for counting triangulations is known that, on all instances, performs faster than enumerating all triangulations. In this paper we develop a general technique for computing the number of crossing-free structures of an input set P. We apply the technique to obtain algorithms for computing the number of triangulations and spanning cycles of P. The running time of our algorithms is upper bounded by n O(k), where k is the number of onion layers of P. In particular, we show that our algorithm for counting triangulations is not slower than O(3.1414n). Given that there are several well-studied configurations of points with at least Ω(3.464n) triangulations, and some even with Ω(8n) triangulations, our algorithm is the first to asymptotically outperform any enumeration algorithm for such instances. In fact, it is widely believed that any set of n points must have at least Ω(3.464n) triangulations. If this is true, then our algorithm is strictly sub-linear in the number of triangulations counted. We also show that our techniques are general enough to solve the restricted triangulation counting problem, which we prove to be W [2]-hard in the parameter k. This implies a {"}no free lunch{"} result: In order to be fixed-parameter tractable, our general algorithm must rely on additional properties that are specific to the considered class of structures.",
keywords = "Counting, Onion layers, Parameterized complexity, Triangulations",
author = "Victor Alvarez and Karl Bringmann and Radu Curticapean and Saurabh Ray",
year = "2012",
month = "7",
day = "23",
doi = "10.1145/2261250.2261259",
language = "English (US)",
isbn = "9781450312998",
pages = "61--68",
booktitle = "Proceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012",

}

TY - GEN

T1 - Counting crossing-free structures

AU - Alvarez, Victor

AU - Bringmann, Karl

AU - Curticapean, Radu

AU - Ray, Saurabh

PY - 2012/7/23

Y1 - 2012/7/23

N2 - Let P be a set of n points in the plane. A crossing-free structure on P is a straight-edge planar graph with vertex set in P. Examples of crossing-free structures include triangulations of P, and spanning cycles of P, also known as polygonalizations of P, among others. There has been a large amount of research trying to bound the number of such structures. In particular, bounding the number of triangulations spanned by P has received considerable attention. It is currently known that every set of n points has at most O(30n) and at least Ω(2.43n) triangulations. However, much less is known about the algorithmic problem of counting crossing-free structures of a given set P. For example, no algorithm for counting triangulations is known that, on all instances, performs faster than enumerating all triangulations. In this paper we develop a general technique for computing the number of crossing-free structures of an input set P. We apply the technique to obtain algorithms for computing the number of triangulations and spanning cycles of P. The running time of our algorithms is upper bounded by n O(k), where k is the number of onion layers of P. In particular, we show that our algorithm for counting triangulations is not slower than O(3.1414n). Given that there are several well-studied configurations of points with at least Ω(3.464n) triangulations, and some even with Ω(8n) triangulations, our algorithm is the first to asymptotically outperform any enumeration algorithm for such instances. In fact, it is widely believed that any set of n points must have at least Ω(3.464n) triangulations. If this is true, then our algorithm is strictly sub-linear in the number of triangulations counted. We also show that our techniques are general enough to solve the restricted triangulation counting problem, which we prove to be W [2]-hard in the parameter k. This implies a "no free lunch" result: In order to be fixed-parameter tractable, our general algorithm must rely on additional properties that are specific to the considered class of structures.

AB - Let P be a set of n points in the plane. A crossing-free structure on P is a straight-edge planar graph with vertex set in P. Examples of crossing-free structures include triangulations of P, and spanning cycles of P, also known as polygonalizations of P, among others. There has been a large amount of research trying to bound the number of such structures. In particular, bounding the number of triangulations spanned by P has received considerable attention. It is currently known that every set of n points has at most O(30n) and at least Ω(2.43n) triangulations. However, much less is known about the algorithmic problem of counting crossing-free structures of a given set P. For example, no algorithm for counting triangulations is known that, on all instances, performs faster than enumerating all triangulations. In this paper we develop a general technique for computing the number of crossing-free structures of an input set P. We apply the technique to obtain algorithms for computing the number of triangulations and spanning cycles of P. The running time of our algorithms is upper bounded by n O(k), where k is the number of onion layers of P. In particular, we show that our algorithm for counting triangulations is not slower than O(3.1414n). Given that there are several well-studied configurations of points with at least Ω(3.464n) triangulations, and some even with Ω(8n) triangulations, our algorithm is the first to asymptotically outperform any enumeration algorithm for such instances. In fact, it is widely believed that any set of n points must have at least Ω(3.464n) triangulations. If this is true, then our algorithm is strictly sub-linear in the number of triangulations counted. We also show that our techniques are general enough to solve the restricted triangulation counting problem, which we prove to be W [2]-hard in the parameter k. This implies a "no free lunch" result: In order to be fixed-parameter tractable, our general algorithm must rely on additional properties that are specific to the considered class of structures.

KW - Counting

KW - Onion layers

KW - Parameterized complexity

KW - Triangulations

UR - http://www.scopus.com/inward/record.url?scp=84863889850&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863889850&partnerID=8YFLogxK

U2 - 10.1145/2261250.2261259

DO - 10.1145/2261250.2261259

M3 - Conference contribution

AN - SCOPUS:84863889850

SN - 9781450312998

SP - 61

EP - 68

BT - Proceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012

ER -