// Copyright (c) 2002,2011 Utrecht University (The Netherlands). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v5.2/Spatial_searching/include/CGAL/Manhattan_distance_iso_box_point.h $ // $Id: Manhattan_distance_iso_box_point.h 0779373 2020-03-26T13:31:46+01:00 Sébastien Loriot // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Hans Tangelder () #ifndef CGAL_MANHATTAN_DISTANCE_ISO_BOX_POINT_H #define CGAL_MANHATTAN_DISTANCE_ISO_BOX_POINT_H #include #include #include #include #include namespace CGAL { template class Manhattan_distance_iso_box_point { SearchTraits traits; public: typedef typename SearchTraits::Point_d Point_d; typedef typename SearchTraits::Iso_box_d Iso_box_d; typedef typename SearchTraits::FT FT; typedef Iso_box_d Query_item; typedef typename internal::Get_dimension_tag::Dimension Dimension; typedef typename CGAL::cpp11::result_of::type Max_vertex; Manhattan_distance_iso_box_point(const SearchTraits& traits_=SearchTraits()):traits(traits_) {} // obsolete as we no longer store dimension Manhattan_distance_iso_box_point(const int d) : the_dimension(d) {} inline FT transformed_distance(const Query_item& q, const Point_d& p) const { FT distance = FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it= traits.construct_cartesian_const_iterator_d_object(); typename SearchTraits::Construct_min_vertex_d construct_min_vertex; typename SearchTraits::Construct_max_vertex_d construct_max_vertex; Max_vertex maxv = construct_max_vertex(q); typename SearchTraits::Cartesian_const_iterator_d qmaxit = construct_it(maxv), qe = construct_it(maxv,1), qminit = construct_it(construct_min_vertex(q)), pit = construct_it(p); for (; qmaxit != qe; ++pit,++qmaxit,++qminit) { if ((*pit)>(*qmaxit)) distance += (*pit)-(*qmaxit); else if ((*pit)<(*qminit)) distance += (*qminit)-(*pit); } return distance; } inline FT min_distance_to_rectangle(const Query_item& q, const Kd_tree_rectangle& r) const { FT distance = FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it= traits.construct_cartesian_const_iterator_d_object(); typename SearchTraits::Construct_min_vertex_d construct_min_vertex; typename SearchTraits::Construct_max_vertex_d construct_max_vertex; Max_vertex maxv = construct_max_vertex(q); typename SearchTraits::Cartesian_const_iterator_d qmaxit = construct_it(maxv), qe = construct_it(maxv,1), qminit = construct_it(construct_min_vertex(q)); for (unsigned int i = 0; qmaxit != qe; ++ qmaxit, ++qminit, ++i) { if (r.min_coord(i)>(*qmaxit)) distance +=(r.min_coord(i)-(*qmaxit)); if (r.max_coord(i)<(*qminit)) distance += ((*qminit)-r.max_coord(i)); } return distance; } inline FT min_distance_to_rectangle(const Query_item& q, const Kd_tree_rectangle& r,std::vector& dists) const { FT distance = FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it= traits.construct_cartesian_const_iterator_d_object(); typename SearchTraits::Construct_min_vertex_d construct_min_vertex; typename SearchTraits::Construct_max_vertex_d construct_max_vertex; Max_vertex maxv = construct_max_vertex(q); typename SearchTraits::Cartesian_const_iterator_d qmaxit = construct_it(maxv), qe = construct_it(maxv,1), qminit = construct_it(construct_min_vertex(q)); for (unsigned int i = 0; qmaxit != qe; ++ qmaxit, ++qminit, ++i) { if (r.min_coord(i)>(*qmaxit)) { dists[i]=(r.min_coord(i)-(*qmaxit)); distance +=dists[i]; } if (r.max_coord(i)<(*qminit)) { dists[i]=((*qminit)-r.max_coord(i)); distance += dists[i]; } } return distance; } inline FT max_distance_to_rectangle(const Query_item& q, const Kd_tree_rectangle& r) const { FT distance=FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it= traits.construct_cartesian_const_iterator_d_object(); typename SearchTraits::Construct_min_vertex_d construct_min_vertex; typename SearchTraits::Construct_max_vertex_d construct_max_vertex; Max_vertex maxv = construct_max_vertex(q); typename SearchTraits::Cartesian_const_iterator_d qmaxit = construct_it(maxv), qe = construct_it(maxv,1), qminit = construct_it(construct_min_vertex(q)); for (unsigned int i = 0; qmaxit != qe; ++ qmaxit, ++qminit, ++i) { if ( r.max_coord(i)-(*qminit) >(*qmaxit)-r.min_coord(i) ) distance += (r.max_coord(i)-(*qminit)); else distance += ((*qmaxit)-r.min_coord(i)); } return distance; } inline FT max_distance_to_rectangle(const Query_item& q, const Kd_tree_rectangle& r,std::vector& dists) const { FT distance=FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it= traits.construct_cartesian_const_iterator_d_object(); typename SearchTraits::Construct_min_vertex_d construct_min_vertex; typename SearchTraits::Construct_max_vertex_d construct_max_vertex; Max_vertex maxv = construct_max_vertex(q); typename SearchTraits::Cartesian_const_iterator_d qmaxit = construct_it(maxv), qe = construct_it(maxv,1), qminit = construct_it(construct_min_vertex(q)); for (unsigned int i = 0; qmaxit != qe; ++ qmaxit, ++qminit, ++i) { if ( r.max_coord(i)-(*qminit) >(*qmaxit)-r.min_coord(i) ) { dists[i]=(r.max_coord(i)-(*qminit)); distance += dists[i]; } else { dists[i]=((*qmaxit)-r.min_coord(i)); distance += dists[i]; } } return distance; } inline FT transformed_distance(FT d) const { return d; } inline FT inverse_of_transformed_distance(FT d) const { return d; } }; // class Manhattan_distance_iso_box_point } // namespace CGAL #endif // MANHATTAN_DISTANCE_ISO_BOX_POINT_H