How to resolve the algorithm Find if a point is within a triangle step by step in the AutoHotkey programming language

Published on 12 May 2024 09:40 PM
#Autohotkey

How to resolve the algorithm Find if a point is within a triangle step by step in the AutoHotkey programming language

Table of Contents

Problem Statement

Find if a point is within a triangle.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Find if a point is within a triangle step by step in the AutoHotkey programming language

Source code in the autohotkey programming language

T := [[1.5, 2.4], [5.1, -3.1], [-3.8, 1.2]]
for i, p in [[0, 0], [0, 1], [3, 1], [5.4142857, 14.349206]]
    result .= "[" p.1 ", " p.2 "]  is within triangle?`t" (TriHasP(T, p) ? "ture" : "false") "`n"
MsgBox % result
return

TriHasP(T, P){
    Ax := TriArea(T.1.1, T.1.2,  T.2.1, T.2.2,  T.3.1, T.3.2)
    A1 := TriArea(P.1  , P.2  ,  T.2.1, T.2.2,  T.3.1, T.3.2)
    A2 := TriArea(T.1.1, T.1.2,  P.1  , P.2  ,  T.3.1, T.3.2)
    A3 := TriArea(T.1.1, T.1.2,  T.2.1, T.2.2,  P.1  , P.2)
    return (Ax = A1 + A2 + A3)
}
TriArea(x1, y1, x2, y2, x3, y3){
    return Abs((x1 * (y2-y3) + x2 * (y3-y1) + x3 * (y1-y2)) / 2)
}

You may also check:How to resolve the algorithm Exponentiation order step by step in the Nim programming language
You may also check:How to resolve the algorithm Numbers which are not the sum of distinct squares step by step in the BASIC programming language
You may also check:How to resolve the algorithm Quickselect algorithm step by step in the Tcl programming language
You may also check:How to resolve the algorithm Least common multiple step by step in the Elixir programming language
You may also check:How to resolve the algorithm Entropy/Narcissist step by step in the zkl programming language