Pages that link to "Item:Q540059"

The following pages link to Counting triangulations of planar point sets (Q540059):

Displaying 39 items.

• Configurations of non-crossing rays and related problems (Q282735) (← links)
• Counting carambolas (Q293619) (← links)
• Crossings in grid drawings (Q405129) (← links)
• Counting triangulations of some classes of subdivided convex polygons (Q518180) (← links)
• On degrees in random triangulations of point sets (Q549246) (← links)
• On the number of higher order Delaunay triangulations (Q551184) (← links)
• Distinct triangle areas in a planar point set over finite fields (Q648405) (← links)
• Monotone paths in geometric triangulations (Q726107) (← links)
• The enumeration of akempic triangulations (Q1065015) (← links)
• The number of geometric bistellar neighbors of a triangulation (Q1283745) (← links)
• Note on the number of triangulations of planar point sets (Q1288910) (← links)
• A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728) (← links)
• Colored ray configurations (Q1699300) (← links)
• Enumerating pseudo-triangulations in the plane (Q1776895) (← links)
• A better upper bound on the number of triangulations of a planar point set (Q1873821) (← links)
• A lower bound on the number of triangulations of planar point sets (Q1882855) (← links)
• On numbers of pseudo-triangulations (Q1947983) (← links)
• Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
• From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
• Counting polygon triangulations is hard (Q2223620) (← links)
• On compatible matchings (Q2232249) (← links)
• Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
• Geometric biplane graphs. I: Maximal graphs (Q2345511) (← links)
• Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
• Trapezoidal diagrams, upward triangulations, and prime Catalan numbers (Q2411817) (← links)
• Counting Plane Graphs: Flippability and Its Applications (Q2847913) (← links)
• Bounds on the maximum multiplicity of some common geometric graphs (Q2848539) (← links)
• Counting Plane Graphs with Exponential Speed-Up (Q3003469) (← links)
• Bounds on the maximum multiplicity of some common geometric graphs (Q3113726) (← links)
• A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (Q3448837) (← links)
• The Number of Triangulations on Planar Point Sets (Q3595450) (← links)
• (Q4432212) (← links)
• On Compatible Matchings (Q5049995) (← links)
• (Q5088963) (← links)
• A simple aggregative algorithm for counting triangulations of planar point sets and related problems (Q5174454) (← links)
• A Census of Plane Graphs with Polyline Edges (Q5267999) (← links)
• Convex Polygons in Geometric Triangulations (Q5366966) (← links)
• Triangulations of Line Segment Sets in the Plane (Q5458851) (← links)
• Interview with Micha Sharir (Q6659997) (← links)