#### Filter Results:

- Full text PDF available (24)

#### Publication Year

1989

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Brigitte Servatius, Walter Whiteley
- SIAM J. Discrete Math.
- 1999

Configurations of points in the plane constrained by directions only or by lengths alone lead to equivalent theories known as parallel drawings and infinitesimal rigidity of plane frameworks. We combine these two theories by introducing a new matroid on the edge set of the complete graph with doubled edges to describe the combinatorial properties of… (More)

- Brigitte Servatius, Offer Shai, Walter Whiteley
- Eur. J. Comb.
- 2010

We introduce the idea of Assur graphs, a concept originally developed and exclusively employed in the literature of the kinematics community. The paper translates the terminology, questions, methods and conjectures from the kinematics terminology for one degree of freedom linkages to the terminology of Assur graphs as graphs with special properties in… (More)

- Bill Jackson, Brigitte Servatius, Herman Servatius
- Journal of Graph Theory
- 2007

Laman's characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and exploited by L. Lovász and Y. Yemini. Global rigidity has only recently been characterized by a combination of two results due to T. Jordán and the first named author, and R. Connelly,… (More)

- Brigitte Servatius, Herman Servatius
- Discrete Mathematics
- 1996

We consider the three forms of self-duality that can be exhibited by a planar graph G, map self-duality, graph self-duality and matroid self-duality. We show how these concepts are related with each other and with the connectivity of G. We use the geometry of self-dual polyhedra together with the structure of the cycle matroid to construct all self-dual… (More)

- Brigitte Servatius
- SIAM J. Discrete Math.
- 1989

We consider the 2-dimensional generic rigidity matroid R(G) of a graph G. The notions of vertex and edge birigidity are introduced. We prove that vertex birigidity of G implies the connectivity of R(G) and that the connectivity of R(G) implies the edge birigidity of G. These implications are not equivalences. A class of minimal vertex birigid graphs is… (More)

- Ruth Haas, David Orden, +6 authors Walter Whiteley
- Symposium on Computational Geometry
- 2003

Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with <i>pointed</i> vertices (incident to an angle larger than <i>p</i>). In this paper we prove that the opposite statement is also true, namely that planar minimally rigid graphs always admit pointed embeddings, even under certain natural topological and combinatorial… (More)

Rigidity We are all familiar with frameworks of rods attached at joints. A rod and joint framework gives rise to a simple mathematical model consisting of line segments in Euclidean 3-space with common endpoints. A deformation is a continuous one-parameter family of such frameworks. If a framework has only trivial deformations , e.g. translations and… (More)

- Carl Droms, Brigitte Servatius, Herman Servatius
- Electr. J. Comb.
- 1995

We expand on Tutte's theory of 3-blocks for 2-connected graphs, generalizing it to apply to infinite, locally finite graphs, and giving necessary and sufficient conditions for a labeled tree to be the 3-block tree of a 2-connected graph.

- Brigitte Servatius, Offer Shai, Walter Whiteley
- Eur. J. Comb.
- 2010

In our previous paper, we presented the combinatorial theory for minimal isostatic pinned frameworks-Assur graphs-which arise in the analysis of mechanical linkages. In this paper we further explore the geometric properties of Assur graphs, with a focus on singular realizations which have static self-stresses. We provide a new geometric characterization of… (More)

- Brigitte Servatius, Herman Servatius
- Discrete Mathematics
- 1994

We show how to recursively construct all self–dual maps on the sphere together with their self–dualities, and classify them according to their edge–permutations. Although several well known classes of self–dual graphs, e.g., the wheels, have been known since the last century, [7], the general characteristics of self–dual graphs have only recently begun to… (More)