Sciweavers

1071 search results - page 22 / 215
» Solving Geometric Constraint Systems
Sort
View
95
Voted
DAM
2000
137views more  DAM 2000»
14 years 9 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
69
Voted
IJCV
2006
120views more  IJCV 2006»
14 years 9 months ago
Contour Inferences for Image Understanding
We present a new approach to the algorithmic study of planar curves, with applications to estimations of contours in images. We construct spaces of curves satisfying constraints su...
Washington Mio, Anuj Srivastava, Xiuwen Liu
SAC
2010
ACM
15 years 4 months ago
Constraint-based LN-curves
We consider the design of parametric curves from geometric constraints such as distance from lines or points and tangency to lines or circles. We solve the Hermite problem with su...
Young Joon Ahn, Christoph M. Hoffmann
ADG
2004
Springer
108views Mathematics» more  ADG 2004»
15 years 3 months ago
Planar Generalized Stewart Platforms and Their Direct Kinematics
Abstract. In this paper, we introduce the concept of planar generalized Stewart platform (GSP) consisting of two rigid bodies connected with three constraints between three pairs o...
Gui-Fang Zhang, Xiao-Shan Gao
CDC
2010
IEEE
205views Control Systems» more  CDC 2010»
14 years 4 months ago
Geometric control of patterned linear systems
es of circulant matrices. Our class is broader than just circulants, and we study patterned systems using abstract algebra, specifically the observation that a set of matrices with...
Sarah C. Hamilton, Mireille E. Broucke