Skip to Main content Skip to Navigation
Journal articles

A C-tree decomposition algorithm for 2D and 3D geometric constraint solving

Xiao-Shan Gao 1, 2 Qiang Lin 2 Gui-Fang Zhang 3, 2 
2 CAD - Computer Aided Design
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduced into basic merge patterns, which are the smallest problems we need to solve in order to solve the original problem in certain sense. Based on the C-tree decomposition algorithm, we implemented a software package MMP/Geometer. Experimental results show that MMP/Geometer finds the smallest decomposition for all the testing examples efficiently.
Document type :
Journal articles
Complete list of metadata
Contributor : Chine Publications Liama Connect in order to contact the contributor
Submitted on : Friday, January 12, 2007 - 5:14:32 PM
Last modification on : Friday, February 4, 2022 - 3:10:25 AM

Links full text




Xiao-Shan Gao, Qiang Lin, Gui-Fang Zhang. A C-tree decomposition algorithm for 2D and 3D geometric constraint solving. Computer-Aided Design, Elsevier, 2006, Computer-Aided Design, 38 (1), pp.1--13. ⟨10.1016/j.cad.2005.03.002⟩. ⟨inria-00124270⟩



Record views