ABSTRACT
Constraint-based geometric modeling is the standard modeling paradigm in current modern CAD systems. Generally, the user defines constraints on the geometric objects and a solver is applied to find a configuration of the geometry, which satisfies these constraints. Proper application of these constraints allows rapid modification of the geometry without loss of design intent.
However, in current CAD systems, constraint solving for free-form geometric objects is generally limited. In particular, constraining global features such as limits on a curve's curvature values, are not supported.
In this paper we present a general method, within the constraint-based framework, to construct global constraints on free-form curves. The method starts by defining sufficient conditions on the curves in terms of an inequality expression, unlike local constraints the global constraint expression will be defined for all the domain of the curves. We then transform the expression into a symbolic polynomial, whose coefficients are symbolic expressions of the original curves. In the final step, a set of inequality constraints is applied in terms of the symbolic coefficients. These inequality constraints enforce the positivity of the symbolic polynomial.
The final inequality constraints are fed into the solver along with any other local constraints, which the user has provided on the curves. Therefore, the solution returned by the solver satisfies both the global constraints and any other local constraints the user supplies.
We have implemented a prototype of our method using existing commercial constraint solvers. We present results on several problems, which are handled as global geometric constraints using our method.
- M. P. D. Carmo. Differential Geometry of Curves and Surfaces. Prentice-Hall, 1976.Google Scholar
- Dassault Systemes Catia. http://www.3ds.com/products/catia/catia-discovery.Google Scholar
- E. Cohen, G. Elber, and R. F. Riesenfeld. Geometric Modeling with Splines: An Introduction. A. K. Peters, 2001. Google ScholarDigital Library
- Siemens PLM Software Components D-Cubed. http://www.plm.automation.siemens.com.Google Scholar
- G. Elber. Trimming local and global self-intersections in offset curves using distance maps. In IMA Conference on the Mathematics of Surfaces, pages 213--222, 2003.Google ScholarCross Ref
- G. E. Farin. Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide. Academic Press, 4th edition, 1996. Google ScholarDigital Library
- ALS Geometric Software. http://www.als.gr.Google Scholar
- C. Hoffmann. Constraint-based CAD. JCISE, 5(3):182--187, 2005.Google Scholar
- C. Hoffmann and R. Joan-Arinyo. Parametric modeling. In G. Farin, J. Hoschek, and M.-S. Kim, editors, Handbook of Computer Aided Geometric Design, pages 519--541. Elsevier, 2002.Google Scholar
- AutoDesk Inventor. http://www.autodesk.com.Google Scholar
- B. Juttler. Linear convexity conditions for parametric tensor-product Bézier surface patches. In T. N. T. Goodman and R. R. Martin, editors, Proceedings of the Mathematics of Surfaces VII Conference, pages 189--208, Winchester, UK, 1997. Information Geometers.Google Scholar
- LEDAS Ltd. http://www.ledas.com.Google Scholar
- PTC Pro/Engineer. http://www.ptc.com/products/proengineer.Google Scholar
- J.-K. Seong, G. Elber, and M.-S. Kim. Trimming local and global self-intersections in offset curves/surfaces using distance maps. Computer-Aided Design, 38(3):183--193, 2006. Google ScholarDigital Library
- Siemens PLM Software NX. http://www.plm.automation.siemens.com.Google Scholar
- Siemens PLM Software Solid Edge. http://www.plm.automation.siemens.com.Google Scholar
- Dassault Systemes SolidWorks Corporation. http://www.solidworks.com.Google Scholar
- S. Wolfram. The Mathematica Book. Wolfram Media, 5th edition, August 2003. Google ScholarDigital Library
- C. K. Yap. Fundamental problems of algorithmic algebra. Oxford University Press, Inc., New York, NY, USA, 2000. Google ScholarDigital Library
- Solving global geometric constraints on free-form curves
Recommendations
A graph-constructive approach to solving systems of geometric constraints
A graph-constructive approach to solving systems of geometric constraints capable of effeciently handling well-constrained, overconstrained, and underconstrained configurations is presented. The geometric constraint solver works in two phases: in the ...
Constrained fitting with free-form curves and surfaces
AbstractThe accurate reconstruction of engineering parts from measured data is a challenging problem, in particular, when various geometric constraints need to be imposed to meet requirements in downstream CAD/CAM applications. There is a wide ...
Graphical abstractDisplay Omitted
Highlights- Reverse engineering objects while imposing various geometric constraints.
- ...
Solving Geometric Constraints by a Hybrid Method
IV '01: Proceedings of the Fifth International Conference on Information VisualisationAbstract: In computer aided design, geometric modelling by constraints enables users to describe geometric objects by geometric constraints. Many resolution methods have been proposed for solving systems of geometric constraints. Geometric methods can ...
Comments