#include <cudf/types.hpp>
#include <rmm/mr/device/per_device_resource.hpp>
#include <memory>

Go to the source code of this file.

Functions
std::unique_ptr< cudf::table >	cuspatial::join_quadtree_and_bounding_boxes (cudf::table_view const &quadtree, cudf::table_view const &bbox, double x_min, double x_max, double y_min, double y_max, double scale, int8_t max_depth, rmm::mr::device_memory_resource *mr=rmm::mr::get_current_device_resource())
	Search a quadtree for polygon or linestring bounding box intersections.

std::unique_ptr< cudf::table >	cuspatial::quadtree_point_in_polygon (cudf::table_view const &poly_quad_pairs, cudf::table_view const &quadtree, cudf::column_view const &point_indices, cudf::column_view const &point_x, cudf::column_view const &point_y, cudf::column_view const &poly_offsets, cudf::column_view const &ring_offsets, cudf::column_view const &poly_points_x, cudf::column_view const &poly_points_y, rmm::mr::device_memory_resource *mr=rmm::mr::get_current_device_resource())
	Test whether the specified points are inside any of the specified polygons.

std::unique_ptr< cudf::table >	cuspatial::quadtree_point_to_nearest_linestring (cudf::table_view const &linestring_quad_pairs, cudf::table_view const &quadtree, cudf::column_view const &point_indices, cudf::column_view const &point_x, cudf::column_view const &point_y, cudf::column_view const &linestring_offsets, cudf::column_view const &linestring_points_x, cudf::column_view const &linestring_points_y, rmm::mr::device_memory_resource *mr=rmm::mr::get_current_device_resource())
	Finds the nearest linestring to each point in a quadrant, and computes the distances between each point and linestring.

Functions