The following pages link to Flipping edges in triangulations (Q1807608):
Displaying 50 items.
- Adaptive, anisotropic and hierarchical cones of discrete convex functions (Q264117) (← links)
- Counting carambolas (Q293619) (← links)
- The edge rotation graph (Q367068) (← links)
- Flipping triangles and rectangles (Q386439) (← links)
- Counting triangulations of some classes of subdivided convex polygons (Q518180) (← links)
- A generalized Winternitz theorem (Q657008) (← links)
- Flips in edge-labelled pseudo-triangulations (Q680154) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- Convex blocking and partial orders on the plane (Q902426) (← links)
- Flip distance between two triangulations of a point set is NP-complete (Q906837) (← links)
- Flips in planar graphs (Q950400) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- Transforming spanning trees and pseudo-triangulations (Q1044747) (← links)
- An efficient upper bound of the rotation distance of binary trees (Q1607028) (← links)
- Hamiltonian triangular refinements and space-filling curves (Q1624615) (← links)
- Flipping edge-labelled triangulations (Q1699301) (← links)
- Enumerating pseudo-triangulations in the plane (Q1776895) (← links)
- Once punctured disks, non-convex polygons, and pointihedra (Q1787972) (← links)
- Geometric quadrangulations of a polygon (Q1792062) (← links)
- Triangulations intersect nicely (Q1816461) (← links)
- On local transformation of polygons with visibility properties. (Q1853571) (← links)
- An efficient algorithm for enumeration of triangulations (Q1862130) (← links)
- Flipping in spirals (Q1984590) (← links)
- An improved FPT algorithm for the flip distance problem (Q2051774) (← links)
- Quadrangulations of a polygon with spirality (Q2051896) (← links)
- Connectivity of triangulation flip graphs in the plane (Q2105329) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- Minimum weight connectivity augmentation for planar straight-line graphs (Q2272377) (← links)
- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets (Q2287740) (← links)
- Minimal surfaces from infinitesimal deformations of circle packings (Q2287941) (← links)
- Flip distance to some plane configurations (Q2331207) (← links)
- Edge flips in surface meshes (Q2354677) (← links)
- Bichromatic compatible matchings (Q2354926) (← links)
- Transforming pseudo-triangulations (Q2390240) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- A proof of the orbit conjecture for flipping edge-labelled triangulations (Q2415384) (← links)
- Flip distance between triangulations of a planar point set is APX-hard (Q2444311) (← links)
- On local transformations in plane geometric graphs embedded on small grids (Q2462732) (← links)
- Gray code enumeration of plane straight-line graphs (Q2464050) (← links)
- Pre-triangulations and liftable complexes (Q2471725) (← links)
- Triangulations without pointed spanning trees (Q2479476) (← links)
- Non-connected toric Hilbert schemes (Q2484090) (← links)
- Graphs of triangulations and perfect matchings (Q2573802) (← links)
- Flip Graphs of Bounded-Degree Triangulations (Q2851510) (← links)
- The Mathematics of Ferran Hurtado: A Brief Survey (Q2958111) (← links)
- SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS (Q4818577) (← links)
- Simultaneously Flippable Edges in Triangulations (Q4899272) (← links)
- On Decomposition of Embedded Prismatoids in $$\mathbb {R}^3$$ Without Additional Points (Q5020223) (← links)
- (Q5088963) (← links)
