VLSI arrays implementing parallel line-drawing algorithms

Valeriu Beiu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

After a short description of the problems encountered in graphic systems concerning the image memory, the first part of this paper describes several algorithms which are easily parallelizable. The second part shows possible VLSI arrays implementing the above mentioned algorithms and area and time estimations.

Original languageEnglish
Title of host publicationParcella 1988 - 4th International Workshop on Parallel Processing by Cellular Automata and Arrays, Proceedings
EditorsUdo Schendel, Tamas Legendi, Gottfried Wolf
PublisherSpringer Verlag
Pages241-247
Number of pages7
ISBN (Print)9783540506478
DOIs
Publication statusPublished - 1989
Externally publishedYes
Event4th International Workshop on Parallel Processing by Cellular Automata and Arrays, Parcella 1988 - Berlin, Germany
Duration: Oct 17 1988Oct 21 1988

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume342 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Workshop on Parallel Processing by Cellular Automata and Arrays, Parcella 1988
Country/TerritoryGermany
CityBerlin
Period10/17/8810/21/88

Keywords

  • Area-time complexity
  • Graphics
  • Line-drawing algorithms
  • Parallel algorithms
  • VLSI arrays
  • VLSI-based architecture

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'VLSI arrays implementing parallel line-drawing algorithms'. Together they form a unique fingerprint.

Cite this