Representation of two and three dimensional objects by tree structures has been used extensively in solid modeling, computer graphics, computer vision, and image processing. Quadtrees, which are used to represent objects in 2-D space, and octrees, which are the extension of quadtrees in 3-D space, have been studied thoroughly for applications in graphics and image processing. Binary Space Partition (BSP) trees have been used in computer graphics applications as efficient representaions of polyhedra in d-dimensional space. In this work, a Hough Transform-based method for generating the BSP tree representations of images in 2-D space in presented.
Image Representation Using Binary Space Partitioning Trees
LEONARDI Riccardo
Methodology
;
1990-01-01
Abstract
Representation of two and three dimensional objects by tree structures has been used extensively in solid modeling, computer graphics, computer vision, and image processing. Quadtrees, which are used to represent objects in 2-D space, and octrees, which are the extension of quadtrees in 3-D space, have been studied thoroughly for applications in graphics and image processing. Binary Space Partition (BSP) trees have been used in computer graphics applications as efficient representaions of polyhedra in d-dimensional space. In this work, a Hough Transform-based method for generating the BSP tree representations of images in 2-D space in presented.| File | Dimensione | Formato | |
|---|---|---|---|
|
RLNV_VCIP_1990.PDF
accesso aperto
Descrizione: RLNV_VCIP-1990_Full-text
Tipologia:
Full Text
Licenza:
Creative commons
Dimensione
1.21 MB
Formato
Adobe PDF
|
1.21 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
