Skip to main content

A Voxelization Algorithm for 3D Body-Centered Cubic Line Based on Adjunct Parallelepiped Space

  • Conference paper

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 307))

Abstract

A new voxelization algorithm is proposed for drawing lines on 3D body-centered cubic (BCC) grid, a kind of honeycomb space. Its main contribution is to apply the 3D Bresenham algorithm, a popular algorithm for drawing 3D lines on a cubic grid, to produce the BCC grid occupied by 3D lines, with the help of adjunct parallelepiped space, having the same center and basis vectors with the BCC grid. The adjunct parallelepiped line is easy to generate using the existed 3D cubic Bresenhan algorithm. Because of the one-to-one correspondence between the parallelogram cells of parallelepiped space and the voxels of the BCC space, then the 3D BCC line voxelization is generated. This procedure is characterized by a simple discriminator. A derivation for this discriminator given in the paper confirms that all calculations can be realized using only integer arithmetic.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Žalik, B., Clapworthy, G., Oblonšek, Č.: An Efficient Code-Based Voxel-Traversing Algorithm. Computer Graphics Forum 16, 119–128 (1997)

    Article  Google Scholar 

  2. Liu, Y.K., Žalik, B., Yang, H.: An Integer One-Pass Algorithm for Voxel Traversal. Computer Graphics Forum 23, 167–172 (2004)

    Article  Google Scholar 

  3. Bresenham, J.E.: Algorithm for Computer Control of a Digital Plotter. IBM System Journal 4, 25–30 (1965)

    Article  Google Scholar 

  4. Liu, X.W., Cheng, K.: Three-dimensional extension of Bresenham’s algorithm and its application in straight-line interpolation. Journal of Engineering Manufacture 216, 459–463 (2002)

    Article  Google Scholar 

  5. Kaufman, A., Shimony, E.: 3D scan-conversion algorithms for voxel-based graphics. In: Proceedings of the 1986 Workshop on Interactive 3D Graphics, pp. 45–75 (1986)

    Google Scholar 

  6. Cohen-Or, D., Kaufman, A.: 3D Line Voxelization and Connectivity Control. IEEE Computer Graphics and Applications 17, 80–87 (1997)

    Article  Google Scholar 

  7. Toutant, J.L.: Characterization of the Closest Discrete Approximation of a Line in the 3-Dimensional Space. In: International Symposium on Visual Computing (2006)

    Google Scholar 

  8. Buzer, L.: A linear incremental algorithm for naive and standard digital lines and planes recognition. Graphical Models 65, 61–76 (2003)

    Article  MATH  Google Scholar 

  9. Burns, M., Klawe, J., Rusinkiewicz, S., Finkelstein, A., DeCarlo, D.: Line drawings from volume data. In: ACM SIGGRAPH 2005, pp. 512–518 (2005)

    Google Scholar 

  10. Brimkov, V.E., Barneva, R.P.: Analytical Honeycomb Geometry for Raster and Volume Graphics. The Computer Journal 48, 180–199 (2005)

    Article  Google Scholar 

  11. Bernhard, F., Alireza, E., Dimitri, V.D.V., Torsten, M.: Efficient volume rendering on the body centered cubic lattice using box splines. Computers & Graphics 34(4), 409–423 (2010)

    Article  Google Scholar 

  12. Csebfalvi, B.: An Evaluation of Prefiltered B-Spline Reconstruction for Quasi-Interpolation on the Body-Centered Cubic Lattice. IEEE Transactions on Visualization and Computer Graphics 16(3), 499–512 (2010)

    Article  Google Scholar 

  13. He, L.J., Liu, Y.K., Sun, S.C.: A line generation algorithm on 3D face-centered cubic grid. Chinese Journal of Computers 33(12), 2407–2416 (2010)

    Article  Google Scholar 

  14. He, L.J., Liu, Y.K., Bao, S.Z.: 3D Line generation algorithm on hexagonal prism grids. In: 2008 International Congress on Image and Signal Processing, pp. 741–745 (2008)

    Google Scholar 

  15. Miller, E.G.: Alternative tilings for improved surface area estimates by local counting algorithms. Computer Vision and Image Understanding 74, 193–211 (1999)

    Article  Google Scholar 

  16. Strand, R.: Surface skeletons in grids with non-cubic voxels. In: Pattern Recognition 2004, pp. 548–551 (2004)

    Google Scholar 

  17. Carr, H., Theußl, T., Möller, T.: Isosurfaces on Optimal Regular Samples. In: Proceedings of Eurographics Visualization Symposium 2003, pp. 39–48 (2003)

    Google Scholar 

  18. Theusl, T., Moller, T., Groller, M.E.: Optimal regular volume sampling. In: Proceedings of the Conference on Visualization 2001, pp. 91–98 (2001)

    Google Scholar 

  19. Ibáñez, L., Hamitouche, C., Roux, C.: A Vectorial Algorithm for Tracing Discrete Straight Lines in N-Dimensional Generalized Grids. IEEE Transactions on Visualization and Computer Graphics 7, 97–108 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

He, L., Liu, Y., Wang, D., Yun, J. (2012). A Voxelization Algorithm for 3D Body-Centered Cubic Line Based on Adjunct Parallelepiped Space. In: Liu, C., Wang, L., Yang, A. (eds) Information Computing and Applications. ICICA 2012. Communications in Computer and Information Science, vol 307. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34038-3_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34038-3_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34037-6

  • Online ISBN: 978-3-642-34038-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics