Rasterizing complex polygons without tessellations

  • Authors:
  • A. J. Rueda;R. J. Segura;F. R. Feito;J. Ruiz de Miras

  • Affiliations:
  • Departamento de Informática, Excuela Politécnica Superior, Avda. de Madrid, 35-23071 Jaén, Spain;Departamento de Informática, Excuela Politécnica Superior, Avda. de Madrid, 35-23071 Jaén, Spain;Departamento de Informática, Excuela Politécnica Superior, Avda. de Madrid, 35-23071 Jaén, Spain;Departamento de Informática, Excuela Politécnica Superior, Avda. de Madrid, 35-23071 Jaén, Spain

  • Venue:
  • Graphical Models
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Rasterization of polygons is a basic operation in computer graphics systems, representing the last and most time-consuming step in the visualization process. Therefore, the development of simple, efficient, and general polygon rasterization techniques is of prime interest. In this paper, we describe a new algorithm for this purpose, inspired on the ideas of the geometric modeling based on simplicial chains [Computer and Graphics 5 (1998) 611]. This algorithm is valid for any kind of polygon, is robust and extremely simple, and can be easily implemented in hard-ware. A similar approach can be used for the problem of polihedra voxelization in 3D.