Abstract
Geometric Constraint Solving Problems (GCSP) are nowadays routinely investigated in geometric modeling. The 3D Pentahedron problem is a GCSP defined by the lengths of its edges and the planarity of its quadrilateral faces, yielding to an under-constrained system of twelve equations in eighteen unknowns. In this work, we focus on solving the 3D Pentahedron problem in a more robust and efficient way, through a new formulation that reduces the underlying algebraic formulation to a well-constrained system of three equations in three unknowns, and avoids at the same time the use of placement rules that resolve the under-constrained original formulation. We show that geometric constraints can be specified in many ways and that some formulations are much better than others, because they are much smaller and they avoid spurious degenerate solutions. Several experimentations showing a considerable performance enhancement (×42) are reported in this paper to consolidate our theoretical findings.
Chapter PDF
Similar content being viewed by others
References
ALIAS-C++, A C++ Algorithms Library of Interval Analysis for equation Systems, http://www-sop.inria.fr/coprin/logiciels/ALIAS/ALIAS-C++/ALIAS-C++.html
Coxeter, H.: The Beauty of Geometry: Twelve Essays. Dover books on mathematics. Dover Publications (1999)
Durand, C.: Symbolic and numerical techniques for constraint solving. Ph.D. thesis, West Lafayette, IN, USA (1998)
Füenfzig, C., Michelucci, D., Foufou, S.: Polytope-based computation of polynomial ranges. Computer Aided Geometric Design 29(1), 18–29 (2012)
Hoffmann, C., Joan-Arinyo, R.: A brief on constraint solving. Computer-Aided Design and Applications 2(5), 655–663 (2005)
Hoffmann, C., Peters, J.: Geometric constraints for CAGD. In: Proceedings of the 3rd International Conference on Mathematical Methods for CAGD, Ulvic., pp. 237–254. Vanderbilt University Press (1995)
Hubbard, J., Hubbard, B.: Vector Calculus, Linear Algebra, and Differential Forms: A Unified Approach. Matrix Editions (2007)
Johnson, R., Young, J.: Modern Geometry: An Elementary Treatise on the Geometry of the Triangle and the Circle. Houghton, Mifflin Company (1929)
Laman, G.: On graphs and rigidity of plane skeletal structures. Journal of Engineering Mathematics 4(4), 331–340 (1970)
MacDuffee, C.: Theory of Equations. John Wiley (1954)
Merlet, J.P.: ALIAS: an interval analysis based library for solving and analyzing system of equations. In: SEA, pp. 14–16 (2000)
Michelucci, D., Foufou, S.: Using Cayley-Menger determinants for geometric constraint solving. In: Proceedings of the Ninth ACM Symposium on Solid Modeling and Applications, SM 2004, pp. 285–290. Eurographics Association (2004)
Michelucci, D., Foufou, S., Lamarque, L., Schreck, P.: Geometric constraints solving: Some tracks. In: Proceedings of the 2006 ACM Symposium on Solid and Physical Modeling, SPM 2006, pp. 185–196. ACM (2006)
Sommerville, D.: An Introduction to the Geometry of N Dimensions (1958)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Barki, H., Cane, JM., Michelucci, D., Foufou, S. (2014). New Geometric Constraint Solving Formulation: Application to the 3D Pentahedron. In: Elmoataz, A., Lezoray, O., Nouboud, F., Mammass, D. (eds) Image and Signal Processing. ICISP 2014. Lecture Notes in Computer Science, vol 8509. Springer, Cham. https://doi.org/10.1007/978-3-319-07998-1_68
Download citation
DOI: https://doi.org/10.1007/978-3-319-07998-1_68
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07997-4
Online ISBN: 978-3-319-07998-1
eBook Packages: Computer ScienceComputer Science (R0)