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.
Type de document :
Article dans une revue
Computer-Aided Design, Elsevier, 2006, Computer-Aided Design, 38 (1), pp.1--13. 〈10.1016/j.cad.2005.03.002〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00124270
Contributeur : Chine Publications Liama <>
Soumis le : vendredi 12 janvier 2007 - 17:14:32
Dernière modification le : vendredi 25 mai 2018 - 12:02:04

Identifiants

Collections

Citation

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〉

Partager

Métriques

Consultations de la notice

184