Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Optical filling algorithm

Not Accessible

Your library or personal account may give you access

Abstract

The technique of optical symbolic substitution is applied to development of a new filling algorithm that reconstructs an image from its boundary in constant time, whereas known filling algorithms have at least O(n log N) time complexity, where n is the number of boundary pixels of a polygon and N is the diameter of the image expressed in terms of pixels.

© 1994 Optical Society of America

Full Article  |  PDF Article
More Like This
Digital optical computing with magneto-optic spatial light modulators: a new and efficient multiplication algorithm

Yi-Der Wu, Dah-Shi Shen, V. K. Bykovsky, J. Rosetti, and M. A. Fiddy
Appl. Opt. 33(32) 7572-7578 (1994)

High-accuracy pipelined iterative-tree optical multiplication

Khaled Al-Ghoneim and David Casasent
Appl. Opt. 33(8) 1517-1527 (1994)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (21)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (23)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved