(v)
| 137 | } |
| 138 | |
| 139 | function isInside(v) { |
| 140 | return isAngleInsideSector(v, [a0, a1]); |
| 141 | } |
| 142 | |
| 143 | // find index in sector closest to a0 |
| 144 | // use it to find intersection of v[i0] <-> v[i0-1] edge with sector radius |
no test coverage detected
searching dependent graphs…