An Efficient Representation for Quadtrees, with Applications
碩士 === 國立台灣工業技術學院 === 工程技術研究所 === 85 === In this paper, we present an efficient representation for quadtrees. Given a quadtree Q with size |Q|, where |Q| denotes the number of nodes of Q, it takes O(|Q|) time to obtain the proposed represe...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1997
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/20439353859652834510 |
| Summary: | 碩士 === 國立台灣工業技術學院 === 工程技術研究所 === 85 === In this paper, we present an efficient representation for
quadtrees. Given a quadtree Q with size |Q|, where |Q| denotes
the number of nodes of Q, it takes O(|Q|) time to obtain the
proposed representation for Q. Experimental results show that
the proposed representation has better compression ratio when
compared to the previous ones. Some image manipulations, such as
the geometric operations (area and centroid calculations) and
transformation into the linear quadtree, on the proposed
representation directly are also discussed.
|
|---|