Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorFarre, James
dc.contributor.authorKleinschmidt, Helena
dc.contributor.authorSidman, Jessica
dc.contributor.authorJohn, Audrey St.
dc.contributor.authorStark, Stephanie
dc.contributor.authorTheran, Louis
dc.contributor.authorYu, Xilin
dc.date.accessioned2017-06-28T23:33:41Z
dc.date.available2017-06-28T23:33:41Z
dc.date.issued2016-10-01
dc.identifier.citationFarre , 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.001en
dc.identifier.issn0167-8396
dc.identifier.otherPURE: 243729739
dc.identifier.otherPURE UUID: 27d1fc65-2642-4eae-b475-2f0a3adf8261
dc.identifier.otherRIS: urn:513E72587DD01721E6907F076093BD37
dc.identifier.otherScopus: 84989836279
dc.identifier.otherWOS: 000384778900009
dc.identifier.urihttp://hdl.handle.net/10023/11110
dc.descriptionLouis 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.abstractAutomated 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.extent20
dc.language.isoeng
dc.relation.ispartofComputer Aided Geometric Designen
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.001en
dc.subjectSparsity matroiden
dc.subjectPebble game algorithmen
dc.subjectCad constraintsen
dc.subjectQA Mathematicsen
dc.subjectQA76 Computer softwareen
dc.subjectT-NDASen
dc.subject.lccQAen
dc.subject.lccQA76en
dc.titleAlgorithms for detecting dependencies and rigid subsystems for CADen
dc.typeJournal articleen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews.Pure Mathematicsen
dc.contributor.institutionUniversity of St Andrews.School of Mathematics and Statisticsen
dc.identifier.doihttps://doi.org/10.1016/j.cagd.2016.06.001
dc.description.statusPeer revieweden
dc.date.embargoedUntil2017-06-28


This item appears in the following Collection(s)

Show simple item record