Title: | An Efficient Space Partitioning Method Using Binary Maps |
Authors: | Skala, Václav |
Citation: | Recent Researches in Communications, Signals and Information Technology: Proceedings, p. 121-124. |
Issue Date: | 2012 |
Publisher: | WSEAS |
Document type: | konferenční příspěvek conferenceObject |
URI: | http://hdl.handle.net/11025/11333 |
ISBN: | 978-1-61804-081-7 |
Keywords: | počítačová grafika;dělení prostoru;residenční masky |
Keywords in different language: | computer graphics;space partitioning;residency masks |
Abstract: | Space partitioning techniques are well known especially because of their use in computer graphics, especially within ray-tracing acceleration techniques. The primary aim of those techniques is to enable fast test whether a geometric object resides at least partially within the given area. There are many modifications that proved the applicability despite of high memory requirements of complexity O(M2) for the two dimensional space, resp. O(M3) for the three dimensional space. The space division technique is used in standard software packages like PovRay etc. A new technique with O(M) memory complexity and its comparison with original space subdivision and residency mask techniques is presented. |
Rights: | Original article is published under copyright license: © 2012 WSEAS |
Appears in Collections: | Konferenční příspěvky / Conference Papers (KIV) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Skala_2012_Binary_Masks-DRAFT.pdf | Plný text | 399,41 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/11333
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.