Sciweavers

225 search results - page 45 / 45
» Real-time Computation of Area Shadows - A Geometrical Algori...
Sort
View
VMV
2004
185views Visualization» more  VMV 2004»
13 years 5 months ago
Convexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
Stefan Röttger, Stefan Guthe, Andreas Schiebe...
SCALESPACE
2007
Springer
13 years 10 months ago
Non-negative Sparse Modeling of Textures
This paper presents a statistical model for textures that uses a non-negative decomposition on a set of local atoms learned from an exemplar. This model is described by the varianc...
Gabriel Peyré
SMA
2009
ACM
132views Solid Modeling» more  SMA 2009»
13 years 11 months ago
Robust Voronoi-based curvature and feature estimation
Many algorithms for shape analysis and shape processing rely on accurate estimates of differential information such as normals and curvature. In most settings, however, care must...
Quentin Mérigot, Maks Ovsjanikov, Leonidas ...
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
13 years 11 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
COMCOM
2006
147views more  COMCOM 2006»
13 years 4 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das