💿🐜 Antkeeper source code https://antkeeper.com
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

74 lines
2.5 KiB

  1. /*
  2. * Copyright (C) 2021 Christopher J. Howard
  3. *
  4. * This file is part of Antkeeper source code.
  5. *
  6. * Antkeeper source code is free software: you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation, either version 3 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * Antkeeper source code is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with Antkeeper source code. If not, see <http://www.gnu.org/licenses/>.
  18. */
  19. #ifndef ANTKEEPER_GEOM_INTERSECTION_HPP
  20. #define ANTKEEPER_GEOM_INTERSECTION_HPP
  21. #include "geom/aabb.hpp"
  22. #include "geom/mesh.hpp"
  23. #include "geom/plane.hpp"
  24. #include "geom/ray.hpp"
  25. #include "geom/sphere.hpp"
  26. #include "utility/fundamental-types.hpp"
  27. #include <tuple>
  28. namespace geom {
  29. /**
  30. * Tests for intersection between a ray and a plane.
  31. *
  32. * @param ray Ray to test for intersection.
  33. * @param plane Plane to test for intersection.
  34. * @return Tuple containing a boolean indicating whether intersection occurred, and a float indicating the signed distance along the ray to the point of intersection.
  35. */
  36. std::tuple<bool, float> ray_plane_intersection(const ray<float>& ray, const plane<float>& plane);
  37. std::tuple<bool, float, float, float> ray_triangle_intersection(const ray<float>& ray, const float3& a, const float3& b, const float3& c);
  38. std::tuple<bool, float, float> ray_aabb_intersection(const ray<float>& ray, const aabb<float>& aabb);
  39. std::tuple<bool, float, float, std::size_t, std::size_t> ray_mesh_intersection(const ray<float>& ray, const mesh& mesh);
  40. /**
  41. * Ray-sphere intersection test.
  42. */
  43. template <class T>
  44. std::tuple<bool, T, T> ray_sphere_intersection(const ray<T>& ray, const sphere<T>& sphere)
  45. {
  46. const auto d = ray.origin - sphere.center;
  47. const T b = math::dot(d, ray.direction);
  48. const T c = math::dot(d, d) - sphere.radius * sphere.radius;
  49. T h = b * b - c;
  50. if (h < T(0))
  51. return {false, T(0), T(0)};
  52. h = std::sqrt(h);
  53. return {true, -b - h, -b + h};
  54. }
  55. bool aabb_sphere_intersection(const aabb<float>& aabb, const float3& center, float radius);
  56. bool aabb_aabb_intersection(const aabb<float>& a, const aabb<float>& b);
  57. } // namespace geom
  58. #endif // ANTKEEPER_GEOM_INTERSECTION_HPP