Sciweavers

346 search results - page 15 / 70
» On the sizes of Delaunay meshes
Sort
View
CGI
2001
IEEE
13 years 11 months ago
Polygonizing Non-Uniformly Distributed 3D Points by Advancing Mesh Frontiers
30 digitization devices produce very large sets of 3 0 points sampled from the suqaces of the objects being scanned. A mesh construction procedure needs to be:upplied to derive po...
Indriyati Atmosukarto, Luping Zhou, Wee Kheng Leow...
ICCS
2004
Springer
14 years 27 days ago
Velocity Field Modelling for Pollutant Plume Using 3-D Adaptive Finite Element Method
Air pollution models usually start from the computation of the velocity field of a fluid. In this paper, we present a model for computing that field based on the contribution of...
Gustavo Montero, Rafael Montenegro, José Ma...
CCCG
2010
13 years 9 months ago
Blocking delaunay triangulations
Given a set B of n blue points in general position, we say that a set of red points R blocks B if in the Delaunay triangulation of B R there is no edge connecting two blue points...
Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl,...
SGP
2003
13 years 8 months ago
Provably Good Surface Sampling and Approximation
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
Steve Oudot, Jean-Daniel Boissonnat
IMR
2005
Springer
14 years 1 months ago
A fews snags in mesh adaptation loops
The first stage in an adaptive finite element scheme (cf. [CAS95, bor1]) consists in creating an initial mesh of a given domain Ω, which is used to perform an initial computati...
Frédéric Hecht