## Characterizing 1-Dof Henneberg-I graphs with efficient configuration spaces (810)

Citations: | 1 - 1 self |

### BibTeX

@MISC{Gao810characterizing1-dof,

author = {Heping Gao and Meera Sitharam},

title = {Characterizing 1-Dof Henneberg-I graphs with efficient configuration spaces},

year = {810}

}

### OpenURL

### Abstract

We define and study exact, efficient representations of realization spaces of a natural class of underconstrained 2D Euclidean Distance Constraint Systems(EDCS, Linkages, Frameworks) based on 1-degree-of-freedom(dof) Henneberg-I graphs. Each representation corresponds to a choice of parameters and yields a different parametrized configuration space. Our notion of efficiency is based on the algebraic complexities of sampling the configuration space and of obtaining a realization from the sample (parametrized) configuration. Significantly, we give purely combinatorial characterizations that capture (i) the class of graphs that have efficient configuration spaces and (ii) the possible choices of representation parameters that yield efficient configuration spaces for a given graph. Our results automatically yield an efficient algorithm for sampling realizations, without missing extreme or boundary realizations. In addition, our results formally show that our definition of efficient configuration space is robust and that our characterizations are tight. We choose the class of 1-dof Henneberg-I graphs in order to take the next step in a systematic and graded program of combinatorial characterizations of efficient configuration spaces. In particular, the results presented here are the first characterizations that go beyond graphs that have connected and convex configuration spaces.

### Citations

195 |
On graphs and rigidity of plane skeletal structures
- Laman
- 1970
(Show Context)
Citation Context ...mbinatorial rigidity) terminology for which we refer the reader to, for example [16] [6] and [10]. In 2D, a graph G = (V, E) is wellconstrained or minimally rigid if it satisfies the Laman conditions =-=[12]-=-; i.e., |E| = 2|V | − 3 and |Es| ≤ 2|Vs| − 3 for all subgraphs Gs = (Vs, Es) of G; G is underconstrained or independent and not rigid if we have |E| < 2|V | − 3 and |Es| ≤ 2|Vs| − 3 for all subgraphs ... |

178 |
Distance Geometry and Molecular Conformation
- Crippen, Havel
- 1988
(Show Context)
Citation Context ... Distance Matrix in a given dimension; and finding a Euclidean Distance Matrix in a given dimension that closely approximates a given Metric Matrix (representing pairwise distances in a metric space) =-=[1, 3, 5]-=-. The latter problem also arises in the study of algorithms for low distortion embedding of metric spaces into Euclidean spaces of fixed dimension [2]. Both of these problems can in fact directly be v... |

66 | Solving Euclidean distance matrix completion problems via semidefinite programming
- Alfakih, Khandani, et al.
- 1999
(Show Context)
Citation Context ... Distance Matrix in a given dimension; and finding a Euclidean Distance Matrix in a given dimension that closely approximates a given Metric Matrix (representing pairwise distances in a metric space) =-=[1, 3, 5]-=-. The latter problem also arises in the study of algorithms for low distortion embedding of metric spaces into Euclidean spaces of fixed dimension [2]. Both of these problems can in fact directly be v... |

56 | A graph-constructive approach to solving systems of geometric constraints
- Fudos, Hoffmann
- 1997
(Show Context)
Citation Context ...s read off from p. Note: We will use standard and well-known geometric constraint solving (and the corresponding combinatorial rigidity) terminology for which we refer the reader to, for example [16] =-=[6]-=- and [10]. In 2D, a graph G = (V, E) is wellconstrained or minimally rigid if it satisfies the Laman conditions [12]; i.e., |E| = 2|V | − 3 and |Es| ≤ 2|Vs| − 3 for all subgraphs Gs = (Vs, Es) of G; G... |

31 | Correctness proof of a geometric constraint solver
- Fudos, Hoffmann
- 1996
(Show Context)
Citation Context ...ase non-edges for G ′. Further, (v9, v12) is also a base non-edge for G. Now we consider whether G ′ has low sampling complexity on (v9, v12) and (v3, v4). To do that, we refer to Theorem 1 proved in =-=[7]-=-: if a graph is Triangle-decomposable, we can perform the cluster merging (inverse operation of triangle-decomposition) in any order(a Church-Rosser Property) but finally we get one cluster which is t... |

29 |
Computing in Algebraic Extensions
- Loos
- 1983
(Show Context)
Citation Context ...e, exact operations. This model of computation is not as strong as the real RAM model that is normally used in computational geometry, that permits exact representation of arbitrary algebraic numbers =-=[13]-=-. Issues in exact geometric computation such as efficient and robust implementation of such a representation, for example using interval arithmetic, are beyond the scope of this manuscript. 1.3 Organi... |

25 | Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Badoiu, Dhamdhere, et al.
- 2005
(Show Context)
Citation Context ...nting pairwise distances in a metric space) [1, 3, 5]. The latter problem also arises in the study of algorithms for low distortion embedding of metric spaces into Euclidean spaces of fixed dimension =-=[2]-=-. Both of these problems can in fact directly be viewed as searching over a configuration space of an EDCS. 2.1 Exact, efficient configuration spaces Motivated by these applications, our emphasis is o... |

