Correctness proof of a geometric constraint solver

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.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.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.journalNameInternational Journal of Computational Geometry & Applicationsen
heal.journalTypepeer reviewed-
heal.languageen-
heal.publicationDate1996-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.typejournalArticle-
heal.type.elΆρθρο Περιοδικούel
heal.type.enJournal articleen

Αρχεία

Φάκελος/Πακέτο αδειών

Προβολή: 1 - 1 of 1
Φόρτωση...
Μικρογραφία εικόνας
Ονομα:
license.txt
Μέγεθος:
1.74 KB
Μορφότυπο:
Item-specific license agreed upon to submission
Περιγραφή: