Results 1  10
of
342
Are Tag Clouds Useful for Navigation? A NetworkTheoretic Analysis
"... Abstract—It is a widely held belief among designers of social tagging systems that tag clouds represent a useful tool for navigation. This is evident in, for example, the increasing number of tagging systems offering tag clouds for navigational purposes, which hints towards an implicit assumption th ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
construction algorithms. We also argue that any future algorithm needs to take into account the tradeoff between navigational and semantic properties of the generated tagresource networks. In particular, we introduce a simple method for estimating a socalled semantic penalty induced by a given tagcloud
On the Navigability of Social Tagging Systems
"... Abstract—It is a widely held belief among designers of social tagging systems that tag clouds represent a useful tool for navigation. This is evident in, for example, the increasing number of tagging systems offering tag clouds for navigational purposes, which hints towards an implicit assumption th ..."
Abstract

Cited by 14 (11 self)
 Add to MetaCart
construction algorithms. Our work is relevant for researchers interested in navigability of emergent hypertext structures, and for engineers seeking to improve the navigability of social tagging systems. I.
On the Navigability of Social Tagging Systems
"... Abstract—It is a widely held belief among designers of social tagging systems that tag clouds represent a useful tool for navigation. This is evident in, for example, the increasing number of tagging systems offering tag clouds for navigational purposes, which hints towards an implicit assumption th ..."
Abstract
 Add to MetaCart
construction algorithms. Our work is relevant for researchers interested in navigability of emergent hypertext structures, and for engineers seeking to improve the navigability of social tagging systems. I.
Defining PointSet Surfaces
, 2005
"... The MLS surface [Levin 2003], used for modeling and rendering with point clouds, was originally defined algorithmically as the output of a particular meshless construction. We give a new explicit definition in terms of the critical points of an energy function on lines determined by a vector field. ..."
Abstract

Cited by 180 (2 self)
 Add to MetaCart
The MLS surface [Levin 2003], used for modeling and rendering with point clouds, was originally defined algorithmically as the output of a particular meshless construction. We give a new explicit definition in terms of the critical points of an energy function on lines determined by a vector field
Model and Algorithms for Point Cloud Construction Using Digital Projection Patterns
"... This document contains the draft version of the following paper: T. Peng and S.K. Gupta. Model and algorithms for point cloud construction using ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This document contains the draft version of the following paper: T. Peng and S.K. Gupta. Model and algorithms for point cloud construction using
Constructing Laplace Operator from Point Clouds in R^d
, 2009
"... We present an algorithm for approximating the LaplaceBeltrami operator from an arbitrary point cloud obtained from a kdimensional manifold embedded in the ddimensional space. We show that this PCD Laplace (PointCloud Data Laplace) operator converges to the LaplaceBeltrami operator on the underl ..."
Abstract

Cited by 39 (5 self)
 Add to MetaCart
We present an algorithm for approximating the LaplaceBeltrami operator from an arbitrary point cloud obtained from a kdimensional manifold embedded in the ddimensional space. We show that this PCD Laplace (PointCloud Data Laplace) operator converges to the LaplaceBeltrami operator
Fast construction of kNearest Neighbor Graphs for Point Clouds
"... Abstract—We present a parallel algorithm for knearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existing methods: (1) Faster construction of knearest neighbor graphs in practice on multicore machines. (2) Less space ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
Abstract—We present a parallel algorithm for knearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existing methods: (1) Faster construction of knearest neighbor graphs in practice on multicore machines. (2) Less
Bounding Volume Construction using Point Clouds
"... Bounding volumes are used to optimize many graphic algorithms. They permit to decide quickly if a more exact test is likely to succeed or not. The exact test is only applied if the bounding volume test succeeds, which saves time in most cases. Two of the most prominent applications are ray tracing a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Bounding volumes are used to optimize many graphic algorithms. They permit to decide quickly if a more exact test is likely to succeed or not. The exact test is only applied if the bounding volume test succeeds, which saves time in most cases. Two of the most prominent applications are ray tracing
Bounding Volume Construction using Point Clouds
 12th Spring Conference on Computer Graphics
, 1996
"... . Bounding volumes are used to optimize many graphic algorithms. They permit to decide quickly if a more exact test is likely to succeed or not. The exact test is only applied if the bounding volume test succeeds, which saves time in most cases. Two of the most prominent applications are ray trac ..."
Abstract
 Add to MetaCart
. Bounding volumes are used to optimize many graphic algorithms. They permit to decide quickly if a more exact test is likely to succeed or not. The exact test is only applied if the bounding volume test succeeds, which saves time in most cases. Two of the most prominent applications are ray
Results 1  10
of
342