Vol. 82
Latest Volume
All Volumes
PIER 176 [2023] PIER 175 [2022] PIER 174 [2022] PIER 173 [2022] PIER 172 [2021] PIER 171 [2021] PIER 170 [2021] PIER 169 [2020] PIER 168 [2020] PIER 167 [2020] PIER 166 [2019] PIER 165 [2019] PIER 164 [2019] PIER 163 [2018] PIER 162 [2018] PIER 161 [2018] PIER 160 [2017] PIER 159 [2017] PIER 158 [2017] PIER 157 [2016] PIER 156 [2016] PIER 155 [2016] PIER 154 [2015] PIER 153 [2015] PIER 152 [2015] PIER 151 [2015] PIER 150 [2015] PIER 149 [2014] PIER 148 [2014] PIER 147 [2014] PIER 146 [2014] PIER 145 [2014] PIER 144 [2014] PIER 143 [2013] PIER 142 [2013] PIER 141 [2013] PIER 140 [2013] PIER 139 [2013] PIER 138 [2013] PIER 137 [2013] PIER 136 [2013] PIER 135 [2013] PIER 134 [2013] PIER 133 [2013] PIER 132 [2012] PIER 131 [2012] PIER 130 [2012] PIER 129 [2012] PIER 128 [2012] PIER 127 [2012] PIER 126 [2012] PIER 125 [2012] PIER 124 [2012] PIER 123 [2012] PIER 122 [2012] PIER 121 [2011] PIER 120 [2011] PIER 119 [2011] PIER 118 [2011] PIER 117 [2011] PIER 116 [2011] PIER 115 [2011] PIER 114 [2011] PIER 113 [2011] PIER 112 [2011] PIER 111 [2011] PIER 110 [2010] PIER 109 [2010] PIER 108 [2010] PIER 107 [2010] PIER 106 [2010] PIER 105 [2010] PIER 104 [2010] PIER 103 [2010] PIER 102 [2010] PIER 101 [2010] PIER 100 [2010] PIER 99 [2009] PIER 98 [2009] PIER 97 [2009] PIER 96 [2009] PIER 95 [2009] PIER 94 [2009] PIER 93 [2009] PIER 92 [2009] PIER 91 [2009] PIER 90 [2009] PIER 89 [2009] PIER 88 [2008] PIER 87 [2008] PIER 86 [2008] PIER 85 [2008] PIER 84 [2008] PIER 83 [2008] PIER 82 [2008] PIER 81 [2008] PIER 80 [2008] PIER 79 [2008] PIER 78 [2008] PIER 77 [2007] PIER 76 [2007] PIER 75 [2007] PIER 74 [2007] PIER 73 [2007] PIER 72 [2007] PIER 71 [2007] PIER 70 [2007] PIER 69 [2007] PIER 68 [2007] PIER 67 [2007] PIER 66 [2006] PIER 65 [2006] PIER 64 [2006] PIER 63 [2006] PIER 62 [2006] PIER 61 [2006] PIER 60 [2006] PIER 59 [2006] PIER 58 [2006] PIER 57 [2006] PIER 56 [2006] PIER 55 [2005] PIER 54 [2005] PIER 53 [2005] PIER 52 [2005] PIER 51 [2005] PIER 50 [2005] PIER 49 [2004] PIER 48 [2004] PIER 47 [2004] PIER 46 [2004] PIER 45 [2004] PIER 44 [2004] PIER 43 [2003] PIER 42 [2003] PIER 41 [2003] PIER 40 [2003] PIER 39 [2003] PIER 38 [2002] PIER 37 [2002] PIER 36 [2002] PIER 35 [2002] PIER 34 [2001] PIER 33 [2001] PIER 32 [2001] PIER 31 [2001] PIER 30 [2001] PIER 29 [2000] PIER 28 [2000] PIER 27 [2000] PIER 26 [2000] PIER 25 [2000] PIER 24 [1999] PIER 23 [1999] PIER 22 [1999] PIER 21 [1999] PIER 20 [1998] PIER 19 [1998] PIER 18 [1998] PIER 17 [1997] PIER 16 [1997] PIER 15 [1997] PIER 14 [1996] PIER 13 [1996] PIER 12 [1996] PIER 11 [1995] PIER 10 [1995] PIER 09 [1994] PIER 08 [1994] PIER 07 [1993] PIER 06 [1992] PIER 05 [1991] PIER 04 [1991] PIER 03 [1990] PIER 02 [1990] PIER 01 [1989]
2008-02-19
A Novel Hybrid Approach to Ray Tracing Acceleration Based on Pre-Processing & Bounding Volumes
By
Progress In Electromagnetics Research, Vol. 82, 19-32, 2008
Abstract
Ray tracing has been successfully usedin prediction of wave propagation models in recent years. Although this method has its own obvious benefits, it suffers from a big problem: slow performance. In this paper, novel methods are proposed in which the main focus is on reducing the number of ray-facet intersections. First a preprocessing methodis proposed which reduces the number of ray-facet intersection tests dramatically. Later this method is combined with a volume bounding algorithm to make improvements in the speed of ray-tracing simulations, even more.
Citation
Nima Sedaghat Alvar Ayaz Ghorbani Hamid Reza Amin Davar , "A Novel Hybrid Approach to Ray Tracing Acceleration Based on Pre-Processing & Bounding Volumes," Progress In Electromagnetics Research, Vol. 82, 19-32, 2008.
doi:10.2528/PIER08013007
http://www.jpier.org/PIER/pier.php?paper=08013007
References

