Sciweavers

2509 search results - page 305 / 502
» Abstract Geometrical Computation and Computable Analysis
Sort
View
IPSN
2007
Springer
16 years 19 days ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
COMPGEOM
2006
ACM
16 years 14 days ago
Envelope surfaces
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
Nico Kruithof, Gert Vegter
VRST
2003
ACM
15 years 11 months ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann
TVCG
2008
148views more  TVCG 2008»
15 years 6 months ago
Globally Optimal Surface Mapping for Surfaces with Arbitrary Topology
Computing smooth and optimal one-to-one maps between surfaces of same topology is a fundamental problem in graphics and such a method provides us a ubiquitous tool for geometric mo...
Xin Li, Yunfan Bao, Xiaohu Guo, Miao Jin, Xianfeng...
BMVC
2010
15 years 4 months ago
Background Modelling on Tensor Field for Foreground Segmentation
The paper proposes a new method to perform foreground detection by means of background modeling using the tensor concept. Sometimes, statistical modelling directly on image values...
Rui Caseiro, Jorge Batista, Pedro Martins