Full metadata record
DC FieldValueLanguage
dc.contributor.authorGallo, Giovanni
dc.contributor.authorSpampinato, Daria
dc.contributor.editorSkala, Václav
dc.date.accessioned2015-09-23T09:42:44Z
dc.date.available2015-09-23T09:42:44Z
dc.date.issued1997
dc.identifier.citationJournal of WSCG. 1997, vol. 5, no. 1-3, p. 144-152.en
dc.identifier.issn1213-6972 (print)
dc.identifier.issn1213-6980 (CD-ROM)
dc.identifier.issn1213-6964 (online)
dc.identifier.urihttp://wscg.zcu.cz/wscg1997/wscg97.htm
dc.identifier.urihttp://hdl.handle.net/11025/15892
dc.format9 s.cs
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherVáclav Skala - UNION Agencycs
dc.relation.ispartofseriesJournal of WSCGen
dc.rights© Václav Skala - UNION Agencycs
dc.subjectstruktura datcs
dc.subject3D krajinacs
dc.subjecttrapézové regionycs
dc.subjectalgoritmycs
dc.titleFunction-trees: an efficient data structure for compact binary picturesen
dc.typečlánekcs
dc.typearticleen
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.description.abstract-translatedIn 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.translateddata structureen
dc.subject.translated3D sceneen
dc.subject.translatedtrapezoidal regionsen
dc.subject.translatedalgorithmsen
dc.type.statusPeer-revieweden
Appears in Collections:Volume 5, number 1-3 (1997)

Files in This Item:
File Description SizeFormat 
Gallo_97.pdfPlný text1,31 MBAdobe PDFView/Open


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

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