Abstract
Simultaneous spatial constraint problems can be approached algebraically, geometrically, or constructively. We examine how each approach performs, using several example problems, especially constraint problems involving lines. We also prove that there are at most 12 real tangents to four given spheres in R 3.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Work supported in part by NSF Grant CCR 99-02025, by ARO Contract 39136-MA, and by the Purdue Visualization Center.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C. Durand. Symbolic and Numerical Techniques for Constraint Solving. PhD thesis, Purdue University, Dept. of Comp. Sci., 1998.
C. Durand and C.M. Hoffmann. A systematic framework for solving geometric constraints analytically. J. of Symbolic Computation, 30:483–520, 2000.
I. Fudos and C.M. Hoffmann. A graph-constructive approach to solving systems of geometric constraints. ACM Trans on Graphics, 16:179–216, 1997.
X.S. Gao and C.C. Zhu. Geometric constraint solving with linkages and geometric method for polynomial equations-solving. In MM Research Preprints 18, pages 48–58. Academia Sincica, Institute of Systems Science, 1999.
J.X. Ge, S.C. Chou, and X.S. Gao. Geometric constraint satisfaction using optimization methods. Computer Aided Design, 31:867–879, 1999.
C.M. Hoffmann, A. Lomonosov, and M. Sitharam. Geometric constraint decomposition. In Geometric Constraint Solving and Applications, pages 170–195. Springer-Verlag, New York, 1998.
C.M. Hoffmann and P. Vermeer. Geometric constraint solving in R2 and R3. In Computing in Euclidean Geometry, pages 170–195. World Scientific Publishing, Singapore, 1995.
D. Lazard and J.P. Merlet. The (true) Stewart platform has 12 configurations. In Proceedings IEEE International Conference on Robotics and Automation, pages 2160–2165. IEEE, 1994.
I.G. Macdonald, J. Pach, and Th. Theobald. Common tangents to four unit balls in R 3. Discrete and Comp. Geometry, to appear.
D. Michelucci. Using Cayley Menger determinants. Web document available from http://www.emse.fr/~micheluc/MENGER/index.html.
A. Morgan. A homotopy for solving general polynomial systems that respects mhomogeneous structures. Applied Mathematics and Computation, 24: 101–113, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoffmann, C.M., Yuan, B. (2001). On Spatial Constraint Solving Approaches. In: Richter-Gebert, J., Wang, D. (eds) Automated Deduction in Geometry. ADG 2000. Lecture Notes in Computer Science(), vol 2061. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45410-1_1
Download citation
DOI: https://doi.org/10.1007/3-540-45410-1_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42598-4
Online ISBN: 978-3-540-45410-6
eBook Packages: Springer Book Archive