Title: Computation and maintenance of visibility and shadows in the plane
Authors: Ghali, Sherif
Citation: Journal of WSCG. 1998, vol. 6, no. 1-3.
Issue Date: 1998
Publisher: Václav Skala - UNION Agency
Document type: článek
URI: http://hdl.handle.net/11025/15842
ISSN: 1213-6972 (print)
1213-6980 (CD-ROM)
1213-6964 (online)
Keywords: výpočetní geometrie;viditelnost stínů;dynamické algoritmy;třída hierarchie
Keywords in different language: computational geometry;visibility shadows;dynamic algorithms;class hierarchy
Abstract in different language: We consider visibility and shadow problems in the plane under static and dynamic conditions. We show that several problems in this domain are intimately related and that a careful formulation of the requirements of each problem can lead to a great deal of reuse in the implementation. This is of interest to the practitioner who may find it difficult to implement visibility and shadow algorithms given their complexity. A solution of these problems in the plane turns out to be a necessary component of their solution in space and by separating these components, difficult issues of implementation are taken care of at the design level. We also give specific algorithmic results. We show a reduction between shadow and visibility computations under a point light source, between static and dynamic computations under a point light source, and visibility and shadow computations between a point and a linear light source.
Rights: © Václav Skala - UNION Agency
Appears in Collections:Volume 6, number 1-3 (1998)

Files in This Item:
File Description SizeFormat 
Ghali_98.pdfPlný text77,38 kBAdobe PDFView/Open

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

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