DocumentCode :
2778686
Title :
Visibility algorithms for electromagnetic problems
Author :
Meana, J.G. ; Las-Heras, F. ; Martínez, José Á
Author_Institution :
Univ. of Oviedo, Oviedo
fYear :
2008
fDate :
5-11 July 2008
Firstpage :
1
Lastpage :
4
Abstract :
Three visibility methods have been chosen with the objective of comparing their results in terms of computational time and RCS values. Two of them -trimming method, cone method - have been already described. The trimming method is considered to be the more accurate one due to the fact that only totally lit or non-lit facets can exist. Nonetheless, the computational cost is ten times the one associated with the cone method, whose relative error is 4.67%. Consequently, the employment of cone method implies a faster software execution but the price to pay is decrease of the accuracy. On the other hand, the recursive implementation of the binary space partitioning algorithm overloads the process and does not improve the results of the other methodologies.
Keywords :
computational electromagnetics; geometry; RCS; binary space partitioning algorithm; cone method; electromagnetic problems; trimming method; visibility algorithms; Computer graphics; Geometry; Hardware; Iterative algorithms; Optical scattering; Partitioning algorithms; Physical optics; Radar cross section; Radar scattering; Software algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Antennas and Propagation Society International Symposium, 2008. AP-S 2008. IEEE
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4244-2041-4
Electronic_ISBN :
978-1-4244-2042-1
Type :
conf
DOI :
10.1109/APS.2008.4619958
Filename :
4619958
Link To Document :
بازگشت