Computational geometry: an introduction
Computational geometry: an introduction
Illumination and color in computer generated imagery
Illumination and color in computer generated imagery
Feature-based image metamorphosis
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
View interpolation for image synthesis
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Plenoptic modeling: an image-based rendering system
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Proceedings of the 1997 symposium on Interactive 3D graphics
Navigating static environments using image-space simplification and morphing
Proceedings of the 1997 symposium on Interactive 3D graphics
Memory access patterns of occlusion-compatible 3D image warping
HWWS '97 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
An image-based approach to three-dimensional computer graphics
An image-based approach to three-dimensional computer graphics
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Robot Vision
Computing Visibility Without Depth
Computing Visibility Without Depth
Efficient Reconstruction Techniques for Post-Rendering 3D Image Warping
Efficient Reconstruction Techniques for Post-Rendering 3D Image Warping
A Panoramic-Based Walkthrough System Using Real Photos
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
Binary-Space-Partitioned Images for Resolving Image-Based Visibility
IEEE Transactions on Visualization and Computer Graphics
Ryan: rendering your animation nonlinearly projected
Proceedings of the 3rd international symposium on Non-photorealistic animation and rendering
Presence: Teleoperators and Virtual Environments
| Hi-index | 0.00 |
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially useful when depth information is not available, such as in the case of real-world photographs. Based on the optical flow information and the image intensity, the panorama is subdivided into variable-sized triangles, image warping is then efficiently applied on these triangles using existing graphics hardware. The visibility problem is resolved by drawing the warped triangles in a specific order. This drawing order is derived from epipolar geometry. Using this partial drawing order, a graph can be built and topological sorting is applied on the graph to obtain the complete drawing order of all triangles. We will show that the time complexity of graph construction and topological sorting are both linear to the total number of triangles.