Another update from ingydotnet^djgoku
This commit is contained in:
Ingy döt Net
parent
91df62d461
commit
948b86eafa
7604 changed files with 108452 additions and 22726 deletions
|
|
@ -1,49 +1,52 @@
|
|||
/*REXX program to see if a horizontal ray from pt P intersects a polygon*/
|
||||
call points 5 5, 5 8, -10 5, 0 5, 10 5, 8 5, 10 10
|
||||
call polygon 0 0, 10 0, 10 10, 0 10 ; call test 'square'
|
||||
call polygon 0 0, 10 0, 10 10, 0 10, 2.5 2.5, 7.5 2.5, 7.5 7.5, 2.5 7.5 ; call test 'square hole'
|
||||
call polygon 0 0, 2.5 2.5, 0 10, 2.5 7.5, 7.5 7.5, 10 10, 10 0 ; call test 'irregular'
|
||||
call polygon 3 0, 7 0, 10 5, 7 10, 3 10, 0 5 ; call test 'exagon'
|
||||
exit /*stick a fork in it, we're done.*/
|
||||
/*──────────────────────────────────IN_OUT subroutine────────────────────*/
|
||||
in_out: procedure expose point. poly. /*note: // is division remainder.*/
|
||||
parse arg p; #=0; do side=1 to poly.0 by 2; #=#+ray_intersect(p,side)
|
||||
/*REXX pgm checks to see if a horizontal ray from point P intersects a polygon*/
|
||||
call points 5 5, 5 8, -10 5, 0 5, 10 5, 8 5, 10 10
|
||||
A=2.5; B=7.5 /*◄───for shorter args*/
|
||||
call poly 0 0, 10 0, 10 10, 0 10 ; call test 'square'
|
||||
call poly 0 0, 10 0, 10 10, 0 10, A A, B A, B B, A B ; call test 'square hole
|
||||
call poly 0 0, A A, 0 10, A B, B B, 10 10, 10 0 ; call test 'irregular'
|
||||
call poly 3 0, 7 0, 10 5, 7 10, 3 10, 0 5 ; call test 'hexagon'
|
||||
exit /*stick a fork in it, we're all done. */
|
||||
/*────────────────────────────────────────────────────────────────────────────*/
|
||||
in_out: procedure expose point. poly.; parse arg p; #=0
|
||||
do side=1 to poly.0 by 2; #=#+ray_intersect(p,side)
|
||||
end /*side*/
|
||||
return #//2 /*odd=inside, return 1; else 0.*/
|
||||
/*──────────────────────────────────POINTS subroutine───────────────────*/
|
||||
points: n=0; v='POINT.'; do j=1 for arg(); n=n+1
|
||||
call value v||n'.X', word(arg(j),1)
|
||||
call value v||n'.Y', word(arg(j),2)
|
||||
end /*j*/
|
||||
call value v'0',n /*define number of points.*/
|
||||
return
|
||||
/*──────────────────────────────────POLYGON subroutine──────────────────*/
|
||||
polygon: n=0; v='POLY.'; parse arg Fx Fy
|
||||
return #//2 /*ODD is inside. EVEN is outside. */
|
||||
/*────────────────────────────────────────────────────────────────────────────*/
|
||||
points: n=0; v='POINT.'; do j=1 for arg(); n=n+1; _=arg(j); parse var _ xx yy
|
||||
call value v||n'.X',xx
|
||||
call value v||n'.Y',yy
|
||||
end /*j*/
|
||||
call value v'0',n /*define the number of points.*/
|
||||
return
|
||||
/*────────────────────────────────────────────────────────────────────────────*/
|
||||
poly: n=0; v='POLY.'; parse arg Fx Fy /* [↓] process the X,Y points*/
|
||||
|
||||
do j=1 for arg(); _=arg(j); n=n+1
|
||||
call value v||n'.X', word(_,1); call value v||n'.Y', word(_,2)
|
||||
if n//2 then iterate
|
||||
n=n+1
|
||||
call value v||n'.X', word(_,1); call value v||n'.Y', word(_,2)
|
||||
end /*j*/
|
||||
n=n+1
|
||||
call value v||n".X", Fx; call value v||n".Y", Fy; call value v'0',n
|
||||
return /*POLY.0 is # of segments/sides.*/
|
||||
/*──────────────────────────────────RAY_INTERSECT subroutine────────────*/
|
||||
ray_intersect: procedure expose point. poly.; parse arg ?,s; sp=s+1
|
||||
epsilon = '1e'||(digits()%2); infinity = '1e'||(digits()*2)
|
||||
Px=point.?.x; Py=point.?.y
|
||||
Ax=poly.s.x; Bx=poly.sp.x ; Ay=poly.s.y; By=poly.sp.y
|
||||
if Ay>By then parse value Ax Ay Bx By with Bx By Ax Ay
|
||||
if Py=Ay | Py=By then Py=Py+epsilon
|
||||
if Py<Ay | Py>By | Px>max(Ax,Bx) then return 0
|
||||
if Px<min(Ax,Bx) then return 1
|
||||
if Ax\=Bx then m_red = (By-Ay) / (Bx-Ax); else m_red = infinity
|
||||
if Ax\=Px then m_blue = (Py-Ay) / (Px-Ax); else return 1
|
||||
return m_blue>=m_red
|
||||
/*──────────────────────────────────TEST procedure──────────────────────*/
|
||||
test: say; do k=1 for point.0 /*traipse through each test point*/
|
||||
say ' ['arg(1)"] point:" right(point.k.x','point.k.y, 9),
|
||||
" is " word('outside inside', in_out(k)+1)
|
||||
end /*k*/
|
||||
return
|
||||
do j=1 for arg(); n=n+1; _=arg(j); parse var _ xx yy
|
||||
call value v||n'.X', word(_,1); call value v||n'.Y', word(_,2)
|
||||
if n//2 then iterate
|
||||
n=n+1
|
||||
call value v||n'.X', word(_,1); call value v||n'.Y', word(_,2)
|
||||
end /*j*/
|
||||
n=n+1
|
||||
call value v||n".X", Fx; call value v||n".Y", Fy; call value v'0',n
|
||||
return /*POLY.0 is number of segments/sides.*/
|
||||
/*────────────────────────────────────────────────────────────────────────────*/
|
||||
ray_intersect: procedure expose point. poly.; parse arg ?,s; sp=s+1
|
||||
epsilon='1e' || (digits()%2); infinity='1e' || (digits() *2)
|
||||
Px=point.?.x; Ax=poly.s.x; Ay=poly.s.y
|
||||
Py=point.?.y; Bx=poly.sp.x; By=poly.sp.y /* [↓] do a swap*/
|
||||
if Ay>By then parse value Ax Ay Bx By with Bx By Ax Ay
|
||||
if Py=Ay | Py=By then Py=Py+epsilon
|
||||
if Py<Ay | Py>By | Px>max(Ax,Bx) then return 0
|
||||
if Px<min(Ax,Bx) then return 1
|
||||
if Ax\=Bx then m_red =(By-Ay)/(Bx-Ax)
|
||||
else m_red =infinity
|
||||
if Ax\=Px then m_blue=(Py-Ay)/(Px-Ax)
|
||||
else return 1
|
||||
return m_blue>=m_red
|
||||
/*────────────────────────────────────────────────────────────────────────────*/
|
||||
test: say; do k=1 for point.0; say right(' ['arg(1)"] point:",30),
|
||||
right(point.k.x', 'point.k.y, 9) " is ",
|
||||
word('outside inside', in_out(k)+1)
|
||||
end /*k*/
|
||||
return
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue