A rewrite system to build planar subdivisions
Résumé
Algebraic specifications allied to rewriting are more and more used in design and logical prototyping of programs. We show how these techniques can be applied to a basic problem in computational geometry, namely the construction of planar subdivisions. We build up a simple, complete and convergent system of rules to cope with this problem and suggest a formal method to study and classify the specified algorithms.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...