CGAL 6.2 - 3D Mesh Generation

Loading...
Searching...
No Matches
List of all members
IntersectionGeometricTraits_3 Concept Reference
Reference Manual » Secondary Concepts

## Definition

The concept `IntersectionGeometricTraits_3` provides types and functors required to implement a model of `MeshDomain_3`, when the domain is described by a simplicial surface mesh forming its boundary. The concept `IntersectionGeometricTraits_3` mainly provides the detection and construction of intersections between segments and triangles.

Has models
  All models of the CGAL concept `Kernel`

See also
  `BisectionGeometricTraits_3`
  `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT>`

## Types
typedef unspecified_type | Point_3
| Point type.
typedef unspecified_type | Segment_3
| Segment type.
typedef unspecified_type | Triangle_3
| Triangle type.
typedef unspecified_type | Do_intersect_3
| Function object that detects an intersection between a 3D segment and a 3D triangle.
typedef unspecified_type | Intersect_3
| Function object that constructs the intersection between a 3D segment and a 3D triangle.

## Operations
Do_intersect_3 | do_intersect_3_object ()
| Returns the intersection detection functor.
Intersect_3 | intersect_3_object ()
| Returns the intersection constructor.

## Member Typedef Documentation

## ◆ Do_intersect_3

typedef unspecified_type IntersectionGeometricTraits_3::Do_intersect_3

Function object that detects an intersection between a 3D segment and a 3D triangle.

Partial model of `Kernel::DoIntersect_3`. Provides the operators:

- `bool operator()(Segment_3 seg, Triangle_3 tr)`
- `bool operator()(Triangle_3 tr, Segment_3 seg)`

which returns `true`, iff the triangle and the segment have a non empty intersection.

## ◆ Intersect_3

typedef unspecified_type IntersectionGeometricTraits_3::Intersect_3

Function object that constructs the intersection between a 3D segment and a 3D triangle.

Partial model of `Kernel::Intersect_3`. Provides the operators:

- `std::optional< std::variant< Point_3, Segment_3 > > operator()(Segment_3 seg, Triangle_3 tr)`
- `std::optional< std::variant< Point_3, Segment_3 > > operator()(Triangle_3 tr, Segment_3 seg)`

which computes the intersection between the triangle and the segment.