wykobi_naive_group_intersections.inl

/*
(***********************************************************************)
(*                                                                     *)
(* Wykobi Computational Geometry Library                               *)
(* Release Version 0.0.5                                               *)
(* http://www.wykobi.com                                               *)
(* Copyright (c) 2005-2019 Arash Partow, All Rights Reserved.          *)
(*                                                                     *)
(* The Wykobi computational geometry library and its components are    *)
(* supplied under the terms of the open source MIT License.            *)
(* The contents of the Wykobi computational geometry library and its   *)
(* components may not be copied or disclosed except in accordance with *)
(* the terms of the MIT License.                                       *)
(*                                                                     *)
(* URL: https://opensource.org/licenses/MIT                            *)
(*                                                                     *)
(***********************************************************************)
*/


#include "wykobi.hpp"
#include "wykobi_algorithm.hpp"

#include <vector>
#include <algorithm>


namespace wykobi
{
   namespace algorithm
   {
      template <typename T>
      struct naive_group_intersections< segment<T,2> >
      {
      public:

         template <typename InputIterator, typename OutputIterator>
         naive_group_intersections(InputIterator begin, InputIterator end, OutputIterator out)
         {
            for (InputIterator i = begin; i != end; ++i)
            {
               for (InputIterator j = (i + 1); j != end; ++j)
               {
                  if (intersect((*j),(*i)))
                  {
                     (*out++) = intersection_point((*j),(*i));
                  }
               }
            }
         }
      };

      template <typename T>
      struct naive_group_intersections< segment<T,3> >
      {
      public:

         template <typename InputIterator, typename OutputIterator>
         naive_group_intersections(InputIterator begin, InputIterator end, OutputIterator out)
         {
            for (InputIterator i = begin; i != end; ++i)
            {
               for (InputIterator j = (i + 1); j != end; ++j)
               {
                  if (intersect((*j),(*i)))
                  {
                     (*out++) = intersection_point((*j),(*i));
                  }
               }
            }
         }
      };

      template <typename T>
      struct naive_group_intersections< circle<T> >
      {
      public:

         template <typename InputIterator, typename OutputIterator>
         naive_group_intersections(InputIterator begin, InputIterator end, OutputIterator out)
         {
            for (InputIterator i = begin; i != end; ++i)
            {
               for (InputIterator j = (i + 1); j != end; ++j)
               {

                  if (
                       (distance((*i).x,(*i).y,(*j).x,(*j).y) >= std::abs((*i).radius - (*j).radius)) &&
                       intersect((*j),(*i))
                     )
                  {
                     point2d<T> p1;
                     point2d<T> p2;

                     intersection_point((*j),(*i),p1,p2);

                     (*out++) = p1;
                     (*out++) = p2;
                  }
               }
            }
         }
      };

   } // namespace wykobi::algorithm

} // namespace wykobi