* The algorithm builds an rtree of @p points to sort them spatially, before
* attempting to call find_active_cell_around_point().
*
+ * @note This function is not implemented for the codimension one case (<tt>spacedim != dim</tt>).
+ *
* @note If a point is not found inside the mesh, or is lying inside an
* artificial cell of a parallel::TriangulationBase, the point is silently
* ignored. If you want to infer for which points the search failed, use the
* >
* @endcode
*
+ * @note This function is not implemented for the codimension one case (<tt>spacedim != dim</tt>).
+ *
* @note This function optimizes the search by making use of
* GridTools::Cache::get_cell_bounding_boxes_rtree(), which either returns
* a cached rtree or builds and stores one. Building an rtree might hinder
const typename Triangulation<dim, spacedim>::active_cell_iterator
&cell_hint)
{
+ Assert((dim == spacedim),
+ ExcMessage("Only implemented for dim==spacedim."));
+
// Alias
namespace bgi = boost::geometry::index;