Geometric constraints solving: some tracks

This paper presents some important issues and potential research tracks for Geometric Constraint Solving: the use of the simplicial Bernstein base to reduce the wrapping effect in interval methods, the computation of the dimension of the solution set with methods used to measure the dimension of fractals, the pitfalls of graph based decomposition methods, the alternative provided by linear algebra, the witness configuration method, the use of randomized provers to detect dependences between constraints, the study of incidence constraints, the search for intrinsic (coordinate-free) formulations and the need for formal specifications.

[1]  Xiao-Shan Gao,et al.  Geometric constraint solving via C-tree decomposition , 2003, SM '03.

[2]  Xiao-Shan Gao,et al.  Solving spatial basic geometric constraint configurations with locus intersection , 2002, SMA '02.

[3]  Benoit B. Mandelbrot,et al.  Fractal Geometry of Nature , 1984 .

[4]  J. C. Owen,et al.  Algebraic solution for geometry from dimensional constraints , 1991, SMA '91.

[5]  David Lesage,et al.  A Declarative Approach to a 2d Variational Modeler , 2002 .

[6]  Josef Hoschek,et al.  Handbook of Computer Aided Geometric Design , 2002 .

[7]  Nello Cristianini,et al.  An introduction to Support Vector Machines , 2000 .

[8]  Sebti Foufou,et al.  Using Cayley Menger Determinants , 2004 .

[9]  Christoph M. Hoffmann,et al.  A Systematic Framework for Solving Geometric Constraints Analytically , 2000, J. Symb. Comput..

[10]  Dominique Michelucci,et al.  Qualitative Study of Geometric Constraints , 1998 .

[11]  Dustin Boswell,et al.  Introduction to Support Vector Machines , 2002 .

[12]  Pierre Bourdet,et al.  Geometric Product Specification and Verification: Integration of Functionality , 2003 .

[13]  Adam Arbree,et al.  Geometric constraints within feature hierarchies , 2006, Comput. Aided Des..

[14]  Pascal Schreck,et al.  Formal resolution of geometrical constraint systems by assembling , 1997, SMA '97.

[15]  Sebti Foufou,et al.  Numerical decomposition of geometric constraints , 2005, SPM '05.

[16]  H. S. M. Coxeter.  The Beauty Of Geometry , 1999 .

[17]  Nicholas M. Patrikalakis,et al.  Robust interval solid modelling Part II: boundary evaluation , 1996, Comput. Aided Des..

[18]  Bernd Sturmfels,et al.  Algorithms in invariant theory , 1993, Texts and monographs in symbolic computation.

[19]  Carme Torras,et al.  A branch-and-prune algorithm for solving systems of distance constraints , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[20]  G. M.,et al.  Projective Geometry , 1938, Nature.

[21]  Philippe Serré.  Cohérence de la spécification d'un objet de l'espace euclidien à n dimensions , 2000 .

[22]  Jürgen Richter-Gebert.  Realization Spaces of Polytopes , 1996 .

[23]  Bruce Hendrickson,et al.  Conditions for Unique Graph Realizations , 1992, SIAM J. Comput..

[24]  Siegfried M. Rump,et al.  Symbolic Algebraic Methods and Verification Methods , 2001 .

[25]  Nicholas M. Patrikalakis,et al.  Computation of the solutions of nonlinear polynomial systems , 1993, Comput. Aided Geom. Des..

[26]  Christoph M. Hoffmann,et al.  Decomposition Plans for Geometric Constraint Systems, Part I: Performance Measures for CAD , 2001, J. Symb. Comput..

[27]  Sebti Foufou,et al.  Using Cayley-Menger determinants for geometric constraint solving , 2004, SM '04.

[28]  Ron Goldman,et al.  Analytic functions in computer-aided geometric design , 2002 .

[29]  Sebti Foufou,et al.  Geometric constraint solving: The witness configuration method , 2006, Comput. Aided Des..

[30]  Michael F. Barnsley,et al.  Fractals everywhere , 1988 .

[31]  D. Michelucci,et al.  Detecting Induced Incidences in the Projective Plane , 2004 .

[32]  Franck Bellemain.  Conception, réalisation et expérimentation d'un logiciel d'aide à l'enseignement de la géométrie : Cabri-géomètre , 1992 .

[33]  Ketan Kotecha,et al.  Global Optimization with Higher Order Inclusion Function Forms Part 1: A Combined Taylor-Bernstein Form , 2004, Reliab. Comput..

[34]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[35]  C. Hoffmann,et al.  Symbolic and numerical techniques for constraint solving , 1998 .

[36]  Carl A. Gunter,et al.  In handbook of theoretical computer science , 1990 .

[37]  Joseph A. Goguen,et al.  Modular Algebraic Specification of Some Basic Geometrical Constructions , 1988, Artif. Intell..

[38]  Philippe Serré,et al.  Analysis of functional geometrical specification , 2003 .

[39]  Shang-Ching Chou,et al.  Characteristic Sets and Gröbner Bases in Geometry Theorem Proving , 1989 .

[40]  Jürgen Garloff,et al.  Investigation of a subdivision based algorithm for solving systems of polynomial equations , 2001 .

[41]  Pascal Schreck,et al.  Geometric Construction by Assembling Solved Subfigures , 1998, Artif. Intell..

[42]  Philippe Serré,et al.  Formal Definition of Tolerancing in Cad and Metrology , 2002 .

[43]  Pascal Schreck,et al.  Solving Geometric Constraints Invariant Modulo the Similarity Group , 2003, ICCSA.

[44]  Ulrich Kortenkamp.  Foundations of dynamic geometry , 2000 .

[45]  Nello Cristianini,et al.  An Introduction to Support Vector Machines and Other Kernel-based Learning Methods , 2000 .

[46]  Sebastià Vila-Marta,et al.  Transforming an under-constrained geometric constraint problem into a well-constrained one , 2003, SM '03.

[47]  Lu Yang.  Distance Coordinates Used in Geometric Constraint Solving , 2002, Automated Deduction in Geometry.

[48]  S. Chou.  Mechanical Geometry Theorem Proving , 1987 .

[49]  Philippe Serré,et al.  Global Consistency of Dimensioning and Tolerancing , 1999 .

[50]  Robin J. Wilson,et al.  An Introduction to Matroid Theory , 1973 .

[51]  Jürgen Garloff,et al.  Solution of Systems of Polynomial Equation by Using Bernstein Expansion , 2001, Symbolic Algebraic Methods and Verification Methods.

[52]  Xiao-Shan Gao,et al.  Solving spatial basic geometric constraint configurations with locus intersection , 2004, Comput. Aided Des..

[53]  Gerald Farin,et al.  Curves and surfaces for computer aided geometric design , 1990 .

[54]  Xiao-Shan Gao,et al.  Spatial geometric constraint solving based on k-connected graph decomposition , 2006, SAC '06.

[55]  Pascal Schreck.  Robustness in CAD geometric constructions , 2001, Proceedings Fifth International Conference on Information Visualisation.

[56]  Arnold Neumaier,et al.  Introduction to Numerical Analysis , 2001 .

[57]  Bo Yuan,et al.  Making constraint solvers more usable: overconstraint problem , 2004, Comput. Aided Des..

[58]  Fabrice Rouillier,et al.  Bernstein's basis and real root isolation , 2004 .