Sciweavers

713 search results - page 30 / 143
» Laplacian mesh optimization
Sort
View
ECCV
2004
Springer
14 years 9 months ago
User Assisted Separation of Reflections from a Single Image Using a Sparsity Prior
When we take a picture through transparent glass the image we obtain is often a linear superposition of two images: the image of the scene beyond the glass plus the image of the sc...
Anat Levin, Yair Weiss
EUROPAR
2001
Springer
14 years 1 days 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
SC
1993
ACM
13 years 11 months ago
Optimal fully adaptive wormhole routing for meshes
A deadlock-free fully adaptive routing algorithm for 2D meshes which is optimal in the number of virtual channels required and in the number of restrictions placed on the use of t...
Loren Schwiebert, D. N. Jayasimha
DCC
2003
IEEE
14 years 7 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
CGF
2010
135views more  CGF 2010»
13 years 7 months ago
Designing Quad-dominant Meshes with Planar Faces
We study the combined problem of approximating a surface by a quad mesh (or quad-dominant mesh) which on the one hand has planar faces, and which on the other hand is aestheticall...
Mirko Zadravec, Alexander Schiftner, Johannes Wall...