5 search results - page 1 / 1 » Weak Visibility of Two Objects in Planar Polygonal Scenes |
ICCSA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
SIGGRAPH
1993
ACM
13 years 9 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
SIGGRAPH
1998
ACM
13 years 9 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...
AIPR
2007
IEEE
13 years 11 months ago
2007
IEEE
Geometric structure of a scene can be reconstructed using many methods. In recent years, two prominent approaches have been digital photogrammetric analysis using passive stereo i...
EGITALY
2006
13 years 6 months ago
2006
In recent years the progress of 3D scanning technologies and the consequent growing commercialization of scanners opened a large spectrum of opportunities for many professionals. ...