12 |
A theorem in the geometry of position
- Cayley
(Show Context)
Citation Context ...δ(E), δ∗ (F)). Here G ∪ F refers to a graph H := (V, E ∪ F). In other words, the representations employ Cayley parameters: distances or sometimes squared distances corresponding to the non-edges in F =-=[4]-=-. The set Φd F (G, δ) is the projection of the Cayley-Menger semi-algebraic set associated with (G, δ) on the Cayley parameters in F. As mentioned earlier, we refer to the representation Φd F (G, δ) a... |

12 |
Graph based geometric constraint solving: problems, progress and directions. AMS-DIMACS volume on Computer Aided Design
- Sitharam
- 2005
(Show Context)
Citation Context ...t δ is read off from p. Note: We will use standard and well-known geometric constraint solving (and the corresponding combinatorial rigidity) terminology for which we refer the reader to, for example =-=[16]-=- [6] and [10]. In 2D, a graph G = (V, E) is wellconstrained or minimally rigid if it satisfies the Laman conditions [12]; i.e., |E| = 2|V | − 3 and |Es| ≤ 2|Vs| − 3 for all subgraphs Gs = (Vs, Es) of ... |

8 | The nonsolvability by radicals of generic 3-connected planar graphs
- Owen, Power
(Show Context)
Citation Context ...dratically solvable for one of them, but not for the other. In fact, we ask for which G and f, the extreme graphs have a graph property called Treeor Triangle decomposability, which has been shown in =-=[15]-=- to be generically equivalent to Quadratic Solvability for planar graphs and the equivalence is strongly conjectured for all graphs. We say that such configuration spaces Φf(G, δ) have low sampling co... |

3 |
Vila-Marta and Josep Vilaplana-Pasto. Transforming an under-constrained geometric constraint problem into a well-constrained one
- Joan-Arinyo, Soto-Riera, et al.
- 2003
(Show Context)
Citation Context ...that relates quadratic solvability and Tree- or Triangle- decomposability for planar graphs. Concerning the use of Cayley parameters or non-edges for parametrizing the configuration space: the papers =-=[11]-=-, [16] and [19] study how to obtain “completions” of underconstrained graphs G, i.e, a set of non-edges F whose addition makes G well-constrained or minimally rigid. All are motivated by the need to e... |

2 |
Ta-Chung Wang and Yinyu Ye. Semidefinite programming based algorithms for sensor network localization
- Biswas, Lian
- 1953
(Show Context)
Citation Context ... Distance Matrix in a given dimension; and finding a Euclidean Distance Matrix in a given dimension that closely approximates a given Metric Matrix (representing pairwise distances in a metric space) =-=[1, 3, 5]-=-. The latter problem also arises in the study of algorithms for low distortion embedding of metric spaces into Euclidean spaces of fixed dimension [2]. Both of these problems can in fact directly be v... |

2 |
Geometric Under-Constraints
- Gao
- 2008
(Show Context)
Citation Context ...geometric complexity for example convexity; however, for this manuscript, these factors are subsumed in the sampling complexity since configuration space of this manuscript is a 1-parameter space. In =-=[8]-=- and [17] a series of exact combinatorial characterizations are given for connected, convex and complete configuration spaces of low sampling and realization complexity for general 2D and 3D EDCSs (in... |

2 | Combinatorial Classification of 2D Underconstrained Sytems - Gao, Sitharam - 2005 |

2 |
A constructive approach to calculate parameter ranges for systems of geometric constraints
- Meiden, Bronsvoort
(Show Context)
Citation Context ...aces in order to obtain the corresponding realizations. The problem has generally been considered too messy, and there has been no systematic, formal program to study this problem. On the other hand, =-=[14]-=- gives a collection of useful observations and heuristics for computing the interval endpoints in the configuration space descriptions of certain graphs that arise in real CAD applications. 4 Results ... |

2 | Well-constrained Completion and Decomposition for Underconstrained Geometric Constraint Problems
- Zhang, Gao
- 2006
(Show Context)
Citation Context ...adratic solvability and Tree- or Triangle- decomposability for planar graphs. Concerning the use of Cayley parameters or non-edges for parametrizing the configuration space: the papers [11], [16] and =-=[19]-=- study how to obtain “completions” of underconstrained graphs G, i.e, a set of non-edges F whose addition makes G well-constrained or minimally rigid. All are motivated by the need to efficiently obta... |

1 | Characterizing graphs with convex and connected configuration spaces. arXiv:0809.3935 [cs.CG
- Sitharam, Gao
(Show Context)
Citation Context ...c complexity for example convexity; however, for this manuscript, these factors are subsumed in the sampling complexity since configuration space of this manuscript is a 1-parameter space. In [8] and =-=[17]-=- a series of exact combinatorial characterizations are given for connected, convex and complete configuration spaces of low sampling and realization complexity for general 2D and 3D EDCSs (including d... |

1 |
Characterizing 1-Dof Tree-Decomposable graphs with efficient configuration space,” in preparation
- Sitharam, Gao
(Show Context)
Citation Context ... clusters and v1, v2 and v3 are shared vertices. A generalization of the results presented here from Henneberg-1 graphs to the larger class of Tree- or Triangle-decomposable graphs appears in [8] and =-=[18]-=-. A Simple 1-dof Henneberg-I graph G is obtained by removing a base edge f from a Henneberg-I graph (note that there can be more than 1 possible base edge for a given Henneberg-I graph, refer to Figur... |