GET_NEAREST_NODE.f90 File Reference

Go to the source code of this file.

Functions/Subroutines
subroutine	get_nearest_node (n, xs, ys, zs, xt, yt, zt, nt, dist_min)
	Computes the nearest node with respet to (xt,yt,zt).

Function/Subroutine Documentation

get_nearest_node()

subroutine get_nearest_node	(	integer*4	n,
		real*8, dimension(n)	xs,
		real*8, dimension(n)	ys,
		real*8, dimension(n)	zs,
		real*8	xt,
		real*8	yt,
		real*8	zt,
		integer*4	nt,
		real*8	dist_min
	)

Computes the nearest node with respet to (xt,yt,zt).

Author

Ilario Mazzieri

Date

September, 2013

Version

1.0

Parameters

[in]	n	number of local nodes
[in]	xs	vertex x-coordinate of local nodes
[in]	ys	vertex y-coordinate of local nodes
[in]	zs	vertex z-coordinate of local nodes
[in]	xt	x-coor current vertex
[in]	yt	y-coor current vertex
[in]	zt	z-coor current vertex
[out]	nt	index of the nearest node from (xt,yt,zt)
[out]	dist_min	minimal distance from (xt,yt,zt)

Definition at line 34 of file GET_NEAREST_NODE.f90.

 
      implicit none
      
      integer*4 :: n,nt, i
      integer*4, dimension(1) :: pos
 
      !real*8 :: dx,dy,dz,d2,d2min
      real*8 :: xt,yt,zt
      real*8 :: dist_min
      
      real*8, dimension(n) :: xs,ys,zs
      real*8, dimension(n) :: dist_all
      
      !d2min = 1.0d30
      
      !do i = 1,n
      !   dx = xs(i) - xt
      !   dy = ys(i) - yt
      !   dz = zs(i) - zt
      !   d2 = dx*dx + dy*dy + dz*dz
      !   if (d2.lt.d2min) then
      !      d2min = d2
      !      nt = i
      !      
      !   endif
      !enddo
 
      dist_all = (xs-xt)*(xs-xt) + (ys-yt)*(ys-yt) + (zs-zt)*(zs-zt)
      dist_min = minval(dist_all)          
      pos = minloc(dist_all); nt = pos(1)
      
           
      return

Referenced by make_extint_forces(), and make_system_position_lglnodes().

Here is the caller graph for this function: