Sciweavers

6393 search results - page 3 / 1279
» Randomized Algorithms on the Mesh
Sort
View
DCC
2003
IEEE
14 years 5 months ago
Estimation-Quantization Geometry Coding Using Normal Meshes
We propose a new algorithm for compressing three-dimensional triangular mesh data used for representing surfaces. We apply the EstimationQuantization (EQ) algorithm originally des...
Sridhar Lavu, Hyeokho Choi, Richard G. Baraniuk
SODA
1994
ACM
133views Algorithms» more  SODA 1994»
13 years 7 months ago
Derandomizing Algorithms for Routing and Sorting on Meshes
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
3DOR
2008
13 years 8 months ago
Markov Random Fields for Improving 3D Mesh Analysis and Segmentation
Mesh analysis and clustering have became important issues in order to improve the efficiency of common processing operations like compression, watermarking or simplification. In t...
Guillaume Lavoué, Christian Wolf
ICRA
1995
IEEE
188views Robotics» more  ICRA 1995»
13 years 9 months ago
Fast Approximation of Range Images by Triangular Meshes Generated through Adaptive Randomized Sampling
This paper describes and evaluates an efficient technique that allows the fast generation of 3D triangular meshes from range images avoiding optimization procedures. Such a tool ...
Miguel Angel García
EUROPAR
2001
Springer
13 years 10 months ago
Optimal Many-to-One Routing on the Mesh with Constant Queues
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
Andrea Pietracaprina, Geppino Pucci