53 search results - page 4 / 11 » Efficient Algorithms for Approximating Polygonal Chains |
EGH
2009
Springer
13 years 5 months ago
2009
Springer
Current GPUs rasterize micropolygons (polygons approximately one pixel in size) inefficiently. We design and analyze the costs of three alternative data-parallel algorithms for ra...
CAGD
2008
13 years 6 months ago
2008
In this paper we present a local fitting algorithm for converting smooth planar curves to Bsplines. For a smooth planar curve a set of points together with their tangent vectors a...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
CGF
2010
13 years 7 months ago
2010
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Mink...
CGF
2010
13 years 7 months ago
2010
Strange attractors of 3D vector field flows sometimes have a fractal geometric structure in one dimension, and smooth surface behavior in the other two. General flow visualization...