Enumerating non-crossing minimally rigid frameworks
DOI10.1007/S00373-007-0709-0zbMATH Open1123.68084OpenAlexW2069126428MaRDI QIDQ2373440FDOQ2373440
Authors: M. Ohsaki, Ileana Streinu, Shin-Ichi Tanigawa, David Avis, Naoki Katoh 
Publication date: 19 July 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0709-0
Recommendations
- Enumerating Non-crossing Minimally Rigid Frameworks
- Enumerating constrained non-crossing minimally rigid frameworks
- Combinatorial rigidity of symmetric and periodic frameworks
- Generic combinatorial rigidity of periodic frameworks
- The number of embeddings of minimally rigid graphs
- On the number of embeddings of minimally rigid graphs
- Combinatorial Algorithm for a Lower Bound on Frame Rigidity
- <scp>Almost‐Rigidity</scp> of Frameworks
- Maximal rigid objects as noncrossing bipartite graphs
- Combinatorial rigidity. Graphs and matroids in the theory of rigid frameworks
Graph theory (including graph drawing) in computer science (68R10) Exact enumeration problems, generating functions (05A15) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)
Cites Work
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- An algorithm for two-dimensional rigidity percolation: The pebble game
- On graphs and rigidity of plane skeletal structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for graph rigidity and scene analysis
- Reverse search for enumeration
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structural mechanics: Graph and matrix methods.
- Acute triangulations of polygons
- Enumerating pseudo-triangulations in the plane
- Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
- Enumerating triangulation paths
- Pebble game algorithms and \((k,l)\)-sparse graphs
- Algorithms and Data Structures
- An efficient algorithm for enumeration of triangulations
Cited In (6)
- Non-crossing frameworks with non-crossing reciprocals
- Enumerating constrained non-crossing minimally rigid frameworks
- Amortized efficiency of generating planar paths in convex position
- Fast enumeration algorithms for non-crossing geometric graphs
- Enumerating Non-crossing Minimally Rigid Frameworks
- Flips in planar graphs
This page was built for publication: Enumerating non-crossing minimally rigid frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373440)
