Sciweavers

205 search results - page 37 / 41
» On Deletion in Delaunay Triangulations
Sort
View
ESA
2004
Springer
117views Algorithms» more  ESA 2004»
14 years 29 days ago
Classroom Examples of Robustness Problems in Geometric Computations
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may c...
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan ...
ICCS
2004
Springer
14 years 29 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...
SMI
2003
IEEE
131views Image Analysis» more  SMI 2003»
14 years 26 days ago
Watermarking 2D Vector Maps in the Mesh-Spectral Domain
This paper proposes a digital watermarking algorithm for 2D vector digital maps. The watermark is a robust, informed-detection watermark to be used to prevent such abuses as an in...
Ryutarou Ohbuchi, Hiroo Ueda, Shuh Endoh
ICPR
2000
IEEE
13 years 12 months ago
Modeling Range Images with Bounded Error Triangular Meshes without Optimization
This paper presents a new technique for approximating range images by means of adaptive triangular meshes with a bounded approximation error and without applying optimization. Thi...
Angel Domingo Sappa, Miguel Angel García
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...