Files in this item
Algorithms for detecting dependencies and rigid subsystems for CAD
Item metadata
dc.contributor.author | Farre, James | |
dc.contributor.author | Kleinschmidt, Helena | |
dc.contributor.author | Sidman, Jessica | |
dc.contributor.author | John, Audrey St. | |
dc.contributor.author | Stark, Stephanie | |
dc.contributor.author | Theran, Louis | |
dc.contributor.author | Yu, Xilin | |
dc.date.accessioned | 2017-06-28T23:33:41Z | |
dc.date.available | 2017-06-28T23:33:41Z | |
dc.date.issued | 2016-10-01 | |
dc.identifier.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 | en |
dc.identifier.issn | 0167-8396 | |
dc.identifier.other | PURE: 243729739 | |
dc.identifier.other | PURE UUID: 27d1fc65-2642-4eae-b475-2f0a3adf8261 | |
dc.identifier.other | RIS: urn:513E72587DD01721E6907F076093BD37 | |
dc.identifier.other | Scopus: 84989836279 | |
dc.identifier.other | WOS: 000384778900009 | |
dc.identifier.other | ORCID: /0000-0001-5282-4800/work/73701811 | |
dc.identifier.uri | https://hdl.handle.net/10023/11110 | |
dc.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. | en |
dc.description.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. | |
dc.format.extent | 20 | |
dc.language.iso | eng | |
dc.relation.ispartof | Computer Aided Geometric Design | en |
dc.rights | © 2016, Elsevier. This work is made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at www.sciencedirect.com / https://dx.doi.org/10.1016/j.cagd.2016.06.001 | en |
dc.subject | Sparsity matroid | en |
dc.subject | Pebble game algorithm | en |
dc.subject | Cad constraints | en |
dc.subject | QA Mathematics | en |
dc.subject | QA76 Computer software | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA | en |
dc.subject.lcc | QA76 | en |
dc.title | Algorithms for detecting dependencies and rigid subsystems for CAD | en |
dc.type | Journal article | en |
dc.description.version | Postprint | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.contributor.institution | University of St Andrews. School of Mathematics and Statistics | en |
dc.identifier.doi | https://doi.org/10.1016/j.cagd.2016.06.001 | |
dc.description.status | Peer reviewed | en |
dc.date.embargoedUntil | 2017-06-28 |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.