at Google ScholarTitle data
Henrich, Dominik:
Space-efficient region filling in raster graphics.
In: The Visual Computer.
Vol. 10
(1994)
.
- pp. 205-215.
ISSN 1432-2315
DOI: https://doi.org/10.1007/BF01901287
Project information
| Project title: |
Project's official title Project's id GRAPHICS No information PARO No information SWEEPING No information |
|---|
Abstract in another language
This paper presents fill algorithms for boundary-defined regions in raster graphics. The algorithms require only a constant-size working memory. The methods presented are based on the so-called “seed fill” algorithms that use the internal connectivity of the region with a given inner point. Basic methods, as well as additional hcuristics for speeding up the algorithm, are described and verified. Empirical results are used to compare the time complexities of the algorithms for different classes of regions.
Further data
| Item Type: | Article in a journal |
|---|---|
| Refereed: | Yes |
| Keywords: | display algorithms; frame buffer operations; graphic processors; raster graphics; seed filling |
| Institutions of the University: | Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Computer Science > Chair Applied Computer Science III > Chair Applied Computer Science III - Univ.-Prof. Dr. Dominik Henrich |
| Result of work at the UBT: | No |
| DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science |
| Date Deposited: | 12 Mar 2025 10:14 |
| Last Modified: | 12 Mar 2025 10:14 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/92802 |