Sciweavers

46 search results - page 6 / 10
» Efficient algorithms for large-scale local triangle counting
Sort
View
DSRT
2005
IEEE
13 years 9 months ago
3D Mesh Compression Using an Efficient Neighborhood-based Segmentation
Due to the popularity of polygonal models in the Virtual Reality applications, 3D mesh compression and segmentation are two active areas of 3D object modeling. Most existing 3D co...
Lijun Chen 0003, Nicolas D. Georganas
ICCV
2009
IEEE
15 years 14 days ago
Mode-Detection via Median-Shift
Median-shift is a mode seeking algorithm that relies on computing the median of local neighborhoods, instead of the mean. We further combine median-shift with Locality Sensitive...
Lior Shapira, Shai Avidan, Ariel Shamir
VISUALIZATION
2002
IEEE
14 years 11 days ago
QuadTIN: Quadtree based Triangulated Irregular Networks
Interactive visualization of large digital elevation models is of continuing interest in scientific visualization, GIS, and virtual reality applications. Taking advantage of the r...
Renato Pajarola, Marc Antonijuan, Roberto Lario
CGF
1999
126views more  CGF 1999»
13 years 7 months ago
A Shrink Wrapping Approach to Remeshing Polygonal Surfaces
Due to their simplicity and flexibility, polygonal meshes are about to become the standard representation for surface geometry in computer graphics applications. Some algorithms i...
Leif Kobbelt, Jens Vorsatz, Ulf Labsik, Hans-Peter...
MOBIHOC
2008
ACM
14 years 7 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao