Pages that link to "Item:Q1862130"
From MaRDI portal
The following pages link to An efficient algorithm for enumeration of triangulations (Q1862130):
Displaying 30 items.
- Flips in planar graphs (Q950400) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps (Q982667) (← links)
- Triangulations. Structures for algorithms and applications (Q986135) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- Efficient enumeration of the vertices of polyhedra associated with network LP's (Q1315430) (← links)
- An efficient exact algorithm for triangle listing in large graphs (Q1741284) (← links)
- Enumerating pseudo-triangulations in the plane (Q1776895) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- Enumerating non-crossing minimally rigid frameworks (Q2373440) (← links)
- Generating all triangulations of plane graphs (Q2865036) (← links)
- Why do simple algorithms for triangle enumeration work in the real world? (Q2988883) (← links)
- Counting Plane Graphs with Exponential Speed-Up (Q3003469) (← links)
- Explicit Array-Based Compact Data Structures for Triangulations (Q3104626) (← links)
- Generating All Triangulations of Plane Graphs (Extended Abstract) (Q3605494) (← links)
- A heuristic triangulation algorithm (Q3776650) (← links)
- A POLYNOMIAL ALGORITHM FOR ENUMERATING ALL VERTICES OF A BASE POLYHEDRON (Q4366145) (← links)
- (Q5088963) (← links)
- Counting Triangles under Updates in Worst-Case Optimal Time (Q5091114) (← links)
- A simple aggregative algorithm for counting triangulations of planar point sets and related problems (Q5174454) (← links)
- Triangle Finding and Listing in CONGEST Networks (Q5368990) (← links)
- Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)
- An Algorithm to Construct Greedy Drawings of Triangulations (Q5897052) (← links)
- Parameterized aspects of triangle enumeration (Q5915757) (← links)
- One-parameter family of Neville-Aitken algorithm on \(q\)-triangle (Q5952800) (← links)
- Enumerating triangulation paths (Q5952967) (← links)
- Non-crossing Hamiltonian paths and cycles in output-polynomial time (Q6614115) (← links)
