11784 search results - page 86 / 2357 » Interpolation for data structures |
SIGCSE
2005
ACM
15 years 4 months ago
2005
ACM
Red-black trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses. This paper describes alternatives ...
SIGCSE
1998
ACM
15 years 3 months ago
1998
ACM
tterns help narrow the gap between the abstract views of the data structures and their concrete implementations. The smaller the gap, the higher the level action. The more abstract...
103
click to vote
ISVC
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. Most character motion capture data does not contain secondary motions like detailed hand motion, therefore the resultant animation looks unnatural due to the stiffness of...
PG
1999
IEEE
15 years 3 months ago
1999
IEEE
The objective of this research is to apply the subdivision surface for surface fitting problems when generating surfaces from data points or polyhedral models. The basic idea is t...
CGF
2005
14 years 11 months ago
2005
This paper describes a method to obtain a closed surface that approximates a general 3D data point set with non-uniform density. Aside from the positions of the initial data point...