Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/11089
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFudos, I.en
dc.contributor.authorHoffmann, C. M.en
dc.date.accessioned2015-11-24T17:02:44Z-
dc.date.available2015-11-24T17:02:44Z-
dc.identifier.issn0218-1959-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/11089-
dc.rightsDefault Licence-
dc.subjectgeometric constraint solvingen
dc.subjectcomputer aided designen
dc.subjectsystemsen
dc.titleCorrectness proof of a geometric constraint solveren
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate1996-
heal.abstractWe present a correctness proof of a graph-directed variational geometric constraint solver. First, we prove that the graph reduction that establishes the sequence in which to apply the construction steps defines a terminating confluent reduction system, in the case of well-constrained graphs. For overconstrained problems there may not be a unique normal form. Underconstrained problems, on the other hand, do have a unique normal form. Second, we prove that all geometric solutions found using simple root-selection rules must place certain triples of elements in the same topological order, no matter which graph reduction sequence they are based on. Moreover, we prove that this implies that the geometric solutions derived by different reduction sequences must be congruent. Again, this result does not apply to overconstrained problems.en
heal.journalNameInternational Journal of Computational Geometry & Applicationsen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Files in This Item:
File Description SizeFormat 
fudos-1996-Correctness proof of a geometric constraint solver.pdf172.69 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons