NDLI: Counting crossing-free structures

Please wait, while we are loading the content...

On topological changes in the delaunay triangulation of moving points

The point-set embeddability problem for plane graphs

Protein molecules in 3D: complex behavior from simple local geometry plus weak interactions

Higher-order Erdös: Szekeres theorems

How to walk your dog in the mountains with no magic leash

Approximating low-dimensional coverage problems

Mappings and meshes

Cubic plane graphs on a given point set

Linear-size approximations to the vietoris-rips filtration

Self-improving algorithms for coordinate-wise maxima

Tessellation analysis of the cosmic web

Stabbing horizontal segments with vertical rays

Periodic body-and-bar frameworks

Disjoint edges in complete topological graphs

Configuration space visualization

Geometric packing under non-uniform constraints

Algorithmic complexity of finding cross-cycles in flag complexes

Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions

Tracing compressed curves in triangulated surfaces

Improved range searching lower bounds

Multinerves and helly numbers of acyclic families

Alexander duality for functions: the persistent behavior of land and water and shore

Finding the maximal empty disk containing a query point

Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model

On sub-determinants and the diameter of polyhedra

Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions

Surface patches from unorganized space curves

Computing cartograms with optimal complexity

Counting crossing-free structures

On the expected complexity of voronoi diagrams on terrains

Testing graph isotopies on surfaces

An output-sensitive algorithm for computing projections of resultant polytopes

Duals of orphan-free anisotropic voronoi diagrams are embedded meshes

Certified computation of planar morse-smale complexes

Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set

A theorem of bárány revisited and extended

Optimal area-sensitive bounds for polytope approximation

The 2-page crossing number of $K_{n}$

Lang's universal molecule algorithm

Approximate bregman near neighbors in sublinear time: beyond the triangle inequality

A fast and simple surface reconstruction algorithm

On Klee's measure problem for grounded boxes

On laplacians of random complexes

Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique

Stability of Delaunay-type structures for manifolds: [extended abstract]

A deterministic o(m log m) time algorithm for the reeb graph

Approximating Tverberg points in linear time for any fixed dimension

Improved pointer machine and I/O lower bounds for simplex range reporting and related problems

Object-image correspondence for curves under central and parallel projections

String graphs and incomparability graphs

The sticky geometry of the cosmic web

Counting crossing-free structures

Content Provider	ACM Digital Library
Author	Bringmann, Karl Ray, Saurabh Curticapean, Radu Alvarez, Victor
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(30^{n})$ and at least $Ω(2.43^{n})$ 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.1414^{n}).$ Given that there are several well-studied configurations of points with at least $Ω(3.464^{n})$ triangulations, and some even with $Ω(8^{n})$ 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.464^{n})$ 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.
Starting Page	61
Ending Page	68
Page Count	8
File Format	PDF
ISBN	9781450312998
DOI	10.1145/2261250.2261259
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-06-17
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Triangulations Onion layers Counting Parameterized complexity
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Counting Triangulations and other Crossing-free Structures via Onion Layers (2013)

Counting triangulations and other crossing-free structures via onion layers (2012).

Counting Triangulations and Other Crossing-Free Structures via Onion Layers

Counting Triangulations and other Crossing-free Structures via Onion Layers

Counting Triangulations and other Crossing-Free Structures Approximately (2014)

Random triangulations of planar point sets

Counting and Enumerating Crossing-free Geometric Graphs

Counting crossing free structures.

On degrees in random triangulations of point sets

Counting crossing-free structures

Similar Documents

Counting Triangulations and other Crossing-free Structures via Onion Layers (2013)

Counting triangulations and other crossing-free structures via onion layers (2012).

Counting Triangulations and Other Crossing-Free Structures via Onion Layers

Counting Triangulations and other Crossing-free Structures via Onion Layers

Counting Triangulations and other Crossing-Free Structures Approximately (2014)

Random triangulations of planar point sets

Counting and Enumerating Crossing-free Geometric Graphs

Counting crossing free structures.

On degrees in random triangulations of point sets

Counting crossing-free structures