%0 Conference Proceedings
%4 sid.inpe.br/sibgrapi/2013/02.17.22.03
%2 sid.inpe.br/sibgrapi/2013/02.17.22.03.27
%@isbn 978-85-7669-273-7
%A Oliveira, Antonio,
%A Nascimento, Sara do,
%A Meerbaum, Sonja A. L.,
%@affiliation Programa de Engenharia de Sistemas (COPPE) da Universidade Federal do Rio de Janeiro (UFRJ)
%@affiliation Programa de Engenharia de Sistemas (COPPE) da Universidade Federal do Rio de Janeiro (UFRJ)
%@affiliation Programa de Engenharia de Sistemas (COPPE) da Universidade Federal do Rio de Janeiro (UFRJ)
%T Using fields of directions defined on a triangulation to obtain a topology preserving continuous transformation of a polygon into another
%B Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens, 8 (SIBGRAPI)
%D 1995
%E Lotufo, Roberto de Alencar,
%E Mascarenhas, Nelson Delfino d'Ávila,
%S Anais
%8 25 - 27 out. 1995
%J Porto Alegre
%C São Carlos
%K direction fields, triangulation, polygon.
%X In this article we present an algorithm for the following problem: Obtain a continuous transformation of any simple polygon (L (o)) into another (L (1)) with the same number of vertices, generating only simple polygons in between, that is: without introducing contour loops or whiskers during the transformation. The transformation should also take every vertex of one polygon into a corresponding one on the other. None of the best know strategies for Contour Shape Interpolation can solve the general version of this problem, although simple multi-stage transformations methods can do it. Multi-stages transformations however, generate intermediate polygons whose shape is not correlated to those of the extreme ones. The approach which will be presented here although elaborate, offers much better possibilities of getting a real blend of the extreme polygons shape at any intermediate instance. A Continuous Transformation obtained by that method is derived from another one between two Fields of Directions (D (i), i=0, 1) defined on the same Triangulation T of an Annular Region (U) containing the given polygons. Every trajectory of D (i) cross L (i) exactly once what allows us to define an homeomorphism between L (i) and the graph of a continuous function defined on the external border of U. Besides finding the D (i) s and transforming one into the other the method makes use of three more interpolation steps. The overall complexity of the non-optimized version of the algorithm that will be described here, is O (ITI²).
%P 95-102
%@language en
%9 Modelagem Geométrica
%3 12 Using fields od directions.pdf