Routine to find the index of all pixels enclosed in a polygon. The polygon should be convex,
or have only one concave vertex. The edges should not intersect each other.
The output indices can be either in the RING or NESTED scheme
cartesian vector pointing at polygon
respective vertices.
nv
I4B
IN
number of vertices, should be equal to 3 or larger.
listpix(0:*)
I4B/ I8B
OUT
the index for all pixels enclosed in the triangle. Make sure that the size of the array is big enough to contain all pixels.
nlist
I4B/ I8B
OUT
The number of pixels listed in listpix.
nest (OPTIONAL)
I4B
IN
The pixel indices are in the NESTED numbering scheme if nest=1, and in RING scheme otherwise.
inclusive (OPTIONAL)
I4B
IN
If set to 1, all the pixels overlapping
(even partially)
with the polygon are listed, otherwise only those whose
center lies within the polygon are listed.