98 search results - page 2 / 20 » Interpolation of triangle hierarchies |
UAI
2000
13 years 6 months ago
2000
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
CAD
2000
Springer
13 years 4 months ago
2000
Springer
Triangle strips are a widely used hardware-supported data-structure to compactly represent and efficiently render polygonal meshes. In this paper we survey the efficient generatio...
DM
2010
13 years 5 months ago
2010
For a non-negative integer T, we prove that the independence number of a graph G = (V, E) in which every vertex belongs to at most T triangles is at least uV f(d(u), T) where d(u)...
VMV
2007
13 years 6 months ago
2007
We present an algorithm for the efficient and accurate computation of geodesic distance fields on triangle meshes. We generalize the algorithm originally proposed by Surazhsky e...
EUROGRAPHICS
2010
Eurographics
14 years 1 months ago
2010
Eurographics
Interpolating vertex positions among triangle meshes with identical vertex-edge graphs is a fundamental part of many geometric modelling systems. Linear vertex interpolation is ro...