Title: Coherent and Exact PolygontoPolygon Visibility
Authors: Mora, F.
Aveneau, L.
Mériaux, M.
Citation: WSCG '2005: Full Papers: The 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2005 in co-operation with EUROGRAPHICS: University of West Bohemia, Plzen, Czech Republic, p. 87-94.
Issue Date: 2005
Publisher: UNION Agency
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/wscg2005/Papers_2005/Full/!WSCG2005_Full_Proceedings_Final.pdf
ISBN: 80-903100-7-9
Keywords: viditelnost;vektorové modelování geometrických objektů;Pluckerův prostor
Keywords in different language: visibility;constructive solid geometry;Plücker space
Abstract: Visibility computation is a classical problem in computer graphics. A wide variety of algorithms provides solutions with a different accuracy. However, the four dimensional nature of the 3D visibility has prevented for a long time from leading to exact frompolygon visibility algorithms. Recently, the two first tractable solutions were presented by Nirenstein, then Bittner. Their works give the opportunity to design exact visibility tools for applications that require a high level of accuracy. This paper presents an approach that takes advantage of both Nirenstein and Bittner methods. On the one hand, it relies on an optimisation of Nirenstein’s algorithm that increases the visibility information coherence and the computation robustness. On the other hand, it provides an exact visibility data structure as Bittner does, but also suited for nonoriented polygontopolygon visibility queries.
Rights: © UNION Agency
Appears in Collections:WSCG '2005: Full Papers

Files in This Item:
File Description SizeFormat 
Mora.pdfPlný text409,85 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/10956

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.