Planar minimally rigid graphs and pseudo-triangulations
From MaRDI portal
Publication:1775778
DOI10.1016/j.comgeo.2004.07.003zbMath1070.65014arXivmath/0307347OpenAlexW2953304270WikidataQ55920239 ScholiaQ55920239MaRDI QIDQ1775778
Günter Rote, Ruth Haas, Brigitte Servatius, Ileana Streinu, Francisco Santos, David Orden, Diane L. Souvaine, Walter J. Whiteley, Herman J. Servatius
Publication date: 4 May 2005
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0307347
Graph theory (including graph drawing) in computer science (68R10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Planar and Toroidal Morphs Made Easier ⋮ Contact Graphs of Circular Arcs ⋮ Resolving Loads with Positive Interior Stresses ⋮ Rigidity of Frameworks on Expanding Spheres ⋮ Combinatorial pseudo-triangulations ⋮ Angle Covers: Algorithms and Complexity ⋮ Pointed spherical tilings and hyperbolic virtual polytopes ⋮ Augmenting the rigidity of a graph in \(\mathbb R^{2}\) ⋮ On numbers of pseudo-triangulations ⋮ Multitriangulations, pseudotriangulations and primitive sorting networks ⋮ Pointed drawings of planar graphs ⋮ Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments ⋮ Rigidity with few locations ⋮ The combinatorial geometry of stresses in frameworks ⋮ Connectivity augmentation in planar straight line graphs ⋮ Matching edges and faces in polygonal partitions ⋮ Decompositions, partitions, and coverings with convex polygons and pseudo-triangles ⋮ A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs ⋮ Straight line triangle representations ⋮ On the number of pseudo-triangulations of certain point sets ⋮ Unnamed Item ⋮ 3-Colorability of Pseudo-Triangulations ⋮ Non-convex Representations of Graphs ⋮ A vertex-face assignment for plane graphs ⋮ Exact Camera Location Recovery by Least Unsquared Deviations ⋮ Mixed volume techniques for embeddings of Laman graphs ⋮ Topological inductive constructions for tight surface graphs ⋮ The non-solvability by radicals of generic 3-connected planar Laman graphs
Cites Work
- Convexity minimizes pseudo-triangulations
- How to draw a planar graph on a grid
- Operations on rigid formations of autonomous agents
- Tutte's barycenter method applied to isotopies
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Straightening polygonal arcs and convexifying polygonal cycles
- Non-crossing frameworks with non-crossing reciprocals
- The polytope of non-crossing graphs on a planar point set
- Topologically sweeping visibility complexes via pseudotriangulations
- Tight degree bounds for pseudo-triangulations of points
- Spaces of stresses, projections and parallel drawings for spherical polyhedra
- The structure of locally finite two-connected graphs
- On graphs and rigidity of plane skeletal structures
- Realization spaces of polytopes
- Convex Representations of Graphs
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Generalized Nested Dissection
- Applications of a Planar Separator Theorem
- Efficient Planarity Testing
- Planar minimally rigid graphs and pseudo-triangulations
- How to Draw a Graph
- Algorithms and Data Structures
- Convex drawings of planar graphs and the order dimension of 3-polytopes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
