Paper Info
Title
Line of Sight Procedure for Dijkstra-Algorithm Based Ray-Tracing.
Abstract
This paper describes a procedure for checking line of sight (LOS) for paths computed by Dijkstra-algorithm (DA) based ray-tracing. First, computational space is divided into regularly arrayed cubes composed of free-space or obstacle, and graphs are constructed in terms of nodes at cubic apexes and links connected or disconnected to apex-nodes of adjacent cubes. Then, DA based computations yield original DA data which can provide shortest paths from a primary source node to all other nodes except for the nodes in obstacle. Next, the paths are modified to pseudo-rays by applying the two processes, that is, path-selection and path-linearization, to the original DA data. Finally, conversion from the pseudo-rays to optical rays are performed by checking whether the computed rays satisfy LOS condition. In this paper, we propose an efficient LOS procedure which is well compatible with DA based ray-tracing.
Year
DOI
Venue
2017
10.1007/978-3-319-69811-3_66
ADVANCES ON BROAD-BAND WIRELESS COMPUTING, COMMUNICATION AND APPLICATIONS, BWCCA-2017
Field
DocType
Volume
Obstacle,Graph,Computer science,Ray tracing (graphics),Algorithm,Line-of-sight,Computation,Cube,Distributed computing,Dijkstra's algorithm
Conference
12
ISSN
Citations 
PageRank 
2367-4512
0
0.34
References 
Authors
3
2
Name
Order
Citations
PageRank
Kazunori Uchida116138.43
Leonard Barolli21179144.22