Sciweavers

1071 search results - page 21 / 215
» Solving Geometric Constraint Systems
Sort
View
RSS
2007
134views Robotics» more  RSS 2007»
14 years 11 months ago
A Discrete Geometric Optimal Control Framework for Systems with Symmetries
— This paper studies the optimal motion control of mechanical systems through a discrete geometric approach. At the core of our formulation is a discrete Lagrange-d’AlembertPon...
Marin Kobilarov, Mathieu Desbrun, Jerrold E. Marsd...
ICCV
2011
IEEE
13 years 9 months ago
Geometrically Consistent Elastic Matching of 3D Shapes: A Linear Programming Solution
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
Thomas Windheuser, Ulrich Schlickewei, Frank R. Sc...
GD
2006
Springer
15 years 1 months ago
Choosing Colors for Geometric Graphs Via Color Space Embeddings
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
Michael B. Dillencourt, David Eppstein, Michael T....
JFP
2008
97views more  JFP 2008»
14 years 8 months ago
HM(X) type inference is CLP(X) solving
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
Martin Sulzmann, Peter J. Stuckey
ISQED
2010
IEEE
123views Hardware» more  ISQED 2010»
14 years 11 months ago
Yield-constrained digital circuit sizing via sequential geometric programming
Circuit design under process variation can be formulated mathematically as a robust optimization problem with a yield constraint. Existing methods force designers to either resort...
Yu Ben, Laurent El Ghaoui, Kameshwar Poolla, Costa...