scispace - formally typeset
Journal ArticleDOI

Operations on Images Using Quad Trees

Reads0
Chats0
TLDR
Warnock-type algorithms are presented for building the quad tree for the picture of the boundary of apolygon, and for coloring the interior of such a polygon.
Abstract
A quad tree for representing a picture is a tree in which successively deeper levels represent successively finer subdivisions of picture area. An algorithm is given for superposing N quad trees in time proportional to the total number of nodes in the trees. Warnock-type algorithms are then presented for building the quad tree for the picture of the boundary of a polygon, and for coloring the interior of such a polygon. These algorithms take O(v + p + q) time, where v is the number of polygon vertices, p is the polygon perimeter, and q is a resolution parameter. When the resolution q is fixed, these algorithms are asymptotically optimal.

read more

Citations
More filters
Journal ArticleDOI

The Quadtree and Related Hierarchical Data Structures

TL;DR: L'accentuation est mise sur la representation de donnees dans les applications de traitement d'images, d'infographie, les systemes d'informations geographiques and the robotique.
Proceedings ArticleDOI

QBIC project: querying images by content, using color, texture, and shape

TL;DR: The main algorithms for color texture, shape and sketch query that are presented, show example query results, and discuss future directions are presented.
Book ChapterDOI

Efficient Similarity Search In Sequence Databases

TL;DR: An indexing method for time sequences for processing similarity queries using R * -trees to index the sequences and efficiently answer similarity queries and provides experimental results which show that the method is superior to search based on sequential scanning.
Journal ArticleDOI

Efficient and effective querying by image content

TL;DR: A set of novel features and similarity measures allowing query by image content, together with the QBIC system, and a new theorem that makes efficient filtering possible by bounding the non-Euclidean, full cross-term quadratic distance expression with a simple Euclidean distance.
Journal ArticleDOI

Geometric modeling using octree encoding

TL;DR: Efficient (linear time) algorithms have been developed for the Boolean operations, geometric operations,translation, scaling and rotation, N-dimensional interference detection, and display from any point in space with hidden surfaces removed.
References
More filters
Book

Principles of Interactive Computer Graphics

TL;DR: The principles of interactive computer graphics are discussed in this article, where the authors propose a set of principles for the development of computer graphics systems, including the principles of Interactive Computer Graphics (ICG).
Journal ArticleDOI

Picture Segmentation by a Tree Traversal Algorithm

TL;DR: This paper combines the two approaches with significant increase in processing speed while maintaining small memory requirements and the data structure is described in detail.
Journal ArticleDOI

Experiments on Picture Representation Using Regular Decomposition

TL;DR: A regular decomposition of picture area into successively smaller quadrants is defined, which involves logarithmic search, and the resulting picture representation is shown to enable rapid access of image data without regard to position, efficient storage, and approximate structural descriptions of constituent patterns.
Journal ArticleDOI

Pictorial feature distortion in a pyramid

TL;DR: The distortion of pictorial features brought about by one such averaging transformation is investigated and the smearing of spots and edges, object separability, and distortion of features detectable with templates are discussed.
Related Papers (5)