140 search results - page 7 / 28 » Computing the visibility graph of points within a polygon |
ESA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Modern computer graphics systems are able to render sophisticated 3D scenes consisting of millions of polygons. For most camera positions only a small collection of these...
VISUALIZATION
1999
IEEE
15 years 3 months ago
1999
IEEE
We present a technique for optimizing the rendering of highdepth complexity scenes. Prioritized-Layered Projection (PLP) does this by rendering an estimation of the visible set fo...
110
click to vote
VISUALIZATION
2002
IEEE
15 years 4 months ago
2002
IEEE
Within the field of computer graphics and visualization, it is often necessary to visualize polygonal models with large number of polygons. Display quality is mandatory, but it i...
93
Voted
SIGGRAPH
1991
ACM
15 years 3 months ago
1991
ACM
The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g....
BMVC
2010
14 years 9 months ago
2010
Three methods are explored which help indicate whether feature points are potentially visible or occluded in the matching phase of the keyframe-based real-time visual SLAM system....