Sciweavers

507 search results - page 93 / 102
» Fast Computational Methods for Visually Guided Robots
Sort
View
VG
2003
13 years 9 months ago
Cell Projection of Convex Polyhedra
Finite element methods commonly use unstructured grids as the computational domain. As a matter of fact, the volume visualization of these unstructured grids is a time consuming t...
Stefan Röttger, Thomas Ertl
JGTOOLS
2008
189views more  JGTOOLS 2008»
13 years 8 months ago
Subtractive Shadows: A Flexible Framework for Shadow Level of Detail
Abstract. We explore the implications of reversing the process of shadow computation for real-time applications that model complex reflectance and lighting (such as that specified ...
Christopher DeCoro, Szymon Rusinkiewicz
VISUALIZATION
1999
IEEE
14 years 6 days ago
Splatting Without the Blur
Splatting is a volume rendering algorithm that combines efficient volume projection with a sparse data representation: Only voxels that have values inside the iso-range need to be...
Klaus Mueller, Torsten Möller, Roger Crawfis
CGF
2010
157views more  CGF 2010»
13 years 5 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen
IMR
2004
Springer
14 years 1 months ago
Entkerner: A System for Removal of Globally Invisible Triangles from Large Meshes
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
Manfred Ernst, Frank Firsching, Roberto Grosso