43 search results - page 3 / 9 » New Results on Visibility in Simple Polygons |
SIGGRAPH
1998
ACM
13 years 11 months ago
1998
ACM
We present an efficient algorithm for visibility sorting a set of moving geometric objects into a sequence of image layers which are composited to produce the final image. Inste...
CGI
2004
IEEE
13 years 11 months ago
2004
IEEE
We present a new algorithm for computing a polygonal surface from a union of balls. The method computes and connects the singular points of a given union of balls in an efficient ...
DIMACS
2001
13 years 8 months ago
2001
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
PAMI
2002
13 years 7 months ago
2002
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 ...
PRL
2007
13 years 7 months ago
2007
The bottleneck in interactive visual classification is the exchange of information between human and machine. We introduce the concept of the visible model, which is an ion of an ...