Sciweavers

81 search results - page 12 / 17
» Triangle Strip Compression
Sort
View
TOG
2002
127views more  TOG 2002»
13 years 8 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
VMV
2008
120views Visualization» more  VMV 2008»
13 years 10 months ago
Thinning Mesh Animations
Three-dimensional animation sequences are often represented by a discrete set of compatible triangle meshes. In order to create the illusion of a smooth motion, a sequence usually...
Tim Winkler, Jens Drieseberg, Kai Hormann, Alexand...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 11 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
SI3D
2005
ACM
14 years 2 months ago
ZP+: correct Z-pass stencil shadows
We present a novel algorithm for the rendering of hard shadows cast by a point light source. The well-known Z-pass method for rasterizing shadow volumes is not always correct. Our...
Samuel Hornus, Jared Hoberock, Sylvain Lefebvre, J...
KR
1998
Springer
14 years 23 days ago
On Measuring Plan Quality (A Preliminary Report)
By using an example from a robot navigating domain, we argue that to specify declaratively the behavior of an agent, we need to have a formal and explicit notion of \quality plans...
Fangzhen Lin