Skip to main content
Conference ProceedingsOPEN ACCESS

Fractal representation of planar shapes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1176 73-84
DOI: 10.1007/3-540-62005-2_7
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

For a collection of planar shapes, (e.g. characters in the given font) a fractal operator is defined which when applied iteratively to a standard set of initial contours, it reconstructs original objects with a high precision. This construction enables fast scalings and rotations of planar individual objects by simple algebraic operations on the fractal representation. Significant compression of data volume was obtained for shape representation.

Author supplied keywords

Cite

CITATION STYLE

APA

Skarbek, W., Ignasiak, K., & Ghuwar, M. (1996). Fractal representation of planar shapes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1176, pp. 73–84). Springer Verlag. https://doi.org/10.1007/3-540-62005-2_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free