breadthFirst | crossingPoints = contains all crossing points |
features | |
findAngle | |
findClosestRoad | ta bort path?? |
findColor | colorValue = [red green blue white black] |
findCompFormation | compFormation = [Lead, Compact, Spread, Very Spread] and |
findCover | Cover = [Good Bad] (0 <= sum(Cover) <= 1) |
findLine | Find first order (line) approx. for points p1, p2, p3 |
findNodeIndex | coordinates of x y |
findProj | kalkulates angle between line and vectors projVec |
findRoadPix | coordinates of x y |
findShortestPath | copy and remove road but store into oldRoads and oldCosts |
findSides | Formation of points p1, p2 and p3 is bounded in a rectangle |
formationType | Find formation type formVec= [Lead, Battle Line, Stare formation, Battle triangle] |
getCandidates | --------------040209 RS------------------------------------------- |
getCostChange | 040407 RS. costChange = meassures how fast the enemy is approaching per time |
getCostMatrix | node1Node2Road_noCost = [node1 node2 road_number cost; ...] |
getFieldCandiadte | ------------------------ |
getNewCost | Calculates shortest cost for enemy to reach our force |
getParent | nodeParentList = [child parent] |
getPlt_Pos | |
getRoadPix | slask function |
identifyRoads | ----------------RS 040211----------------------------------------- |
inMatrix | Looks if index (x,y) is inside Matrix |
insertNewPoints | |
insertRoad | |
isCrossing | coordinates of x y |
main | |
makeRoad | ------------------------040211 RS------------------------------------------ |
mediumPoint | Returns medium point for input points |
nextCrossing | --------------0402? RS------------------------------------------- |
passable | Passable = [Good Bad] and sum(Passable) = 1; |
pathList | -----------------------RS040217----------------------------------- |
plotRoad | |
plotShortestPath | |
pointLineDist | |
slask | |
slask2 | |
slask3 | |
slask4 | |
slask5 | |
tankPolicy | calculates policy of enemy tank |
testRoadf_on | tests |