Results 1  10
of
167
The sliderpinning problem
 CCCG
, 2007
"... A Laman mechanism is a flexible planar barandjoint framework with m ≤ 2n − 3 edges and exactly k = 2n − m degrees of freedom. The sliderpinning problem is to eliminate all the degrees of freedom of a Laman mechanism, in an optimal fashion, by individually fixing x or y coordinates of vertices. We ..."
Abstract

Cited by 384 (7 self)
 Add to MetaCart
A Laman mechanism is a flexible planar barandjoint framework with m ≤ 2n − 3 edges and exactly k = 2n − m degrees of freedom. The sliderpinning problem is to eliminate all the degrees of freedom of a Laman mechanism, in an optimal fashion, by individually fixing x or y coordinates of vertices
Infinite barjoint frameworks, crystals and operator theory
, 2010
"... A theory of flexibility and rigidity is developed for general infinite barjoint frameworks (G, p). Determinations of nondeformability through vanishing flexibility are obtained as well as sufficient conditions for deformability. Forms of infinitesimal flexibility are defined in terms of the operato ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
A theory of flexibility and rigidity is developed for general infinite barjoint frameworks (G, p). Determinations of nondeformability through vanishing flexibility are obtained as well as sufficient conditions for deformability. Forms of infinitesimal flexibility are defined in terms
Infinite BarJoint Frameworks
, 2008
"... Some aspects of a mathematical theory of rigidity and flexibility are developed for general infinite frameworks and two main results are obtained. In the first sufficient conditions, of a uniform local nature, are obtained for the existence of a proper flex of an infinite framework. In the second it ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Some aspects of a mathematical theory of rigidity and flexibility are developed for general infinite frameworks and two main results are obtained. In the first sufficient conditions, of a uniform local nature, are obtained for the existence of a proper flex of an infinite framework. In the second
HigherOrder Flexibility for a Bipartite Planar Framework
 Advances in Multibody Systems and Mechatronics. Inst. f. Mechanik und Getriebelehre, TU Graz, Duisburg 1999 (ISBN 3950110801
, 1999
"... Infinitesimally flexible frameworks are well known in kinematics, in particular recently as singular postures in robotics. The objective of this paper is to analyze a bipartite planar framework in view of higherorder infinitesimal flexibility. The characterization of firstorder flexibility of such ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
Infinitesimally flexible frameworks are well known in kinematics, in particular recently as singular postures in robotics. The objective of this paper is to analyze a bipartite planar framework in view of higherorder infinitesimal flexibility. The characterization of firstorder flexibility
Analyzing rigidity with pebble games
 Proceedings of the 24th Symposium on Computational Geometry (SoCG’08). Association for Computing Machinery
, 2008
"... How many pairwise distances must be prescribed between an unknown set of points, and how should they be distributed, to determine only a discrete set of possible solutions? These questions, and related generalizations, are central in a variety of applications. Combinatorial rigidity shows that in ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
) Figure 1: Barandjoint structures in twodimensions: (a) minimally rigid and (b) flexible. Planar barandjoint rigidity. A barandjoint framework consists of fixedlength bars connected by universal joints allowing full rotation of the incident bars. If the only motions maintaining the lengths of all
Enumerating planar minimally rigid graphs
 Proc. 12th Annual International Computing and Combinatorics Conference (COCOON 2006
, 2006
"... Motivated by the work of Kawamoto et al. [5], who first suggested the use of graph enumeration techniques as an engineering tool for finding an optimum mechanism design, we give an algorithm for enumerating all the planar Laman graphs embedded on a given generic set p of n points. Our algorithm is b ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. A graph on n vertices is a Laman graph if it has exactly 2n − 3 edges and every subset of n ′ < n vertices spans at most 2n ′ − 3 edges. A classical result in Rigidity Theory [3], due to Laman, states that the underlying graphs of generic minimally rigid barandjoint frameworks in dimension 2
PseudoTriangulations  a Survey
 CONTEMPORARY MATHEMATICS
"... A pseudotriangle is a simple polygon with exactly three convex vertices, and a pseudotriangulation is a facetoface tiling of a planar region into pseudotriangles. Pseudotriangulations appear as data structures in computational geometry, as planar barandjoint frameworks in rigidity theory an ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
A pseudotriangle is a simple polygon with exactly three convex vertices, and a pseudotriangulation is a facetoface tiling of a planar region into pseudotriangles. Pseudotriangulations appear as data structures in computational geometry, as planar barandjoint frameworks in rigidity theory
A Convex Optimization Framework for Dynamic Balancing of Planar Linkages
"... This paper focusses on reducing the dynamic reactions (shaking force, shaking moment and driving torque) of plane, crankrocker fourbars through counterweight addition. Determining the mass parameters of the counterweights constitutes an optimization problem, which is classically considered to be n ..."
Abstract
 Add to MetaCart
This paper focusses on reducing the dynamic reactions (shaking force, shaking moment and driving torque) of plane, crankrocker fourbars through counterweight addition. Determining the mass parameters of the counterweights constitutes an optimization problem, which is classically considered
Finding and Maintaining Rigid Components
"... We give the first complete analysis that the complexity of finding and maintaining rigid components of planar barandjoint frameworks and arbitrary ddimensional bodyandbar frameworks, using a family of algorithms called pebble games, is O(n 2). To this end, we introduce a new data structure prob ..."
Abstract

Cited by 11 (11 self)
 Add to MetaCart
We give the first complete analysis that the complexity of finding and maintaining rigid components of planar barandjoint frameworks and arbitrary ddimensional bodyandbar frameworks, using a family of algorithms called pebble games, is O(n 2). To this end, we introduce a new data structure
Results 1  10
of
167