SUPERCOVER PLANE RASTERIZATION - A Rasterization Algorithm for Generating Supercover Plane Inside a Cube

T. Petković, S. Lončarić

2007

Abstract

An analysis of a rasterization algorithm for generating supercover planes in 3D voxel space is presented. The derived algorithm is an extension to the classical 2D line rasterization algorithm. Additional voxels needed to form the supercover 3D plane are identified by rasterizing two additional 2D lines per volume slice. A discussion on how to modify the algorithm to rasterize finite supercover 3D plane segments with arbitrary parameters by using integer arithmetic only is given.

References

  1. Andrès, E. (2003). Discrete linear objects in dimension n: the standard model. Graph. Models, 65(1-3):92-111.
  2. Bresenham, J. E. (1965). Algorithm for computer control of a digital plotter. IBM System Journal, 4(1):25-30.
  3. Cohen-Or, D. and Kaufman, A. (1997). 3D line voxelization and connectivity control. Computer Graphics and Applications, 17(6):80-87.
  4. Dedu, E. (2002). Design of a Simulation Model of MultiAgent Systems, and its Parallel Algorithmic and Implementation on Shared-Memory MIMD Computers: ParSSAP Model. PhD thesis, PRiSM, UVSQ, Versailles, France.
  5. Herman, G. T. (1998). Geometry of Digital Spaces. Applied and Numerical Harmonic Analysis. Birkha¯user, Boston.
  6. Kim, C. E. (1984). Three-dimensional digital planes. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(5):639-644.
  7. Lincke, C. and Wüthrich, C. A. (1999). An exact weaving rasterization algorithm. In Skala, V., editor, WSCG'99 Conference Proceedings.
  8. Pham, S. (1987). Equations of digital straight lines. In CG International 7887 on Computer graphics 1987, pages 221-248, New York, NY, USA. Springer-Verlag New York, Inc.
  9. Wüthrich, C. A. (1998). A model for curve rasterization in n-dimensional space. Computers & Graphics, 22(2- 3):153-160.
Download


Paper Citation


in Harvard Style

Petković T. and Lončarić S. (2007). SUPERCOVER PLANE RASTERIZATION - A Rasterization Algorithm for Generating Supercover Plane Inside a Cube . In Proceedings of the Second International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, ISBN 978-972-8865-71-9, pages 327-332. DOI: 10.5220/0002079303270332


in Bibtex Style

@conference{grapp07,
author={T. Petković and S. Lončarić},
title={SUPERCOVER PLANE RASTERIZATION - A Rasterization Algorithm for Generating Supercover Plane Inside a Cube},
booktitle={Proceedings of the Second International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP,},
year={2007},
pages={327-332},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002079303270332},
isbn={978-972-8865-71-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP,
TI - SUPERCOVER PLANE RASTERIZATION - A Rasterization Algorithm for Generating Supercover Plane Inside a Cube
SN - 978-972-8865-71-9
AU - Petković T.
AU - Lončarić S.
PY - 2007
SP - 327
EP - 332
DO - 10.5220/0002079303270332