Sciweavers

2188 search results - page 289 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
TOG
2002
127views more  TOG 2002»
15 years 2 months ago
Progressive lossless compression of arbitrary simplicial complexes
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
Pierre-Marie Gandoin, Olivier Devillers
137
Voted
TOG
2008
120views more  TOG 2008»
15 years 2 months ago
Shading-based surface editing
We present a system for free-form surface modeling that allows a user to modify a shape by changing its rendered, shaded image using stroke-based drawing tools. User input is tran...
Yotam I. Gingold, Denis Zorin
PROCEDIA
2010
67views more  PROCEDIA 2010»
15 years 1 months ago
Using the feasible set method for rezoning in ALE
One of the steps in the Arbitrary Lagrangian Eulerian (ALE) algorithm is the improvement of the quality of the computational mesh. This step, commonly referred to as rezoning, is ...
Markus Berndt, Milan Kucharik, Mikhail J. Shashkov
RAS
2010
127views more  RAS 2010»
15 years 1 months ago
Maximum-likelihood sample-based maps for mobile robots
— The problem of representing environments of a mobile robot has been studied intensively in the past. The predominant approaches for geometric representations are gridbased or l...
Daniel Meyer-Delius, Wolfram Burgard
TVCG
2010
162views more  TVCG 2010»
15 years 1 months ago
Computing Robustness and Persistence for Images
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...
Paul Bendich, Herbert Edelsbrunner, Michael Kerber