Pages that link to "Item:Q1776895"
From MaRDI portal
The following pages link to Enumerating pseudo-triangulations in the plane (Q1776895):
Displayed 9 items.
- Multitriangulations, pseudotriangulations and primitive sorting networks (Q443914) (← links)
- The diameter of type \(D\) associahedra and the non-leaving-face property (Q499452) (← links)
- Decomposing a simple polygon into pseudo-triangles and convex polygons (Q934018) (← links)
- Enumerating constrained non-crossing minimally rigid frameworks (Q946684) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- Convex dominating sets in maximal outerplanar graphs (Q2312656) (← links)
- Enumerating non-crossing minimally rigid frameworks (Q2373440) (← links)
- Gray code enumeration of plane straight-line graphs (Q2464050) (← links)
- Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)