A C-Tree Decomposition Algorithm for 2D and 3D Geometric Constraint Solving - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computer-Aided Design Year : 2006

A C-Tree Decomposition Algorithm for 2D and 3D Geometric Constraint Solving

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.
Fichier principal
Vignette du fichier
Xiao-ShanGao2006a.pdf (536.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00517706 , version 1 (15-09-2010)

Identifiers

  • HAL Id : inria-00517706 , version 1

Cite

Xiao-Shan Gao, Qiang Lin, Gui-Fang Zhang. A C-Tree Decomposition Algorithm for 2D and 3D Geometric Constraint Solving. Computer-Aided Design, 2006. ⟨inria-00517706⟩
100 View
437 Download

Share

Gmail Facebook Twitter LinkedIn More