1604 search results - page 33 / 321 » Approximation algorithms for developable surfaces |
3DPVT
2002
IEEE
14 years 1 months ago
2002
IEEE
Marching triangles is a method for producing a polygon mesh surface approximation composed of triangular facets which are approximately equilateral. This paper improves the Marchi...
CG
2005
Springer
13 years 8 months ago
2005
Springer
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
CVGIP
2007
13 years 8 months ago
2007
This paper presents a technique for creating a smooth, closed surface from a set of 2D contours, which have been extracted from a 3D scan. The technique interprets the pixels that...
VIP
2001
13 years 10 months ago
2001
In this paper, we describe a hidden line removal scheme for 2D cartoon images. The depths are introduced to the polylines of the image. The surfaces of the image are classified an...
ICIP
2003
IEEE
14 years 10 months ago
2003
IEEE
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...