BDBComp
Parceria:
SBC
Novos resultados em triangulações

Luiz Marcos Garcia Gonçalves

This paper describes a data structure with a restricted set of topological operations (creation, subdivision, and flip) used to construct planar triangulations. We discuss the implementation of algorithms to build some common triangulations (greedy, Delaunay, and rectangular adaptive) based on that structure. In order to allow the use of such a structure in the implementation of the Greedy Triangulation (GT), we define a new concept of GT and present an algorithm to build it. This GT algorithm has the same complexity as the best known algorithm for the traditional GT.

http://sibgrapi.sid.inpe.br/rep-/dpi.inpe.br/ambro/1998/06.02.16.57

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato: bdbcomp@lbd.dcc.ufmg.br
     Mantida por:
LBD