Rasterization Method for Voxel Model Cutting
Background. The analysis of voxel dataset cuts is a widespread task in computer graphics applications. A comprehensive study of volume image cuts enables deeper learning of the structure of an object, which is visualized, as well as getting a clear view of the organization of its components. Very often, there is a need to investigate an internal structure of the object, and in this case, researchers can be more interested in certain parts of the model, in particular, in cuts of voxel data.
Objective. The objective of the research is to develop a rasterization method which enables obtaining cuts of voxel datasets at arbitrary angles. The method should use only integer arithmetic and minimize the number of calculations.
Methods. The essence of the method is to rasterize the cutting plane by parallel transferring of master-line fragments along the base-line, as it is proposed in the weaving algorithms of rasterization. To rasterize both types of lines, it is proposed to use the Bresenham's line algorithm. The developed method consists of two stages: the initialization stage, in which both the master-line is rasterized and boundaries of rasterization fragments are found, and the main stage, when rasterization of the master-line fragments is performed within the boundaries found on the initialization stage.
Results. The developed method uses only integer arithmetic and minimizes the number of calculations in the rasterization cycles of master-line fragments which makes the use of the method sufficiently effective for rasterization of sections of voxel models.Conclusions. The developed method can be used in various applications where three-dimensional images are used, including medical images, three-dimensional visualization in scientific applications, multimedia and mulsemedia systems.
S. Chmielewski and P. Tompalski, “Estimating outdoor advertising media visibility with voxel-based approach”, Applied Geography, vol. 87, pp. 1–13, 2017. doi: 10.1016/j.apgeog.2017.07.007
A. Kaufman and K. Mueller, Volume Visualization and Volume Graphics. Stony Brook University, 2003.
S. Laine and T. Karras, “Efficient sparse voxel octrees – Analysis, extensions, and implementation”, in Proc. Workshop on Interactive 3D Graphics I3D’10, 2010.
Q. Zhang et al., “Volume visualization: A technical overview with a focus on medical applications”, J. Digital Imaging, vol. 24, no. 4, pp. 640–664, 2011. doi: 10.1007/s10278-010-9321-6
A. Kaufman, “An algorithm for 3d scan-conversion of polygons”, in Proc. Eurographics'87, Amsterdam, 1987. doi: 10.2312/egtp.19871015
A. Kaufman and E. Shimony, “3D scan-conversion algorithms for voxel-based graphics”, in Proc. Workshop on Interactive 3D Graphics I3D'86, USA, 1987, pp. 45–75.
J.F. Hughes et al., Computer Graphics: Principles and Practice, 3rd ed. Addison-Wesley, 2013. Available: http://ptgmedia.pearsoncmg.com/images/9780321399526/samplepages/0321399528.pdf
C. Lincke et al., “An exact weaving rasterization algorithm for digital planes”, in Proc. WSCG'99, Prague, 1999.
H. Freeman, “On the encoding of arbitrary geometric configurations”, in IRE Trans Electronic Computing, vol. EC-10(2), pp. 260–268, 1961. doi: https://doi.org/10.1109/TEC.1961.5219197
T. Petković and S. Lončarić, “Supercover plane rasterization: A rasterization algorithm for generating supercover plane inside a cube”, in Proc. 2nd Int. Conf. Computer Graphics Theory and Applications GRAPP 2007, Barcelona, 2007.
D. Cohen and A. Kaufman, “Scan conversion algorithms for linear and quadratic objects”, in Volume Visualization, A. Kaufman, ed. Los Alamitos, CA: IEEE Computer Society Press, 1991, pp. 280–301.
D. Cohen-Or and A. Kaufman, “Fundamentals of surface voxelization”, Graphical Models and Image Processing, vol. 57, no. 6, pp. 453–461, 1995. doi: 10.1006/gmip.1995.1039
K.I. Joy. Bresenham’s Algorithm [Online]. Available: http://www.idav.ucdavis.edu/education/GraphicsNotes/Bresenhams-Algorithm.pdf
GOST Style Citations
Copyright (c) 2018 Igor Sikorsky Kyiv Polytechnic Institute
This work is licensed under a Creative Commons Attribution 4.0 International License.