Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [32 references]  Display  Hide  Download

https://hal.inria.fr/inria-00517706
Contributor : Thss Tsinghua Connect in order to contact the contributor
Submitted on : Wednesday, September 15, 2010 - 11:42:41 AM
Last modification on : Tuesday, June 1, 2021 - 2:34:07 PM
Long-term archiving on: : Friday, December 2, 2016 - 5:19:14 AM

File

Xiao-ShanGao2006a.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00517706, version 1

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. ⟨inria-00517706⟩

Share

Metrics

Record views

93

Files downloads

388