pyinterp.geometry.cartesian.algorithms.for_each_point_covered_by

pyinterp.geometry.cartesian.algorithms.for_each_point_covered_by#

pyinterp.geometry.cartesian.algorithms.for_each_point_covered_by(source: pyinterp.core.geometry.cartesian.MultiPoint, container: pyinterp.core.geometry.cartesian.Box) → numpy.ndarray[dtype=bool, shape=(*), order='C']#
pyinterp.geometry.cartesian.algorithms.for_each_point_covered_by(source: pyinterp.core.geometry.cartesian.MultiPoint, container: pyinterp.core.geometry.cartesian.Ring) → numpy.ndarray[dtype=bool, shape=(*), order='C']
pyinterp.geometry.cartesian.algorithms.for_each_point_covered_by(source: pyinterp.core.geometry.cartesian.MultiPoint, container: pyinterp.core.geometry.cartesian.Polygon) → numpy.ndarray[dtype=bool, shape=(*), order='C']
pyinterp.geometry.cartesian.algorithms.for_each_point_covered_by(source: pyinterp.core.geometry.cartesian.MultiPoint, container: pyinterp.core.geometry.cartesian.MultiPolygon) → numpy.ndarray[dtype=bool, shape=(*), order='C']
pyinterp.geometry.cartesian.algorithms.for_each_point_covered_by(source: pyinterp.core.geometry.cartesian.LineString, container: pyinterp.core.geometry.cartesian.Box) → numpy.ndarray[dtype=bool, shape=(*), order='C']
pyinterp.geometry.cartesian.algorithms.for_each_point_covered_by(source: pyinterp.core.geometry.cartesian.LineString, container: pyinterp.core.geometry.cartesian.Ring) → numpy.ndarray[dtype=bool, shape=(*), order='C']
pyinterp.geometry.cartesian.algorithms.for_each_point_covered_by(source: pyinterp.core.geometry.cartesian.LineString, container: pyinterp.core.geometry.cartesian.Polygon) → numpy.ndarray[dtype=bool, shape=(*), order='C']
pyinterp.geometry.cartesian.algorithms.for_each_point_covered_by(source: pyinterp.core.geometry.cartesian.LineString, container: pyinterp.core.geometry.cartesian.MultiPolygon) → numpy.ndarray[dtype=bool, shape=(*), order='C']
pyinterp.geometry.cartesian.algorithms.for_each_point_covered_by(source: pyinterp.core.geometry.cartesian.Ring, container: pyinterp.core.geometry.cartesian.Box) → numpy.ndarray[dtype=bool, shape=(*), order='C']
pyinterp.geometry.cartesian.algorithms.for_each_point_covered_by(source: pyinterp.core.geometry.cartesian.Ring, container: pyinterp.core.geometry.cartesian.Ring) → numpy.ndarray[dtype=bool, shape=(*), order='C']
pyinterp.geometry.cartesian.algorithms.for_each_point_covered_by(source: pyinterp.core.geometry.cartesian.Ring, container: pyinterp.core.geometry.cartesian.Polygon) → numpy.ndarray[dtype=bool, shape=(*), order='C']
pyinterp.geometry.cartesian.algorithms.for_each_point_covered_by(source: pyinterp.core.geometry.cartesian.Ring, container: pyinterp.core.geometry.cartesian.MultiPolygon) → numpy.ndarray[dtype=bool, shape=(*), order='C']

Test if each point in a source geometry is covered by a container geometry.

A point is covered by a container if it lies in the interior or on the boundary of the container.

Parameters:

  • source – Source geometry containing points (MultiPoint, LineString, or Ring).

  • container – Container geometry (Box, Polygon, Ring, or MultiPolygon).

Returns:

Boolean array indicating which points are covered by the container.

See also

for_each_point_within: Exclude points on the boundary.

Contents