// Copyright (c) 2012-2013, IGN France.
// Copyright (c) 2012-2024, Oslandia.
// Copyright (c) 2024-2025, SFCGAL team.
// SPDX-License-Identifier: LGPL-2.0-or-later

#ifndef SFCGAL_INTERSECTION_ALGORITHM
#define SFCGAL_INTERSECTION_ALGORITHM

#include "SFCGAL/config.h"

#include <memory>

namespace SFCGAL {
class Geometry;
namespace detail {
template <int Dim>
class GeometrySet;
template <int Dim>
struct PrimitiveHandle;
} // namespace detail

namespace algorithm {
struct NoValidityCheck;

/**
 * Intersection on 2D geometries.
 * @pre ga and gb are valid geometries
 */
SFCGAL_API std::unique_ptr<Geometry>
           intersection(const Geometry &ga, const Geometry &gb);

/**
 * Intersection on 2D geometries. No validity check variant
 * @pre ga and gb are valid geometries
 * @warning No actual validity check is done.
 */
SFCGAL_API std::unique_ptr<Geometry>
intersection(const Geometry &ga, const Geometry &gb, NoValidityCheck);

/**
 * Intersection on 3D geometries. Assume z = 0 if needed
 * @pre ga and gb are valid geometries
 */
SFCGAL_API std::unique_ptr<Geometry>
           intersection3D(const Geometry &ga, const Geometry &gb);

/**
 * Intersection on 3D geometries. Assume z = 0 if needed
 * @pre ga and gb are valid geometries
 * @warning@ No actual validity check is done
 */
SFCGAL_API std::unique_ptr<Geometry>
intersection3D(const Geometry &ga, const Geometry &gb, NoValidityCheck);

/**
 * @ingroup detail
 */
template <int Dim>
void
intersection(const detail::GeometrySet<Dim> &a,
             const detail::GeometrySet<Dim> &b, detail::GeometrySet<Dim> &);

/**
 * @ingroup detail
 */
template <int Dim>
void
intersection(const detail::PrimitiveHandle<Dim> &a,
             const detail::PrimitiveHandle<Dim> &b, detail::GeometrySet<Dim> &);

} // namespace algorithm
} // namespace SFCGAL

#endif
