WELL-CONSTRAINED COMPLETION AND DECOMPOSITION FOR UNDER-CONSTRAINED GEOMETRIC CONSTRAINT PROBLEMS

DOI10.1142/S0218195906002142zbMath1104.65307OpenAlexW2159066050MaRDI QIDQ3422216

Gui-Fang Zhang, Xiao-Shan Gao

Publication date: 9 February 2007

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195906002142

zbMATH Keywords

decompositionpolynomial time algorithmgeometric constraint solvingunder-constrained completion

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials ⋮ Characterizing graphs with convex and connected Cayley configuration spaces

Cites Work

• Unnamed Item
• A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
• Geometric construction by assembling solved subfigures

This page was built for publication: WELL-CONSTRAINED COMPLETION AND DECOMPOSITION FOR UNDER-CONSTRAINED GEOMETRIC CONSTRAINT PROBLEMS