A non-recursive border finding algorithm for linear quadtree based images
Given a digital binary image represented in a linear quadtree, its border is to be found as another linear quadtree. A new algorithm is proposed that can generate the border in sorted order. A pattern is found for the order of the edge pixels of a node. The differences of the location codes for t...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
2009
|
| Online Access: | http://hdl.handle.net/2429/5545 |