Counting Triangulations Approximately

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Canadian Conference on Computational Geometry

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A simple aggregative algorithm for counting triangulations of planar point sets and related problems

  2013cited by this paper
• A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations

  2013cited by this paper
• Counting crossing-free structures

  2012cited by this paper
• Counting Plane Graphs with Exponential Speed-Up

  2011cited by this paper
• On degrees in random triangulations of point sets

  2010cited by this paper
• Counting Triangulations of Planar Point Sets

  2009cited by this paper
• A simple and less slow method for counting triangulations and for related problems

  2004cited by this paper
• The path of a triangulation

  1999cited by this paper
• Reduced constants for simple cycle graph separation

  1997cited by this paper
• Notes on Better Master Theorems for Divide-and-Conquer Recurrences

  1996cited by this paper
• Finding small simple cycle separators for 2-connected planar graphs.

  1984cited by this paper

• Sampling from Discrete Distributions and Computing Frechet Distances

  2015cites this paper
• A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set

  2015influential citation
• A QPTAS for the Base of the Number of Triangulations of a Planar Point Set

  2014influential citation