1604 search results - page 30 / 321 » Approximation algorithms for developable surfaces |
135
click to vote
COMPGEOM
1996
ACM
15 years 5 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
106
click to vote
CVPR
2007
IEEE
16 years 3 months ago
2007
IEEE
Smoothly bent paper-like surfaces are developable. They are however difficult to minimally parameterize since the number of meaningful parameters is intrinsically dependent on the...
116
click to vote
CCCG
2007
15 years 2 months ago
2007
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on th...
130
click to vote
CAGD
2002
15 years 1 months ago
2002
We present an adaptive, hierarchical Hh-multiresolution reconstruction algorithm to model shell surface objects from a matched pair of triangulated surfaces. Shell surfaces are an...
113
click to vote
ICCSA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...