Full metadata record
DC pole | Hodnota | Jazyk |
---|---|---|
dc.contributor.author | Gallo, Giovanni | |
dc.contributor.author | Spampinato, Daria | |
dc.contributor.editor | Skala, Václav | |
dc.date.accessioned | 2015-09-23T09:42:44Z | |
dc.date.available | 2015-09-23T09:42:44Z | |
dc.date.issued | 1997 | |
dc.identifier.citation | Journal of WSCG. 1997, vol. 5, no. 1-3, p. 144-152. | en |
dc.identifier.issn | 1213-6972 (print) | |
dc.identifier.issn | 1213-6980 (CD-ROM) | |
dc.identifier.issn | 1213-6964 (online) | |
dc.identifier.uri | http://wscg.zcu.cz/wscg1997/wscg97.htm | |
dc.identifier.uri | http://hdl.handle.net/11025/15892 | |
dc.format | 9 s. | cs |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en |
dc.publisher | Václav Skala - UNION Agency | cs |
dc.relation.ispartofseries | Journal of WSCG | en |
dc.rights | © Václav Skala - UNION Agency | cs |
dc.subject | struktura dat | cs |
dc.subject | 3D krajina | cs |
dc.subject | trapézové regiony | cs |
dc.subject | algoritmy | cs |
dc.title | Function-trees: an efficient data structure for compact binary pictures | en |
dc.type | článek | cs |
dc.type | article | en |
dc.rights.access | openAccess | en |
dc.type.version | publishedVersion | en |
dc.description.abstract-translated | In the representation of binary images or of binary three-dimensional scenes two principal paradigms have been introduced: boundary representation and hierarchical decomposition. The data-structure introduced in this paper, called function-tree or function-octree for a 3D scene, is an elementary generalization of the standard quadtree and octree. It combines the compactness of a boundary representation of spatial data with the nice recursive properties of a tree representation. This is achieved by decomposing regularly an image into rectangular sub-images whose black regions are trapezoidal regions. A trapezoidal region (defined in detail in the paper) is a region below the graph of a function. Trapezoidal regions can be, in turn, efficiently encoded with a boundary representation. Efficient algorithms to construct the function-tree are described in the paper. The time complexities of such algorithms are O (n2) for a n × n binary picture and O (n3) for a n × n × n binary scene. The algorithms have been implemented. A final quick review of the possible applications of the proposed structures concludes the paper. | en |
dc.subject.translated | data structure | en |
dc.subject.translated | 3D scene | en |
dc.subject.translated | trapezoidal regions | en |
dc.subject.translated | algorithms | en |
dc.type.status | Peer-reviewed | en |
Vyskytuje se v kolekcích: | Volume 5, number 1-3 (1997) |
Soubory připojené k záznamu:
Soubor | Popis | Velikost | Formát | |
---|---|---|---|---|
Gallo_97.pdf | Plný text | 1,31 MB | Adobe PDF | Zobrazit/otevřít |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/15892
Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.