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

DOI10.1016/j.cad.2005.03.002zbMath1206.65083OpenAlexW2109485737WikidataQ60326042 ScholiaQ60326042MaRDI QIDQ628146

Qiang Lin, Gui-Fang Zhang, Xiao-Shan Gao

Publication date: 4 March 2011

Published in: CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00517706/file/Xiao-ShanGao2006a.pdf

zbMATH Keywords

graph algorithmdecomposition treegeometric constraint solvingbasic merge patterngeneral construction sequenceparametric CAD

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (6)

Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials ⋮ Tracking topological changes in parametric models ⋮ Body-and-cad geometric constraint systems ⋮ Classification of direct kinematics to planar generalized Stewart platforms ⋮ A formalization of geometric constraint systems and their decomposition ⋮ WELL-CONSTRAINED COMPLETION AND DECOMPOSITION FOR UNDER-CONSTRAINED GEOMETRIC CONSTRAINT PROBLEMS

Uses Software

• MMP/Geometer

This page was built for publication: A C-tree decomposition algorithm for 2D and 3D geometric constraint solving