next up previous contents index
Next: REAL FUNCTION XVMUL3D Up: Miscellaneous Routines Previous: SUBROUTINE TERSCL

SUBROUTINE TRIANGC

 TRIANGC triangulates a set of (x,y) points such that the boundry is a convex polygon. This routine is an adaption of  COSMIC routine ARC-11441. Used by some MASTER routines.

CALL TRIANGC(x,y,n,nt,nzz,m,i,j,ni,l,nz,ie,ibe,ite)

x,y   (R): arrays of x,y points
n     (I): number of points
           < 0 : ie,ibe,ite arrays not used
           > 0 : ie,ibe,ite arrays used (normal)
nt    (I): array of indicies of triangulated points t(nzz,3)
           corner 1 of triangle K = (x,y) = (x(t(K,1),y(t(K,1)))
           corner 2 of triangle K = (x,y) = (x(t(K,2),y(t(K,2)))
           corner 3 of triangle K = (x,y) = (x(t(K,3),y(t(K,3)))
nzz   (I): dimension of t array (>3*n)
m     (I): number of triangles stored in t
i,j   (I): working arrays (dimensioned i(ni),j(ni))
ni    (I): dimension of i,j arrays (ni>=n)
l     (I): number of edges in ie,ibe,ite
nz    (I): dimension of ie,ibe,ite array (>3*n)
note: these arrays only needed if n>0
ie    (I): array of indicies of each triangle edge ie(nz,2)
ibe   (I): edge flag array dimensioned ibe(nz)
           = 0 for interior edge
           = 1 if ie is a boundry edge
ite   (I): array of indicies of the neighbor edges of
           each triangle, dimensioned ite(nz,4)



David Long
Wed Jun 12 10:34:11 MDT 1996