55 search results - page 2 / 11 » Paired Pointset Traversal |
CGF
2010
13 years 5 months ago
2010
Moving-Least-Squares (MLS) Surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-unif...
COMGEO
2006
ACM
13 years 5 months ago
2006
ACM
Let S be a finite set of points in the plane and let T (S) be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configu...
ICCAD
1999
IEEE
13 years 10 months ago
1999
IEEE
This paper proposes lazy group sifting for dynamic variable reordering during state traversal. The proposed method relaxes the idea of pairwise grouping of present state variables...
COMPSAC
2003
IEEE
13 years 11 months ago
2003
IEEE
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
W2GIS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...