Computing Visibility for Triangulated Panoramas

dc.contributor.authorFu, Chi-Wingen_US
dc.contributor.authorWong, Tien-Tsinen_US
dc.contributor.authorHeng, Pheng-Annen_US
dc.contributor.editorDani Lischinski and Greg Ward Larsonen_US
dc.date.accessioned2014-01-27T13:43:51Z
dc.date.available2014-01-27T13:43:51Z
dc.date.issued1999en_US
dc.description.abstractA 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.en_US
dc.description.seriesinformationEurographics Workshop on Renderingen_US
dc.identifier.isbn3-211-83382-Xen_US
dc.identifier.issn1727-3463en_US
dc.identifier.urihttps://doi.org/10.2312/EGWR/EGWR99/161-174en_US
dc.publisherThe Eurographics Associationen_US
dc.titleComputing Visibility for Triangulated Panoramasen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
161-174.pdf
Size:
4.3 MB
Format:
Adobe Portable Document Format