Pages that link to "Item:Q1776895"
From MaRDI portal
The following pages link to Enumerating pseudo-triangulations in the plane (Q1776895):
Displaying 34 items.
- Multitriangulations, pseudotriangulations and primitive sorting networks (Q443914) (← links)
- The diameter of type \(D\) associahedra and the non-leaving-face property (Q499452) (← links)
- The stochastic walk algorithms for point location in pseudo-triangulations (Q634299) (← links)
- Amortized efficiency of generating planar paths in convex position (Q638510) (← links)
- Flips in edge-labelled pseudo-triangulations (Q680154) (← links)
- Computing pseudotriangulations via branched coverings (Q714984) (← links)
- Empty pseudo-triangles in point sets (Q765318) (← links)
- Combinatorial pseudo-triangulations (Q864146) (← 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)
- The enumeration of akempic triangulations (Q1065015) (← links)
- On the number of triangles in simple arrangements of pseudolines in the real projective plane (Q1085792) (← links)
- The polytope of non-crossing graphs on a planar point set (Q1772132) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
- An efficient algorithm for enumeration of triangulations (Q1862130) (← links)
- On numbers of pseudo-triangulations (Q1947983) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- Enumeration of planar constellations with an alternating boundary (Q2048549) (← links)
- Convex dominating sets in maximal outerplanar graphs (Q2312656) (← links)
- Enumerating non-crossing minimally rigid frameworks (Q2373440) (← links)
- Transforming pseudo-triangulations (Q2390240) (← links)
- Gray code enumeration of plane straight-line graphs (Q2464050) (← links)
- On the number of pseudo-triangulations of certain point sets (Q2474495) (← links)
- Why do simple algorithms for triangle enumeration work in the real world? (Q2988883) (← links)
- Pseudo-triangulations -- a survey (Q3514529) (← links)
- Enumeration of Inner Leafless Planar Near-quadrangulations (Q4642936) (← links)
- The polytope of non-crossing graphs on a planar point set (Q4657333) (← links)
- (Q5178685) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q5361619) (← links)
- Expansive motions and the polytope of pointed pseudo-triangulations (Q5692723) (← links)
- Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)
- Parameterized aspects of triangle enumeration (Q5915757) (← links)
- Enumerating triangulation paths (Q5952967) (← links)
