- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Filling contours on the linear quadtree domain by insertion...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Filling contours on the linear quadtree domain by insertion and traversal Wilke, Lars Martin
Abstract
An algorithm is presented which fills contours described by a set of pixels whose locations are given in unsorted linear quadtree (LQT) form. Each pixel requires an associated blocking code which indicates locally in which direction the region should grow. The technique takes advantage of certain characteristics of LQT location codes to determine if the boundary pixels fall on the edges or vertices of lower resolution LQT cells. This information allows for the automatic determination of boundary cells after the pixels have been inserted into a regular quadtree. Remaining uncoloured cells are coloured using conventional techniques. The algorithm compares favourably with existing LQT filling algorithms both in time and space complexity. The technique avoids explicit sorting of the input pixels or output cells by location code, and no condensation of cells is required. Traversing the regular quadtree in preorder generates the sorted output cells as an LQT.
Item Metadata
Title |
Filling contours on the linear quadtree domain by insertion and traversal
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
1993
|
Description |
An algorithm is presented which fills contours described by a set of pixels whose locations are given
in unsorted linear quadtree (LQT) form. Each pixel requires an associated blocking code which
indicates locally in which direction the region should grow. The technique takes advantage of certain
characteristics of LQT location codes to determine if the boundary pixels fall on the edges or vertices
of lower resolution LQT cells. This information allows for the automatic determination of boundary
cells after the pixels have been inserted into a regular quadtree. Remaining uncoloured cells are
coloured using conventional techniques. The algorithm compares favourably with existing LQT filling
algorithms both in time and space complexity. The technique avoids explicit sorting of the input
pixels or output cells by location code, and no condensation of cells is required. Traversing the
regular quadtree in preorder generates the sorted output cells as an LQT.
|
Extent |
791067 bytes
|
Genre | |
Type | |
File Format |
application/pdf
|
Language |
eng
|
Date Available |
2009-02-23
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
|
DOI |
10.14288/1.0065012
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
1994-05
|
Campus | |
Scholarly Level |
Graduate
|
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.