Rasterizing complex polygons without tessellations

DOI10.1016/J.GMOD.2004.01.001MaRDI QIDQ4826774zbMATH OpenOpenAlexFDO

Authors A. J. Rueda, Rafael J. Segura, Francisco R. Feito, Juan Ruiz de Miras

Publication date 12 November 2004

Published in Graphical Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.gmod.2004.01.001

zbMATH Keywords

TessellationPolygon rasterization

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of tessellation and tiling problems (05B45)

Recommendations

• Mobility culling: An efficient rendering algorithm using temporal coherence
• Rasterization of nonparametric curves
• scientific article; zbMATH DE number 220697
• Visualization algorithm for CSG polyhedral solids
• scientific article; zbMATH DE number 1182916

Cited in

(1)

• Comparative study of high performance software rasterization techniques

This page was built for publication: Rasterizing complex polygons without tessellations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4826774)