11 search results - page 2 / 3 » Minimum-Length Polygon of a Simple Cube-Curve in 3D Space |
IVC
2007
13 years 5 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...
COMPGEOM
1991
ACM
13 years 8 months ago
1991
ACM
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
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 ...
SI3D
2009
ACM
13 years 10 months ago
2009
ACM
We present an approach for rendering the surface of particle-based fluids that is simple to implement, has real-time performance with a configurable speed/quality trade-off, and...
SI3D
2009
ACM
14 years 3 days 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...