Incremental Delaunay Triangulation
Mostrando 1-2 de 2 artigos, teses e dissertações.
-
1. Uma proposta para a triangulação de Delaunay 2D e localização planar de pontos em OCaml
In this thesis, it is presented a planar point location algorithm. The algorithm was developed on top of two elements: - the method of slabs to divide the planar subdivision, is represented by a graph, allowing the fast identification of the region where the point being recalled is; - the Interval Multi-B-tree, a data structure derived from the B-tree, prepa
Publicado em: 2006
-
2. Reconstrução de superfície a partir de um conjunto não-organizado de pontos
Surface reconstruction is the area dedicated to get complex geometric models from a finite set of unorganized points of object surfaces. This area has become increasingly important in Geometric Modeling and other applications such as Computer Graphics, Computer Vision, Virtual Reality and Engineering. This Master thesis describes a broad survey of the main r
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 21/10/2005