Skip Navigation


The Computer Journal Advance Access originally published online on March 5, 2007
The Computer Journal 2007 50(4):473-477; doi:10.1093/comjnl/bxm004
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
50/4/473    most recent
bxm004v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Yanovsky, V. M.
Right arrow Articles by Bruckstein, A. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2007. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

A Linear-Time Constant-Space Algorithm for the Boundary Fill Problem

Vladimir M. Yanovsky*, Israel A. Wagner and Alfred M. Bruckstein

Computer Science Department, Technion IIT, Haifa 32000, Israel

* Corresponding author: volodyan{at}cs.technion.ac.il

Received 25 June 2006; revised 2 October 2006

In this paper, we consider the problem of boundary fill of a 4 or 8-connected region in a graphic device having a color image frame-buffer memory. We provide an algorithm that solves the problem in a time linear in the number of pixels in the region and requiring only constant memory space in addition to the frame-buffer memory itself. We map this problem to a boundary fill problem in a general graph, and solve it using a novel depth first search-based algorithm.

Key Words: Computer • graphics • boundary • fill • algorithm • space • complexity


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.