 These algorithms are particularly popular when calculating parameters whose magnitudes decrease with the distance squared such as those related to radio signals, sound waves , and human eyesight. However, radial scanning algorithms imply a large number of accesses to 2D arrays , which despite being regular, results in poor data locality .
<meaning-changed>  These algorithms are particularly popular when calculating parameters whose magnitudes decrease with the distance squared such as those related to radio signals, sound waves , and human eyesight. However, radial scanning algorithms imply a large number of accesses to 2D arrays , which despite being regular, results in poor data locality .
 These algorithms are particularly popular when calculating parameters whose magnitudes decrease with the distance squared such as those related to radio signals, sound waves and human vision. These are commonly analyzed using rotational sweep algorithms. However, such algorithms require large numbers of memory accesses to 2D arrays , which despite being regular, results in poor data locality .