1604 search results - page 2 / 321 » Approximation algorithms for developable surfaces |
COMPGEOM
2000
ACM
13 years 10 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
GMP
2006
IEEE
14 years 10 days ago
2006
IEEE
CVGIP
1999
13 years 6 months ago
1999
CAD
2006
Springer
13 years 6 months ago
2006
Springer
Fat conic section and fat conic spline are defined. With well established properties of fat conic splines, the problem of approximating a ruled surface by a tangent smooth cone sp...
PG
2007
IEEE
14 years 16 days ago
2007
IEEE
We introduce an algorithm for approximating a 2manifold 3D mesh by a set of developable surfaces. Each developable surface is a generalized cylinder represented as a strip of tria...