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

DOI10.1142/S0218195906002142MaRDI QIDQ3422216zbMATH OpenOpenAlexFDO

Authors 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

decompositiongeometric constraint solvingpolynomial time algorithmunder-constrained completion

Mathematics Subject Classification ID

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

Recommendations

• Well-constrained and under-constrained geometric constraint solving based on a D-tree decomposition
• scientific article; zbMATH DE number 1745032
• Geometric constraint solving with geometric transformation
• GPDOF — A FAST ALGORITHM TO DECOMPOSE UNDER-CONSTRAINED GEOMETRIC CONSTRAINT SYSTEMS: APPLICATION TO 3D MODELING
• scientific article; zbMATH DE number 1163555

Cites work

• A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
• Geometric construction by assembling solved subfigures
• scientific article; zbMATH DE number 3989126 (Why is no real title available?)

Cited in

(3)

• Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials
• Characterizing graphs with convex and connected Cayley configuration spaces
• Well-constrained and under-constrained geometric constraint solving based on a D-tree decomposition

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3422216)