Delaunay Algorithm
Mostrando 1-5 de 5 artigos, teses e dissertações.
-
1. Delaunay refinement algorithm to sequential, adaptable meshes and with parallel computing. / Algoritmo de refinamento de Delaunay a malhas seqüenciais, adaptativas e com processamento paralelo.
Este trabalho apresenta o desenvolvimento de um gerador de malha de elementos finitos baseado no Algoritmo de Refinamento de Delaunay. O pacote é versátil e pode ser aplicado às malhas seriais e adaptativas ou à decomposição de uma malha inicial grossa ou pré-refinada usando processamento paralelo. O algoritmo desenvolvido trabalha com uma entrada de
Publicado em: 2007
-
2. 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
-
3. 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
-
4. Finite element-based model for crack propagation in polycrystalline materials
In this paper, we use an extended form of the finite element method to study failure in polycrystalline microstructures. Quasi-static crack propagation is conducted using the extended finite element method (X-FEM) and microstructures are simulated using a kinetic Monte Carlo Potts algorithm. In the X-FEM, the framework of partition of unity is used to enrich
Computational & Applied Mathematics. Publicado em: 2004-12
-
5. AN ALGORITHM FOR CURVE RECONSTRUCTION FROM SPARSE POINTS / UM ALGORITMO PARA RECONSTRUÇÃO DE CURVAS A PARTIR DE PONTOS ESPARSOS
Curve and surface reconstruction from sparse data has been recognized as an important problem in computer graphics. Non structured data points (i.e., a set of points with no knowledge of connectivity and proximity) together with the existence of noise make this problem quite difficult. In order to solve it, several techniques have been proposed, such as, som
Publicado em: 2003