Combinatorial characterization of the Assur graphs from engineering

Authors:
Brigitte Servatius;Offer Shai;Walter Whiteley
Affiliations:
Mathematics Department, Worcester Polytechnic Institute, United States;Faculty of Engineering, Tel-Aviv University, Israel;Department of Mathematics and Statistics, York University Toronto, ON, Canada
Venue:
European Journal of Combinatorics
Year:
2010

Citing 3
Cited 2

An algorithm for two-dimensional rigidity percolation: the pebble game

Journal of Computational Physics
Rigidity and scene analysis

Handbook of discrete and computational geometry
A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid

Journal of Combinatorial Theory Series B

Geometric properties of Assur graphs

European Journal of Combinatorics
Directed graphs, decompositions, and spatial linkages

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is to introduce new tools for studying the following two important and difficult problems in R^3: (1) The Minkowski problem (to prescribe the Gauss curvature) for hedgehogs (i.e., for Minkowski differences of convex bodies); (2) ...