1. Lawton, M. C. and J. P. McGeehan, "The application of a deterministic ray launching algorithm for the prediction of radio channel characteristics in small-cell environments," IEEE Trans. Veh. Tech., Vol. 43, No. 4, 955-969, 1994.
doi:10.1109/25.330158

2. Yang, C. F., B. C. Wu, and C. J. Ko, "A ray-tracing method for modeling indoor wave propagation and penetration," IEEE Trans. Antennas Propagat., Vol. 46, No. 6, 907-919, 1998.
doi:10.1109/8.686780

3. Catedra, M. F., Cell Planning for Wireless Communications, Artech House, 1999.

4. Chen, C. H., C. L. Liu, C. C. Chiu, and T. M. Hu, "Ultra-wide bandc hannel calculation by SBR/Image techniques for indoor communication," Journal of Electromagnetic Waves and Applications, Vol. 20, No. 1, 41-51, 2006.
doi:10.1163/156939306775777387

5. El-Sallabi, H. M. and P. Vainikainen, "Radio wave propagation in perpendicular streets of urban street grid for microcellular communications. Part I: Channel modeling," Progress In Electromagnetics Research, Vol. 40, 229-254, 2003.
doi:10.2528/PIER02112502

6. Wang, N., Y. Zhang, and C. H. Liang, "Creeping ray-tracing algorithm of UTD method based on NURBS models with the source on surface," Journal of Electromagnetic Waves and Applications, Vol. 20, No. 14, 1981-1990, 2006.
doi:10.1163/156939306779322602

7. Mphale, K. and M. Heron, "Ray tracing radio waves in wildfire environments," Progress In Electromagnetics Research, Vol. 67, 153-172, 2007.
doi:10.2528/PIER06082302

8. Li, L. W., T. S. Yeo, P. S. Kooi, M. S. Leong, and J. H. Koh, "Analysis of electromagnetic wave propagation in forest environment along multiple paths ," Progress In Electromagnetics Research, Vol. 23, 137-164, 1999.
doi:10.2528/PIER98102201

9. Liu, Y.-J., Y.-R. Zhang, and W. Cao, "A novel approach to the refraction propagation characteristics of UWB signal waveforms," Journal of Electromagnetic Waves and Applications, Vol. 21, No. 14, 1939-1950, 2007.
doi:10.1163/156939307783152966

10. Fugen, T., J. Maurer, W. Sorgel, and W. Wiesbeck, Characterization of multipath clusters with ray-tracing in urban MIMO propagation environments at 2 GHz, IEEE Proceedings of the International Symposium on Antennas and Propagation, Washington DC, USA, 2005.

11. Agelet, F. A., A. Formella, J. M. H. Rabanos, F. I. Vicente, and F. P. Fontan, "Efficient ray-tracing acceleration techniques for radio propagation modeling," IEEE Trans. Veh. Tech., Vol. 49, No. 6, 2000.
doi:10.1109/25.901880

12. Yun, Z., M. F. Iskander, and Z. Zhang, "Fast ray tracing procedure using space division with uniform rectangular grid," IEEE Electronics Letters, Vol. 36, No. 10, 895-897, 2000.
doi:10.1049/el:20000653

13. Tao, Y. B., H. Lin, and H. J. Bao, "KD-tree based fast ray tracing for RCS prediction," Progress In Electromagnetics Research, Vol. 81, 329-341, 2008.
doi:10.2528/PIER08011305

14. Bang, J.-K. and B.-C. Kim, "Time consumption reduction of ray tracing for RCS prediction using efficient grid division and space division algorithms," Journal of Electromagnetic Waves and Applications, Vol. 21, No. 6, 829-840, 2007.
doi:10.1163/156939307780749129

15. Jin, K.-S., "Fast ray tracing using a space-division algorithm for RCS prediction," Journal of Electromagnetic Waves and Applications, Vol. 20, No. 1, 119-126, 2006.
doi:10.1163/156939306775777341

16. Cocheril, Y. and R. Vauzelle, "A new ray-tracing based wave propagation model including rough surfaces scattering," Progress In Electromagnetics Research, Vol. 75, 357-381, 2007.
doi:10.2528/PIER07061202

17. Teh, C. H., F. Kung, and H. T. Chuah, "A path-correctedw all model for ray-tracing propagation modeling," Journal of Electromagnetic Waves and Applications, Vol. 20, No. 2, 207-214, 2006.
doi:10.1163/156939306775777288

18. Liang, C., Z. Liu, and H. Di, "Study on the blockage of electromagnetic rays analytically," Progress In Electromagnetics Research B, Vol. 1, 253-268, 2008.
doi:10.2528/PIERB07102902

19. Wald, I., H. Friedrich, G. Marmitt, P. Slusallek, and H. Seidel, "Faster isosurface ray tracing using implicit KD-trees," IEEE Trans. Vis. Comput. Graph., Vol. 11, No. 5, 562-572, 2005.
doi:10.1109/TVCG.2005.79

20. Weghorst, H., G. Hooper, and D. P. Greenberg, "Improved computational methods for ray tracing," IEEE Trans. Vis. Comput. Graph., Vol. 11, No. 5, 562-572, 2005.
doi:10.1109/TVCG.2005.79

21. Skyum, S., "A simple algorithm for computing the smallest enclosing circle," Inform. Process. Lett., Vol. 37, 121-125, 1991.
doi:10.1016/0020-0190(91)90030-L