docs/html/find__affected__cells_8hpp_source.html

 #ifndef FIND_AFFECTED_CELLS_HPP
 #define FIND_AFFECTED_CELLS_HPP

 #include <vector>
 #include "tessellation.hpp"
 #include "shape_2d.hpp"

 using std::vector;

 bool edge_circle_intersect
 (const Edge& edge,
  const Circle& circle);

 void find_affected_cells_recursive(const Tessellation& tess,
         int index,
         const Circle& circle,
         vector<int> & res, std::vector<Vector2D> &added, bool periodic, Vector2D const& ll, Vector2D const& ur);

 vector<int> find_affected_cells
 (const Tessellation& tess,
  int index,
  Circle& circle, vector<int> &vtemp,bool periodic,std::vector<Vector2D> &periodic_add);

 #endif // FIND_AFFECTED_CELLS
Tessellation
Abstract class for tessellation.
Definition: tessellation.hpp:21

tessellation.hpp
Abstract class for the tessellation.

Edge
Interface between two cells.
Definition: Edge.hpp:13

shape_2d.hpp
Two dimensional shapes.

Circle
A circle.
Definition: shape_2d.hpp:27

find_affected_cells
vector< int > find_affected_cells(const Tessellation &tess, int index, Circle &circle, vector< int > &vtemp, bool periodic, std::vector< Vector2D > &periodic_add)
Non recursive version of find affected cells. Only searches one degree of separation.
Definition: find_affected_cells.cpp:136

find_affected_cells_recursive
void find_affected_cells_recursive(const Tessellation &tess, int index, const Circle &circle, vector< int > &res, std::vector< Vector2D > &added, bool periodic, Vector2D const &ll, Vector2D const &ur)
Recursively finds all cells that intersect a circle.
Definition: find_affected_cells.cpp:174

edge_circle_intersect
bool edge_circle_intersect(const Edge &edge, const Circle &circle)
Determines if an edge and a circle intersect.
Definition: find_affected_cells.cpp:63

Vector2D
2D Mathematical vector
Definition: geometry.hpp:15