Algorithms for detecting dependencies and rigid subsystems for CAD
Abstract
Automated approaches for detecting dependencies in structures created with Computer Aided Design software are critical for developing robust solvers and providing informative user feedback. We model a set of geometric constraints with a bi-colored multigraph and give a graph-based pebble game algorithm that allows us to determine combinatorially if there are generic dependencies. We further use the pebble game to yield a decomposition of the graph into factor graphs which may be used to give a user detailed feedback about dependent substructures in a specific realization of a system of CAD constraints with non-generic properties.
Citation
Farre , J , Kleinschmidt , H , Sidman , J , John , A S , Stark , S , Theran , L & Yu , X 2016 , ' Algorithms for detecting dependencies and rigid subsystems for CAD ' , Computer Aided Geometric Design , vol. 47 , pp. 130-149 . https://doi.org/10.1016/j.cagd.2016.06.001
Publication
Computer Aided Geometric Design
Status
Peer reviewed
ISSN
0167-8396Type
Journal article
Description
Louis Theran is partially supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007–2013)/ERC grant agreement No. 247029-SDModels, Academy of Finland (AKA) project COALESCE, and the Hutchcroft fund.Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.