ViewDesignEngine/include/vde/brep/trimmed_surface.h

#pragma once
#include "vde/curves/nurbs_surface.h"
#include "vde/curves/nurbs_curve.h"
#include "vde/core/point.h"
#include "vde/core/aabb.h"
#include "vde/mesh/halfedge_mesh.h"
#include <optional>
#include <vector>
#include <utility>

namespace vde::brep {

/// A p-curve: 2D curve in the parameter space of a surface
/// We reuse NurbsCurve with Z=0 — only X (u) and Y (v) are meaningful.
using PCurve = curves::NurbsCurve;

/// Trimming loop: closed contour in parameter space (u, v)
/// An outer loop defines the boundary; inner loops define holes.
struct TrimLoop {
    std::vector<PCurve> p_curves;  ///< parameter-space curves forming the loop
    bool is_outer = true;          ///< true = outer boundary, false = hole
};

/// A trimmed surface: base NURBS surface + trimming loops in parameter space
///
/// Point classification: a parameter (u, v) is INSIDE if it lies within
/// the outer loop AND outside all inner loops.
///
/// This is the fundamental B-Rep primitive used by all industrial CAD kernels
/// (Parasolid, ACIS, CGM).
///
/// @ingroup brep
struct TrimmedSurface {
    curves::NurbsSurface base_surface;  ///< Underlying geometry
    std::vector<TrimLoop> loops;        ///< Trimming loops (first = outer boundary if marked)

    /// Evaluate the surface at (u, v).
    /// Returns the 3D point only if (u, v) is inside the trimmed region.
    /// @return Point3D if inside, std::nullopt if outside
    [[nodiscard]] std::optional<core::Point3D> evaluate(double u, double v) const;

    /// Check if a parameter point is inside the trimmed region
    [[nodiscard]] bool is_inside(double u, double v) const;

    /// Compute winding number of point (u,v) relative to a loop
    /// Positive = inside (for counter-clockwise outer loop), 0 = outside
    [[nodiscard]] int winding_number(double u, double v, const TrimLoop& loop) const;

    /// Find the closest point on the boundary to (u,v) — for points outside trimmed region
    [[nodiscard]] core::Point3D closest_boundary_point(double u, double v) const;

    /// Get the axis-aligned bounding box of the trimmed surface
    [[nodiscard]] core::AABB3D bounds() const;

    /// Tessellate the trimmed surface to a triangle mesh
    /// Uses adaptive grid sampling with inside/outside testing
    /// @param deflection chord-height tolerance for tessellation
    /// @return HalfedgeMesh containing the triangulated trimmed surface
    [[nodiscard]] mesh::HalfedgeMesh to_mesh(double deflection = 0.01) const;

    /// Create an untrimmed surface (full parameter domain)
    static TrimmedSurface from_surface(const curves::NurbsSurface& surf);

    /// Create a rectangular trimmed surface
    static TrimmedSurface from_rect(const curves::NurbsSurface& surf,
                                    double u0, double u1, double v0, double v1);

    /// Create a trimmed surface with a circular hole
    static TrimmedSurface from_rect_with_hole(const curves::NurbsSurface& surf,
                                              double u0, double u1, double v0, double v1,
                                              double hole_uc, double hole_vc, double hole_r,
                                              int hole_segments = 32);

    /// Create a trimmed surface for a cylinder side patch
    /// u ranges [u0, u1] along circumference, v ranges [v0, v1] along height
    static TrimmedSurface from_cylinder_patch(const curves::NurbsSurface& cyl_surf,
                                              double u0, double u1, double v0, double v1);

    /// Create a trimmed surface for a sphere patch
    static TrimmedSurface from_sphere_patch(const curves::NurbsSurface& sphere_surf,
                                            double u0, double u1, double v0, double v1);
};

} // namespace vde::brep