I'm trying to do something that I don't know is possible in gdal/Python.

I have a list, L, of pre-defined lat/long points that make up a uniform grid.

A user will send me a set of points that make up the vertices of a polygon. This polygon will usually be irregular, not square. Any number of points could make up the polygon vertices, but it will likely not exceed 10 or so.

I would like to:

1. Create a polygon, P, based on the user-defined vertices.
2. Find the lat/long points in L that intersect polygon P.

Is this possible? I don't normally work with vectors in gdal, so I'm not familiar with the best way to do this.

I'm trying to do something that I don't know is possible in GDAL/Python.

I have a list, L, of pre-defined lat/long points that make up a uniform grid.

A user will send me a set of points that make up the vertices of a polygon. This polygon will usually be irregular, not square. Any number of points could make up the polygon vertices, but it will likely not exceed 10 or so.

I would like to:

1. Create a polygon, P, based on the user-defined vertices.
2. Find the lat/long points in L that intersect polygon P.

Is this possible? I don't normally work with vectors in GDAL, so I'm not familiar with the best way to do this.

I'm trying to do something that I don't know is possible in gdal/Python.

I have a list, L, of pre-defined lat/long points that make up a uniform grid.

A user will send me a set of points that make up the boundary of a polygon. This polygon will usually be irregular, not square. Any number of points could make up the polygon boundary, but it will likely not exceed 10 or so.

I would like to:

1. Create a polygon, P, based on the user-defined points.
2. Find the lat/long points in L that intersect polygon P.

Is this possible? I don't normally work with vectors in gdal, so I'm not familiar with the best way to do this.

I'm trying to do something that I don't know is possible in gdal/Python.

I have a list, L, of pre-defined lat/long points that make up a uniform grid.

A user will send me a set of points that make up the vertices of a polygon. This polygon will usually be irregular, not square. Any number of points could make up the polygon vertices, but it will likely not exceed 10 or so.

I would like to:

1. Create a polygon, P, based on the user-defined vertices.
2. Find the lat/long points in L that intersect polygon P.

Is this possible? I don't normally work with vectors in gdal, so I'm not familiar with the best way to do this.

I'm trying to do something that I don't know is possible in gdal/Python.

I have a list, L, of pre-defined lat/long points that make up a uniform grid.

A user will send me a set of points that make up the boundary of a polygon. This polygon will usually be irregular, not square. Any number of points could make up the polygon boundary, but it will likely not exceed 10 or so.

I would like to:

1. Create a polygon, P, based on the user-defined points.
2. Find the lat/long points in L that intersect polygon P.

Is this possible? I don't normally work with vectors in gdal, so I'm not familiar with the best way to do this.

Thank you

I'm trying to do something that I don't know is possible in gdal/Python.

I have a list, L, of pre-defined lat/long points that make up a uniform grid.

A user will send me a set of points that make up the boundary of a polygon. This polygon will usually be irregular, not square. Any number of points could make up the polygon boundary, but it will likely not exceed 10 or so.

I would like to:

1. Create a polygon, P, based on the user-defined points.
2. Find the lat/long points in L that intersect polygon P.

Is this possible? I don't normally work with vectors in gdal, so I'm not familiar with the best way to do this.