12 search results - page 2 / 3 » Approximation of 3D Shortest Polygons in Simple Cube Curves |
ICPR
2000
IEEE
13 years 9 months ago
2000
IEEE
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
CAIP
2007
Springer
13 years 8 months ago
2007
Springer
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary a...
IVC
2007
13 years 4 months ago
2007
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
SI3D
2009
ACM
13 years 11 months ago
2009
ACM
We propose a view-dependent adaptive subdivision algorithm for rendering parametric surfaces on parallel hardware. Our framework allows us to bound the screen space error of a pie...
CGF
2005
13 years 4 months ago
2005
In this paper, we present a new method for surface extraction from volume data which preserves sharp features, maintains consistent topology and generates surface adaptively witho...