navigation2d.h 2.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138
  1. #ifndef NAVIGATION_2D_H
  2. #define NAVIGATION_2D_H
  3. #include "scene/2d/node_2d.h"
  4. #include "scene/2d/navigation_polygon.h"
  5. class Navigation2D : public Node2D {
  6. OBJ_TYPE( Navigation2D, Node2D);
  7. union Point {
  8. struct {
  9. int64_t x:32;
  10. int64_t y:32;
  11. };
  12. uint64_t key;
  13. bool operator<(const Point& p_key) const { return key < p_key.key; }
  14. };
  15. struct EdgeKey {
  16. Point a;
  17. Point b;
  18. bool operator<(const EdgeKey& p_key) const {
  19. return (a.key==p_key.a.key)?(b.key<p_key.b.key):(a.key<p_key.a.key);
  20. };
  21. EdgeKey(const Point& p_a=Point(),const Point& p_b=Point()) {
  22. a=p_a;
  23. b=p_b;
  24. if (a.key > b.key) {
  25. SWAP(a,b);
  26. }
  27. }
  28. };
  29. struct NavMesh;
  30. struct Polygon {
  31. struct Edge {
  32. Point point;
  33. Polygon *C; //connection
  34. int C_edge;
  35. Edge() { C=NULL; C_edge=-1; }
  36. };
  37. Vector<Edge> edges;
  38. Vector2 center;
  39. Vector2 entry;
  40. float distance;
  41. int prev_edge;
  42. NavMesh *owner;
  43. };
  44. struct Connection {
  45. Polygon *A;
  46. int A_edge;
  47. Polygon *B;
  48. int B_edge;
  49. Connection() { A=NULL; B=NULL; A_edge=-1; B_edge=-1;}
  50. };
  51. Map<EdgeKey,Connection> connections;
  52. struct NavMesh {
  53. Object *owner;
  54. Matrix32 xform;
  55. bool linked;
  56. Ref<NavigationPolygon> navpoly;
  57. List<Polygon> polygons;
  58. };
  59. _FORCE_INLINE_ Point _get_point(const Vector2& p_pos) const {
  60. int x = int(Math::floor(p_pos.x/cell_size));
  61. int y = int(Math::floor(p_pos.y/cell_size));
  62. Point p;
  63. p.key=0;
  64. p.x=x;
  65. p.y=y;
  66. return p;
  67. }
  68. _FORCE_INLINE_ Vector2 _get_vertex(const Point& p_point) const {
  69. return Vector2(p_point.x,p_point.y)*cell_size;
  70. }
  71. void _navpoly_link(int p_id);
  72. void _navpoly_unlink(int p_id);
  73. float cell_size;
  74. Map<int,NavMesh> navpoly_map;
  75. int last_id;
  76. #if 0
  77. void _clip_path(Vector<Vector2>& path,Polygon *from_poly, const Vector2& p_to_point, Polygon* p_to_poly);
  78. #endif
  79. protected:
  80. static void _bind_methods();
  81. public:
  82. //API should be as dynamic as possible
  83. int navpoly_create(const Ref<NavigationPolygon>& p_mesh,const Matrix32& p_xform,Object* p_owner=NULL);
  84. void navpoly_set_transform(int p_id, const Matrix32& p_xform);
  85. void navpoly_remove(int p_id);
  86. Vector<Vector2> get_simple_path(const Vector2& p_start, const Vector2& p_end,bool p_optimize=true);
  87. Vector2 get_closest_point(const Vector2& p_point);
  88. Navigation2D();
  89. };
  90. #endif // Navigation2D2D_H