GPDOF — A FAST ALGORITHM TO DECOMPOSE UNDER-CONSTRAINED GEOMETRIC CONSTRAINT SYSTEMS: APPLICATION TO 3D MODELING

DOI10.1142/S0218195906002154zbMath1104.65306OpenAlexW2163216130MaRDI QIDQ3422218

Marta Wilczkowiak, Gilles Trombettoni

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/s0218195906002154

zbMATH Keywords

geometric constraintscomputer visiondecomposition algorithmimage information

Mathematics Subject Classification ID

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

Related Items (2)

Contractor programming ⋮ GPDOF

Cites Work

• Sketch-based pruning of a solution space within a formal geometric constraint solver
• Coverings of Bipartite Graphs
• An Algorithm for Subgraph Isomorphism
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: GPDOF — A FAST ALGORITHM TO DECOMPOSE UNDER-CONSTRAINED GEOMETRIC CONSTRAINT SYSTEMS: APPLICATION TO 3D MODELING