Abstract

Hierarchical data structures for image representation have been widely explored in recent years. These data structures are based on the principle of "recursive decomposition" of an image region. The most commonly mentioned picture data structure for two-dimensional data is referred to as a "quadtree". The purpose of this thesis is to investigate the use of a general quadtree scheme as a means of representing symmetric images. Specifically, images are generated according to the rules of selected two-dimensional plane symmetry groups.

Library of Congress Subject Headings

Computer graphics; Data structures (Computer science)

Publication Date

1988

Document Type

Thesis

Department, Program, or Center

Computer Science (GCCIS)

Advisor

Johnson, Guy

Advisor/Committee Member

Comte, Chris

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: T385 .L628 1988

Campus

RIT – Main Campus

Download

Share

COinS