mirror of https://github.com/CGAL/cgal
issue #7395 Improvement of layout of model relations
- Completed the cgalHasModel part - corrected spelling of `Has Model` and `Is Model Of` to `Has model` and `Is model of`
This commit is contained in:
albert-github
parent
c0db92d0e9
commit
ee2a55279d
|
|
@ -41,8 +41,8 @@ namespace CGAL {
|
||||||
* of `VertexPointPMap` (using the `Kernel_traits` mechanism).
|
* of `VertexPointPMap` (using the `Kernel_traits` mechanism).
|
||||||
* The segment type of the primitive (`Datum`) is `CGAL::Kernel_traits< boost::property_traits< VertexPointPMap >::%value_type >::%Kernel::Segment_3`.
|
* The segment type of the primitive (`Datum`) is `CGAL::Kernel_traits< boost::property_traits< VertexPointPMap >::%value_type >::%Kernel::Segment_3`.
|
||||||
*
|
*
|
||||||
* \cgalModelsBare{AABBPrimitive if `OneHalfedgeGraphPerTree` is `CGAL::Tag_false`,
|
* \cgalModelsBare{`AABBPrimitive` if `OneHalfedgeGraphPerTree` is `CGAL::Tag_false`,
|
||||||
* AABBPrimitiveWithSharedData if `OneHalfedgeGraphPerTree` is `CGAL::Tag_true`}
|
* `AABBPrimitiveWithSharedData` if `OneHalfedgeGraphPerTree` is `CGAL::Tag_true`}
|
||||||
*
|
*
|
||||||
* \tparam HalfedgeGraph is a model of the halfedge graph concept.
|
* \tparam HalfedgeGraph is a model of the halfedge graph concept.
|
||||||
* as key type and a \cgal Kernel `Point_3` as value type.
|
* as key type and a \cgal Kernel `Point_3` as value type.
|
||||||
|
|
|
||||||
|
|
@ -53,8 +53,8 @@ public:
|
||||||
* The two property maps which are template parameters of the class enable to get the datum and the reference point of
|
* The two property maps which are template parameters of the class enable to get the datum and the reference point of
|
||||||
* the primitive from the identifier. The last template parameter controls whether the primitive class holds a copy of the datum.
|
* the primitive from the identifier. The last template parameter controls whether the primitive class holds a copy of the datum.
|
||||||
*
|
*
|
||||||
* \cgalModelsBare{AABBPrimitive if `ExternalPropertyMaps` is `CGAL::Tag_false`,
|
* \cgalModelsBare{`AABBPrimitive` if `ExternalPropertyMaps` is `CGAL::Tag_false`,
|
||||||
* AABBPrimitiveWithSharedData if `ExternalPropertyMaps` is `CGAL::Tag_true`}
|
* `AABBPrimitiveWithSharedData` if `ExternalPropertyMaps` is `CGAL::Tag_true`}
|
||||||
*
|
*
|
||||||
* \tparam ObjectPropertyMap is a model of `ReadablePropertyMap` with `Id` as
|
* \tparam ObjectPropertyMap is a model of `ReadablePropertyMap` with `Id` as
|
||||||
* `key_type`. It must be a model of `CopyConstructible`, `DefaultConstructible`, and `CopyAssignable`.
|
* `key_type`. It must be a model of `CopyConstructible`, `DefaultConstructible`, and `CopyAssignable`.
|
||||||
|
|
|
||||||
|
|
@ -11,7 +11,7 @@ together with a few geometric predicates and constructions on these objects.
|
||||||
|
|
||||||
\cgalRefines{DelaunayTriangulationTraits_3}
|
\cgalRefines{DelaunayTriangulationTraits_3}
|
||||||
|
|
||||||
\cgalHasModel All models of `Kernel`.
|
\cgalHasModelsBare{All models of the concept `Kernel`}
|
||||||
*/
|
*/
|
||||||
class AdvancingFrontSurfaceReconstructionTraits_3
|
class AdvancingFrontSurfaceReconstructionTraits_3
|
||||||
{
|
{
|
||||||
|
|
|
||||||
|
|
@ -28,7 +28,8 @@ algebraic operations within that structure.
|
||||||
\sa `CGAL::Field_with_kth_root_tag`
|
\sa `CGAL::Field_with_kth_root_tag`
|
||||||
\sa `CGAL::Field_with_root_of_tag`
|
\sa `CGAL::Field_with_root_of_tag`
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Algebraic_structure_traits<T>`
|
\cgalHasModelsBegin CGAL::Algebraic_structure_traits<T>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -9,16 +9,17 @@ for Cartesian kernels.
|
||||||
|
|
||||||
\cgalRefines{Field,RealEmbeddable}
|
\cgalRefines{Field,RealEmbeddable}
|
||||||
|
|
||||||
\cgalHasModel float
|
\cgalHasModelsBegin float
|
||||||
\cgalHasModel double
|
\cgalHasModels double
|
||||||
\cgalHasModel `CGAL::Gmpq`
|
\cgalHasModels CGAL::Gmpq
|
||||||
\cgalHasModel `CGAL::Interval_nt`
|
\cgalHasModels CGAL::Interval_nt
|
||||||
\cgalHasModel `CGAL::Interval_nt_advanced`
|
\cgalHasModels CGAL::Interval_nt_advanced
|
||||||
\cgalHasModel `CGAL::Lazy_exact_nt<FieldNumberType>`
|
\cgalHasModels CGAL::Lazy_exact_nt<FieldNumberType>
|
||||||
\cgalHasModel `CGAL::Quotient<RingNumberType>`
|
\cgalHasModels CGAL::Quotient<RingNumberType>
|
||||||
\cgalHasModel `leda_rational`
|
\cgalHasModels leda_rational
|
||||||
\cgalHasModel `leda_bigfloat`
|
\cgalHasModels leda_bigfloat
|
||||||
\cgalHasModel `leda_real`
|
\cgalHasModels leda_real
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `RingNumberType`
|
\sa `RingNumberType`
|
||||||
\sa `Kernel`
|
\sa `Kernel`
|
||||||
|
|
|
||||||
|
|
@ -8,7 +8,8 @@ A model of `FractionTraits` is associated with a type `Type`.
|
||||||
In case the associated type is a `Fraction`, a model of `FractionTraits` provides the relevant functionality for decomposing and re-composing as well
|
In case the associated type is a `Fraction`, a model of `FractionTraits` provides the relevant functionality for decomposing and re-composing as well
|
||||||
as the numerator and denominator type.
|
as the numerator and denominator type.
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Fraction_traits<T>`
|
\cgalHasModelsBegin CGAL::Fraction_traits<T>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `FractionTraits_::Decompose`
|
\sa `FractionTraits_::Decompose`
|
||||||
\sa `FractionTraits_::Compose`
|
\sa `FractionTraits_::Compose`
|
||||||
|
|
|
||||||
|
|
@ -6,9 +6,10 @@
|
||||||
A model of the concept `FromIntConstructible` is required
|
A model of the concept `FromIntConstructible` is required
|
||||||
to be constructible from int.
|
to be constructible from int.
|
||||||
|
|
||||||
\cgalHasModel int
|
\cgalHasModelsBegin int
|
||||||
\cgalHasModel long
|
\cgalHasModels long
|
||||||
\cgalHasModel double
|
\cgalHasModels double
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -7,7 +7,8 @@ A model of `RealEmbeddableTraits` is associated to a number type
|
||||||
`Type` and reflects the properties of this type with respect
|
`Type` and reflects the properties of this type with respect
|
||||||
to the concept `RealEmbeddable`.
|
to the concept `RealEmbeddable`.
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Real_embeddable_traits<T>`
|
\cgalHasModelsBegin CGAL::Real_embeddable_traits<T>
|
||||||
|
\cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
|
|
||||||
class RealEmbeddableTraits {
|
class RealEmbeddableTraits {
|
||||||
|
|
|
||||||
|
|
@ -10,19 +10,19 @@ for Homogeneous kernels.
|
||||||
|
|
||||||
\cgalRefines{IntegralDomainWithoutDivision,RealEmbeddable}
|
\cgalRefines{IntegralDomainWithoutDivision,RealEmbeddable}
|
||||||
|
|
||||||
\cgalHasModel \cpp built-in number types
|
\cgalHasModelsBareBegin{\cpp built-in number types} CGAL::Gmpq
|
||||||
\cgalHasModel `CGAL::Gmpq`
|
\cgalHasModels CGAL::Gmpz
|
||||||
\cgalHasModel `CGAL::Gmpz`
|
\cgalHasModels CGAL::Interval_nt
|
||||||
\cgalHasModel `CGAL::Interval_nt`
|
\cgalHasModels CGAL::Interval_nt_advanced
|
||||||
\cgalHasModel `CGAL::Interval_nt_advanced`
|
\cgalHasModels CGAL::Lazy_exact_nt<RingNumberType>
|
||||||
\cgalHasModel `CGAL::Lazy_exact_nt<RingNumberType>`
|
\cgalHasModels CGAL::MP_Float
|
||||||
\cgalHasModel `CGAL::MP_Float`
|
\cgalHasModels CGAL::Gmpzf
|
||||||
\cgalHasModel `CGAL::Gmpzf`
|
\cgalHasModels CGAL::Quotient<RingNumberType>
|
||||||
\cgalHasModel `CGAL::Quotient<RingNumberType>`
|
\cgalHasModels leda_integer
|
||||||
\cgalHasModel `leda_integer`
|
\cgalHasModels leda_rational
|
||||||
\cgalHasModel `leda_rational`
|
\cgalHasModels leda_bigfloat
|
||||||
\cgalHasModel `leda_bigfloat`
|
\cgalHasModels leda_real
|
||||||
\cgalHasModel `leda_real`
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `FieldNumberType`
|
\sa `FieldNumberType`
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -8,8 +8,9 @@ algebraic functionalities on univariate polynomials of general degree \f$ d\f$.
|
||||||
|
|
||||||
\cgalRefines{CopyConstructible,Assignable}
|
\cgalRefines{CopyConstructible,Assignable}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Algebraic_kernel_rs_gmpz_d_1`
|
\cgalHasModelsBegin CGAL::Algebraic_kernel_rs_gmpz_d_1
|
||||||
\cgalHasModel `CGAL::Algebraic_kernel_rs_gmpq_d_1`
|
\cgalHasModels CGAL::Algebraic_kernel_rs_gmpq_d_1
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `AlgebraicKernel_d_2`
|
\sa `AlgebraicKernel_d_2`
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -9,7 +9,8 @@ The concept `AlphaShapeFace_2` describes the requirements for the base face of a
|
||||||
RegularTriangulationFaceBase_2 if the underlying triangulation of the alpha shape is a regular triangulation,
|
RegularTriangulationFaceBase_2 if the underlying triangulation of the alpha shape is a regular triangulation,
|
||||||
Periodic_2TriangulationFaceBase_2 if the underlying triangulation of the alpha shape is a periodic triangulation}
|
Periodic_2TriangulationFaceBase_2 if the underlying triangulation of the alpha shape is a periodic triangulation}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Alpha_shape_face_base_2` (templated with the appropriate triangulation face base class).
|
\cgalHasModelsBegin CGAL::Alpha_shape_face_base_2 (templated with the appropriate triangulation face base class)
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
*/
|
*/
|
||||||
class AlphaShapeFace_2 {
|
class AlphaShapeFace_2 {
|
||||||
|
|
|
||||||
|
|
@ -9,8 +9,7 @@ class of the underlying Delaunay triangulation of a basic alpha shape.
|
||||||
\cgalRefines{DelaunayTriangulationTraits_2 if the underlying triangulation of the alpha shape is a Delaunay triangulation,
|
\cgalRefines{DelaunayTriangulationTraits_2 if the underlying triangulation of the alpha shape is a Delaunay triangulation,
|
||||||
Periodic_2DelaunayTriangulationTraits_2 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation}
|
Periodic_2DelaunayTriangulationTraits_2 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation}
|
||||||
|
|
||||||
\cgalHasModel All models of `Kernel`.
|
\cgalHasModelsBare{All models of `Kernel`,Projection traits such as `CGAL::Projection_traits_xy_3<K>`}
|
||||||
\cgalHasModel Projection traits such as `CGAL::Projection_traits_xy_3<K>`.
|
|
||||||
|
|
||||||
\sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
|
\sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -9,7 +9,7 @@ The concept `AlphaShapeVertex_2` describes the requirements for the base vertex
|
||||||
RegularTriangulationVertexBase_2 if the underlying triangulation of the alpha shape is a regular triangulation,
|
RegularTriangulationVertexBase_2 if the underlying triangulation of the alpha shape is a regular triangulation,
|
||||||
Periodic_2TriangulationVertexBase_2 if the underlying triangulation of the alpha shape is a periodic triangulation}
|
Periodic_2TriangulationVertexBase_2 if the underlying triangulation of the alpha shape is a periodic triangulation}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Alpha_shape_vertex_base_2` (templated with the appropriate triangulation vertex base class).
|
\cgalHasModelsBare{`CGAL::Alpha_shape_vertex_base_2` (templated with the appropriate triangulation vertex base class)}
|
||||||
*/
|
*/
|
||||||
class AlphaShapeVertex_2 {
|
class AlphaShapeVertex_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -9,8 +9,7 @@ of the underlying regular triangulation of a weighted alpha shape.
|
||||||
|
|
||||||
\cgalRefines{RegularTriangulationTraits_2 if the underlying triangulation of the alpha shape is a regular triangulation.}
|
\cgalRefines{RegularTriangulationTraits_2 if the underlying triangulation of the alpha shape is a regular triangulation.}
|
||||||
|
|
||||||
\cgalHasModel All models of `Kernel`.
|
\cgalHasModelsBare{All models of `Kernel`,Projection traits such as `CGAL::Projection_traits_xy_3<K>`}
|
||||||
\cgalHasModel Projection traits such as `CGAL::Projection_traits_xy_3<K>`.
|
|
||||||
|
|
||||||
\sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
|
\sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -9,7 +9,7 @@ The concept `AlphaShapeCell_3` describes the requirements for the base cell of a
|
||||||
RegularTriangulationCellBase_3 if the underlying triangulation of the alpha shape is a regular triangulation,
|
RegularTriangulationCellBase_3 if the underlying triangulation of the alpha shape is a regular triangulation,
|
||||||
Periodic_3TriangulationDSCellBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
|
Periodic_3TriangulationDSCellBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class).
|
\cgalHasModelsBare{`CGAL::Alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class)}
|
||||||
|
|
||||||
\sa `CGAL::Alpha_status`
|
\sa `CGAL::Alpha_status`
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -10,7 +10,7 @@ of the underlying Delaunay triangulation of a basic alpha shape.
|
||||||
\cgalRefines{DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation,
|
\cgalRefines{DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation,
|
||||||
Periodic_3DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation}
|
Periodic_3DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation}
|
||||||
|
|
||||||
\cgalHasModel All models of `Kernel`.
|
\cgalHasModelsBare{All models of `Kernel`}
|
||||||
|
|
||||||
\sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
|
\sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -9,7 +9,7 @@ The concept `AlphaShapeVertex_3` describes the requirements for the base vertex
|
||||||
RegularTriangulationVertexBase_3 if the underlying triangulation of the alpha shape is a regular triangulation.
|
RegularTriangulationVertexBase_3 if the underlying triangulation of the alpha shape is a regular triangulation.
|
||||||
Periodic_3TriangulationDSVertexBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
|
Periodic_3TriangulationDSVertexBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class).
|
\cgalHasModelsBare{`CGAL::Alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class)}
|
||||||
|
|
||||||
\sa `CGAL::Alpha_status`
|
\sa `CGAL::Alpha_status`
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -9,7 +9,7 @@ The concept `FixedAlphaShapeCell_3` describes the requirements for the base cell
|
||||||
RegularTriangulationCellBase_3 if the underlying triangulation of the alpha shape is a regular triangulation,
|
RegularTriangulationCellBase_3 if the underlying triangulation of the alpha shape is a regular triangulation,
|
||||||
Periodic_3TriangulationDSCellBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
|
Periodic_3TriangulationDSCellBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Fixed_alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class).
|
\cgalHasModelsBare{`CGAL::Fixed_alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class)}
|
||||||
*/
|
*/
|
||||||
class FixedAlphaShapeCell_3 {
|
class FixedAlphaShapeCell_3 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -10,7 +10,7 @@ of the underlying Delaunay triangulation of a basic alpha shape with a fixed val
|
||||||
\cgalRefines{DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation,
|
\cgalRefines{DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation,
|
||||||
Periodic_3DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation}
|
Periodic_3DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation}
|
||||||
|
|
||||||
\cgalHasModel All models of `Kernel`.
|
\cgalHasModelsBare{All models of `Kernel`}
|
||||||
|
|
||||||
\sa CGAL::Exact_predicates_inexact_constructions_kernel (recommended kernel)
|
\sa CGAL::Exact_predicates_inexact_constructions_kernel (recommended kernel)
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -9,7 +9,7 @@ The concept `FixedAlphaShapeVertex_3` describes the requirements for the base ve
|
||||||
RegularTriangulationVertexBase_3 if the underlying triangulation of the alpha shape is a regular triangulation,
|
RegularTriangulationVertexBase_3 if the underlying triangulation of the alpha shape is a regular triangulation,
|
||||||
Periodic_3TriangulationDSVertexBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
|
Periodic_3TriangulationDSVertexBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Fixed_alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class).
|
\cgalHasModelsBare{`CGAL::Fixed_alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class)}
|
||||||
*/
|
*/
|
||||||
|
|
||||||
class FixedAlphaShapeVertex_3 {
|
class FixedAlphaShapeVertex_3 {
|
||||||
|
|
|
||||||
|
|
@ -9,7 +9,7 @@ for the geometric traits class of the underlying regular triangulation of a weig
|
||||||
\cgalRefines{RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a regular triangulation,
|
\cgalRefines{RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a regular triangulation,
|
||||||
Periodic_3RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic regular triangulation}
|
Periodic_3RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic regular triangulation}
|
||||||
|
|
||||||
\cgalHasModel All models of `Kernel`.
|
\cgalHasModelsBare{All models of `Kernel`}
|
||||||
|
|
||||||
\sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
|
\sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -10,7 +10,7 @@ of the underlying regular triangulation of a weighted alpha shape.
|
||||||
\cgalRefines{RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a regular triangulation,
|
\cgalRefines{RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a regular triangulation,
|
||||||
Periodic_3RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic regular triangulation}
|
Periodic_3RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic regular triangulation}
|
||||||
|
|
||||||
\cgalHasModel All models of `Kernel`.
|
\cgalHasModelsBare{All models of `Kernel`}
|
||||||
|
|
||||||
\sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
|
\sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -9,10 +9,11 @@ The concept `AlphaWrapOracle` defines the requirements for an Alpha Wrap <em>Ora
|
||||||
that answers a number of queries over the input of the algorithm.
|
that answers a number of queries over the input of the algorithm.
|
||||||
The oracle is the template parameter of the class `CGAL::Alpha_wraps_3_::Alpha_wrap_3`.
|
The oracle is the template parameter of the class `CGAL::Alpha_wraps_3_::Alpha_wrap_3`.
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Alpha_wraps_3_::Point_set_oracle`
|
\cgalHasModelsBegin CGAL::Alpha_wraps_3_::Point_set_oracle
|
||||||
\cgalHasModel `CGAL::Alpha_wraps_3_::Segment_soup_oracle`
|
\cgalHasModels CGAL::Alpha_wraps_3_::Segment_soup_oracle
|
||||||
\cgalHasModel `CGAL::Alpha_wraps_3_::Triangle_mesh_oracle`
|
\cgalHasModels CGAL::Alpha_wraps_3_::Triangle_mesh_oracle
|
||||||
\cgalHasModel `CGAL::Alpha_wraps_3_::Triangle_soup_oracle`
|
\cgalHasModels CGAL::Alpha_wraps_3_::Triangle_soup_oracle
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
*/
|
*/
|
||||||
template <typename GeomTraits>
|
template <typename GeomTraits>
|
||||||
|
|
|
||||||
|
|
@ -11,7 +11,7 @@ you require Kernel. Stitch_borders doesn't even have clear geometric traits requ
|
||||||
The concept `AlphaWrapTraits_3` defines the requirements for the geometric traits class
|
The concept `AlphaWrapTraits_3` defines the requirements for the geometric traits class
|
||||||
of an alpha wrap oracle.
|
of an alpha wrap oracle.
|
||||||
|
|
||||||
\cgalHasModel Any 3D %kernel is a model of this traits concept.
|
\cgalHasModelsBare{Any 3D %kernel is a model of this traits concept}
|
||||||
*/
|
*/
|
||||||
|
|
||||||
class AlphaWrapTraits_3
|
class AlphaWrapTraits_3
|
||||||
|
|
|
||||||
|
|
@ -27,7 +27,8 @@ We only describe the additional requirements with respect to the
|
||||||
|
|
||||||
\cgalRefines{TriangulationDataStructure_2}
|
\cgalRefines{TriangulationDataStructure_2}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Triangulation_data_structure_2<Vb,Fb>`
|
\cgalHasModelsBegin CGAL::Triangulation_data_structure_2<Vb,Fb>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `TriangulationDataStructure_2`
|
\sa `TriangulationDataStructure_2`
|
||||||
\sa `ApolloniusGraphVertexBase_2`
|
\sa `ApolloniusGraphVertexBase_2`
|
||||||
|
|
|
||||||
|
|
@ -19,7 +19,8 @@ next and previous level graphs.
|
||||||
`ApolloniusGraphHierarchyVertexBase_2` does not introduce any
|
`ApolloniusGraphHierarchyVertexBase_2` does not introduce any
|
||||||
types in addition to those of `ApolloniusGraphVertexBase_2`.
|
types in addition to those of `ApolloniusGraphVertexBase_2`.
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Apollonius_graph_hierarchy_vertex_base_2<CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden> >`
|
\cgalHasModelsBegin CGAL::Apollonius_graph_hierarchy_vertex_base_2<CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden> >
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `ApolloniusGraphDataStructure_2`
|
\sa `ApolloniusGraphDataStructure_2`
|
||||||
\sa `CGAL::Apollonius_graph_hierarchy_2<Gt,Agds>`
|
\sa `CGAL::Apollonius_graph_hierarchy_2<Gt,Agds>`
|
||||||
|
|
|
||||||
|
|
@ -12,8 +12,9 @@ it provides a type `Site_2`, which must be a model of the concept
|
||||||
constructions for sites and several function object
|
constructions for sites and several function object
|
||||||
types for the predicates.
|
types for the predicates.
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Apollonius_graph_traits_2<K,Method_tag>`
|
\cgalHasModelsBegin CGAL::Apollonius_graph_traits_2<K,Method_tag>
|
||||||
\cgalHasModel `CGAL::Apollonius_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>`
|
\cgalHasModels CGAL::Apollonius_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `CGAL::Apollonius_graph_2<Gt,Agds>`
|
\sa `CGAL::Apollonius_graph_2<Gt,Agds>`
|
||||||
\sa `CGAL::Apollonius_graph_traits_2<K,Method_tag>`
|
\sa `CGAL::Apollonius_graph_traits_2<K,Method_tag>`
|
||||||
|
|
|
||||||
|
|
@ -12,7 +12,8 @@ sites. The container stores the hidden sites related to the vertex.
|
||||||
|
|
||||||
\cgalRefines{TriangulationVertexBase_2}
|
\cgalRefines{TriangulationVertexBase_2}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden>`
|
\cgalHasModelsBegin CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `ApolloniusGraphDataStructure_2`
|
\sa `ApolloniusGraphDataStructure_2`
|
||||||
\sa `CGAL::Apollonius_graph_2<Gt,Agds>`
|
\sa `CGAL::Apollonius_graph_2<Gt,Agds>`
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{Functor}
|
* \cgalRefines{Functor}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementApproximateTraits_2::Approximate_2
|
* \cgalHasModelsBegin ArrangementApproximateTraits_2::Approximate_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class Approximate_2 {
|
class Approximate_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{Functor}
|
* \cgalRefines{Functor}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementXMonotoneTraits_2::Are_mergeable_2
|
* \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Are_mergeable_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class AreMergeable_2 {
|
class AreMergeable_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableTernaryFunction}
|
* \cgalRefines{AdaptableTernaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementOpenBoundaryTraits_2::Compare_x_near_boundary_2
|
* \cgalHasModelsBegin ArrangementOpenBoundaryTraits_2::Compare_x_near_boundary_
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class CompareXNearBoundary_2 {
|
class CompareXNearBoundary_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,9 +5,10 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableFunctor}
|
* \cgalRefines{AdaptableFunctor}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementHorizontalSideTraits_2::Compare_x_on_boundary_2
|
* \cgalHasModelsBegin ArrangementHorizontalSideTraits_2::Compare_x_on_boundary_2
|
||||||
* \cgalHasModel ArrangementOpenBoundaryTraits_2::Compare_x_on_boundary_2
|
* \cgalHasModels ArrangementOpenBoundaryTraits_2::Compare_x_on_boundary_2
|
||||||
* \cgalHasModel ArrangementSphericalBoundaryTraits_2::Compare_x_on_boundary_2
|
* \cgalHasModels ArrangementSphericalBoundaryTraits_2::Compare_x_on_boundary_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class CompareXOnBoundaryOfCurveEnd_2 {
|
class CompareXOnBoundaryOfCurveEnd_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,9 +5,10 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableFunctor}
|
* \cgalRefines{AdaptableFunctor}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementClosedBottomTraits_2::Compare_x_on_boundary_2
|
* \cgalHasModelsBegin ArrangementClosedBottomTraits_2::Compare_x_on_boundary_2
|
||||||
* \cgalHasModel ArrangementClosedTopTraits_2::Compare_x_on_boundary_2
|
* \cgalHasModels ArrangementClosedTopTraits_2::Compare_x_on_boundary_2
|
||||||
* \cgalHasModel ArrangementIdentifiedHorizontalTraits_2::Compare_x_on_boundary_2
|
* \cgalHasModels ArrangementIdentifiedHorizontalTraits_2::Compare_x_on_boundary_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class CompareXOnBoundary_2 {
|
class CompareXOnBoundary_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -4,7 +4,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableBinaryFunction}
|
* \cgalRefines{AdaptableBinaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementBasicTraits_2::Compare_x_2
|
* \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_x_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class CompareX_2 {
|
class CompareX_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableBinaryFunction}
|
* \cgalRefines{AdaptableBinaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementBasicTraits_2::Compare_xy_2
|
* \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_xy_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class CompareXy_2 {
|
class CompareXy_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableTernaryFunction}
|
* \cgalRefines{AdaptableTernaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementBasicTraits_2::Compare_y_at_x_left_2
|
* \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_y_at_x_left_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class CompareYAtXLeft_2 {
|
class CompareYAtXLeft_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableTernaryFunction}
|
* \cgalRefines{AdaptableTernaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementBasicTraits_2::Compare_y_at_x_right_2
|
* \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_y_at_x_right_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class CompareYAtXRight_2 {
|
class CompareYAtXRight_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableBinaryFunction}
|
* \cgalRefines{AdaptableBinaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementBasicTraits_2::Compare_y_at_x_2
|
* \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_y_at_x_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class CompareYAtX_2 {
|
class CompareYAtX_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableTernaryFunction}
|
* \cgalRefines{AdaptableTernaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementOpenBoundaryTraits_2::Compare_y_near_boundary_2
|
* \cgalHasModelsBegin ArrangementOpenBoundaryTraits_2::Compare_y_near_boundary_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class CompareYNearBoundary_2 {
|
class CompareYNearBoundary_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,10 +5,11 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableBinaryFunction}
|
* \cgalRefines{AdaptableBinaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementClosedLeftTraits_2::Compare_y_on_boundary_2
|
* \cgalHasModelsBegin ArrangementClosedLeftTraits_2::Compare_y_on_boundary_2
|
||||||
* \cgalHasModel ArrangementClosedRightTraits_2::Compare_y_on_boundary_2
|
* \cgalHasModels ArrangementClosedRightTraits_2::Compare_y_on_boundary_2
|
||||||
* \cgalHasModel ArrangementIdentifiedVerticalTraits_2::Compare_y_on_boundary_2
|
* \cgalHasModels ArrangementIdentifiedVerticalTraits_2::Compare_y_on_boundary_2
|
||||||
* \cgalHasModel ArrangementSphericalBoundaryTraits_2::Compare_y_on_boundary_2
|
* \cgalHasModels ArrangementSphericalBoundaryTraits_2::Compare_y_on_boundary_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class CompareYOnBoundary_2 {
|
class CompareYOnBoundary_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{Functor}
|
* \cgalRefines{Functor}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementConstructCurveTraits_2::Construct_curve_2
|
* \cgalHasModelsBegin ArrangementConstructCurveTraits_2::Construct_curve_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class ConstructCurve_2 {
|
class ConstructCurve_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableUnaryFunction}
|
* \cgalRefines{AdaptableUnaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementBasicTraits_2::Construct_max_vertex_2
|
* \cgalHasModelsBegin ArrangementBasicTraits_2::Construct_max_vertex_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class ConstructMaxVertex_2 {
|
class ConstructMaxVertex_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableUnaryFunction}
|
* \cgalRefines{AdaptableUnaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementBasicTraits_2::Construct_min_vertex_2
|
* \cgalHasModelsBegin ArrangementBasicTraits_2::Construct_min_vertex_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class ConstructMinVertex_2 {
|
class ConstructMinVertex_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{Functor}
|
* \cgalRefines{Functor}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementConstructXMonotoneCurveTraits_2::Construct_x_monotone_curve_2
|
* \cgalHasModelsBegin ArrangementConstructXMonotoneCurveTraits_2::Construct_x_monotone_curve_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class ConstructXMonotoneCurve_2 {
|
class ConstructXMonotoneCurve_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -6,7 +6,8 @@ namespace ArrTraits {
|
||||||
* represents a general planar curve.
|
* represents a general planar curve.
|
||||||
*
|
*
|
||||||
* \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
|
* \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
|
||||||
* \cgalHasModel ArrangementTraits_2::Curve_2
|
* \cgalHasModelsBegin ArrangementTraits_2::Curve_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class Curve_2 {
|
class Curve_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableBinaryFunction}
|
* \cgalRefines{AdaptableBinaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementBasicTraits_2::Equal_2
|
* \cgalHasModelsBegin ArrangementBasicTraits_2::Equal_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class Equal_2 {
|
class Equal_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{Functor}
|
* \cgalRefines{Functor}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementXMonotoneTraits_2::Intersect_2
|
* \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Intersect_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class Intersect_2 {
|
class Intersect_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableUnaryFunction}
|
* \cgalRefines{AdaptableUnaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementIdentifiedHorizontalTraits_2::Is_on_x_identification_2
|
* \cgalHasModelsBegin ArrangementIdentifiedHorizontalTraits_2::Is_on_x_identification_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class IsOnXIdentification_2 {
|
class IsOnXIdentification_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableUnaryFunction}
|
* \cgalRefines{AdaptableUnaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementIdentifiedVerticalTraits_2::Is_on_y_identification_2
|
* \cgalHasModelsBegin ArrangementIdentifiedVerticalTraits_2::Is_on_y_identification_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class IsOnYIdentification_2 {
|
class IsOnYIdentification_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableUnaryFunction}
|
* \cgalRefines{AdaptableUnaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementBasicTraits_2::Is_vertical_2
|
* \cgalHasModelsBegin ArrangementBasicTraits_2::Is_vertical_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class IsVertical_2 {
|
class IsVertical_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{Functor}
|
* \cgalRefines{Functor}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementTraits_2::Make_x_monotone_2
|
* \cgalHasModelsBegin ArrangementTraits_2::Make_x_monotone_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class MakeXMonotone_2 {
|
class MakeXMonotone_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{Functor}
|
* \cgalRefines{Functor}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementXMonotoneTraits_2::Merge_2
|
* \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Merge_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class Merge_2 {
|
class Merge_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,9 +5,10 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableBinaryFunction}
|
* \cgalRefines{AdaptableBinaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementVerticalSideTraits_2::Parameter_space_in_x_2
|
* \cgalHasModelsBegin ArrangementVerticalSideTraits_2::Parameter_space_in_x_2
|
||||||
* \cgalHasModel ArrangementOpenBoundaryTraits_2::Parameter_space_in_x_2
|
* \cgalHasModels ArrangementOpenBoundaryTraits_2::Parameter_space_in_x_2
|
||||||
* \cgalHasModel ArrangementSphericalBoundaryTraits_2::Parameter_space_in_x_2
|
* \cgalHasModels ArrangementSphericalBoundaryTraits_2::Parameter_space_in_x_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class ParameterSpaceInX_2 {
|
class ParameterSpaceInX_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -5,9 +5,10 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{AdaptableBinaryFunction}
|
* \cgalRefines{AdaptableBinaryFunction}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementHorizontalSideTraits_2::Parameter_space_in_y_2
|
* \cgalHasModelsBegin ArrangementHorizontalSideTraits_2::Parameter_space_in_y_2
|
||||||
* \cgalHasModel ArrangementOpenBoundaryTraits_2::Parameter_space_in_y_2
|
* \cgalHasModels ArrangementOpenBoundaryTraits_2::Parameter_space_in_y_2
|
||||||
* \cgalHasModel ArrangementSphericalBoundaryTraits_2::Parameter_space_in_y_2
|
* \cgalHasModels ArrangementSphericalBoundaryTraits_2::Parameter_space_in_y_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class ParameterSpaceInY_2 {
|
class ParameterSpaceInY_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -7,7 +7,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
|
* \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementBasicTraits_2::Point_2
|
* \cgalHasModelsBegin ArrangementBasicTraits_2::Point_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class Point_2 {
|
class Point_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -4,7 +4,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{Functor}
|
* \cgalRefines{Functor}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementXMonotoneTraits_2::Split_2
|
* \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Split_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class Split_2 {
|
class Split_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -6,7 +6,8 @@ namespace ArrTraits {
|
||||||
*
|
*
|
||||||
* \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
|
* \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
|
||||||
*
|
*
|
||||||
* \cgalHasModel ArrangementBasicTraits_2::X_monotone_curve_2
|
* \cgalHasModelsBegin ArrangementBasicTraits_2::X_monotone_curve_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class XMonotoneCurve_2 {
|
class XMonotoneCurve_2 {
|
||||||
public:
|
public:
|
||||||
|
|
|
||||||
|
|
@ -8,14 +8,15 @@ point.
|
||||||
|
|
||||||
\cgalRefines{ArrangementBasicTraits_2}
|
\cgalRefines{ArrangementBasicTraits_2}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
|
\cgalHasModelsBegin CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
|
||||||
\cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2`
|
\cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2
|
||||||
\cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
|
\cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
|
||||||
\cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
|
\cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
|
||||||
\cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
|
\cgalHasModels CGAL::Arr_segment_traits_2<Kernel>
|
||||||
\cgalHasModel `CGAL::Arr_polycurve_traits_2<GeometryTraits_2>`
|
\cgalHasModels CGAL::Arr_polycurve_traits_2<GeometryTraits_2>
|
||||||
\cgalHasModel `CGAL::Arr_polyline_traits_2<SegmentTraits_2>`
|
\cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits_2>
|
||||||
\cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
|
\cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `ArrangementConstructXMonotoneCurveTraits_2`,
|
\sa `ArrangementConstructXMonotoneCurveTraits_2`,
|
||||||
`ArrangementXMonotoneTraits_2`, and
|
`ArrangementXMonotoneTraits_2`, and
|
||||||
|
|
|
||||||
|
|
@ -9,7 +9,8 @@
|
||||||
* represent the arrangement cells (i.e., vertices, edges, and facets) and the
|
* represent the arrangement cells (i.e., vertices, edges, and facets) and the
|
||||||
* incident relations between them.
|
* incident relations between them.
|
||||||
*
|
*
|
||||||
* \cgalHasModel `CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2, Dcel>`
|
* \cgalHasModelsBegin CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2, Dcel>
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
|
|
||||||
class ArrangementBasicTopologyTraits {
|
class ArrangementBasicTopologyTraits {
|
||||||
|
|
|
||||||
|
|
@ -27,21 +27,22 @@
|
||||||
*
|
*
|
||||||
* \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
|
* \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
|
||||||
*
|
*
|
||||||
* \cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
|
* \cgalHasModelsBegin CGAL::Arr_segment_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_non_caching_segment_basic_traits_2<Kernel>`
|
* \cgalHasModels CGAL::Arr_non_caching_segment_basic_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
|
* \cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
|
* \cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_polyline_traits_2<SegmentTraits>`
|
* \cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits>
|
||||||
* \cgalHasModel `CGAL::Arr_circle_segment_traits_2<Kernel>`
|
* \cgalHasModels CGAL::Arr_circle_segment_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_line_arc_traits_2<CircularKernel>`
|
* \cgalHasModels CGAL::Arr_line_arc_traits_2<CircularKernel>
|
||||||
* \cgalHasModel `CGAL::Arr_circular_arc_traits_2<CircularKernel>`
|
* \cgalHasModels CGAL::Arr_circular_arc_traits_2<CircularKernel>
|
||||||
* \cgalHasModel `CGAL::Arr_circular_line_arc_traits_2<CircularKernel>`
|
* \cgalHasModels CGAL::Arr_circular_line_arc_traits_2<CircularKernel>
|
||||||
* \cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
|
* \cgalHasModels CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
|
||||||
* \cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
|
* \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
|
||||||
* \cgalHasModel `CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>`
|
* \cgalHasModels CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>
|
||||||
* \cgalHasModel `CGAL::Arr_algebraic_segment_traits_2<Coefficient>`
|
* \cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
|
||||||
* \cgalHasModel `CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>`
|
* \cgalHasModels CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>
|
||||||
* \cgalHasModel `CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>`
|
* \cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
|
|
||||||
class ArrangementBasicTraits_2 {
|
class ArrangementBasicTraits_2 {
|
||||||
|
|
|
||||||
|
|
@ -7,13 +7,14 @@
|
||||||
*
|
*
|
||||||
* \cgalRefines{ArrangementTraits_2}
|
* \cgalRefines{ArrangementTraits_2}
|
||||||
*
|
*
|
||||||
* \cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
|
* \cgalHasModelsBegin CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
|
||||||
* \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2`
|
* \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2
|
||||||
* \cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
|
* \cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
|
* \cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
|
* \cgalHasModels CGAL::Arr_segment_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_polyline_traits_2<SegmentTraits_2>`
|
* \cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits_2>
|
||||||
* \cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
|
* \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*
|
*
|
||||||
* \sa `ArrangementConstructXMonotoneCurveTraits_2`, and
|
* \sa `ArrangementConstructXMonotoneCurveTraits_2`, and
|
||||||
* `ArrangementTraits_2`
|
* `ArrangementTraits_2`
|
||||||
|
|
|
||||||
|
|
@ -7,13 +7,14 @@
|
||||||
*
|
*
|
||||||
* \cgalRefines{ArrangementBasicTraits_2}
|
* \cgalRefines{ArrangementBasicTraits_2}
|
||||||
*
|
*
|
||||||
* \cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
|
* \cgalHasModelsBegin CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
|
||||||
* \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2`
|
* \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2
|
||||||
* \cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
|
* \cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
|
* \cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
|
* \cgalHasModels CGAL::Arr_segment_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_polyline_traits_2<SegmentTraits_2>`
|
* \cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits_2>
|
||||||
* \cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
|
* \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*
|
*
|
||||||
* \sa `ArrangementApproximateTraits_2`,
|
* \sa `ArrangementApproximateTraits_2`,
|
||||||
* `ArrangementXMonotoneTraits_2`
|
* `ArrangementXMonotoneTraits_2`
|
||||||
|
|
|
||||||
|
|
@ -14,10 +14,11 @@
|
||||||
* `ArrangementDcelHalfedge`, `ArrangementDcelFace`, `ArrangementDcelOuterCcb`,
|
* `ArrangementDcelHalfedge`, `ArrangementDcelFace`, `ArrangementDcelOuterCcb`,
|
||||||
* `ArrangementDcelInnerCcb`, and `ArrangementDcelIsolatedVertex` respectively.)
|
* `ArrangementDcelInnerCcb`, and `ArrangementDcelIsolatedVertex` respectively.)
|
||||||
*
|
*
|
||||||
* \cgalHasModel `CGAL::Arr_dcel_base<V,H,F>`
|
* \cgalHasModelsBegin CGAL::Arr_dcel_base<V,H,F>
|
||||||
* \cgalHasModel `CGAL::Arr_default_dcel<Traits>`
|
* \cgalHasModels CGAL::Arr_default_dcel<Traits>
|
||||||
* \cgalHasModel `CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>`
|
* \cgalHasModels CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>
|
||||||
* \cgalHasModel `CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>`
|
* \cgalHasModels CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*
|
*
|
||||||
* \sa `ArrangementDcelVertex`
|
* \sa `ArrangementDcelVertex`
|
||||||
* \sa `ArrangementDcelHalfedge`
|
* \sa `ArrangementDcelHalfedge`
|
||||||
|
|
|
||||||
|
|
@ -10,9 +10,10 @@ Instantiate a dcel class with many different possible types without ad-hoc limit
|
||||||
|
|
||||||
\cgalRefines{ArrangementDcel}
|
\cgalRefines{ArrangementDcel}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Arr_default_dcel<Traits>`
|
\cgalHasModelsBegin CGAL::Arr_default_dcel<Traits>
|
||||||
\cgalHasModel `CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>`
|
\cgalHasModels CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>
|
||||||
\cgalHasModel `CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>`
|
\cgalHasModels CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -11,10 +11,11 @@
|
||||||
*
|
*
|
||||||
* \cgalRefines{ArrangementBasicTraits_2}
|
* \cgalRefines{ArrangementBasicTraits_2}
|
||||||
*
|
*
|
||||||
* \cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
|
* \cgalHasModelsBegin CGAL::Arr_linear_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
|
* \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
|
||||||
* \cgalHasModel `CGAL::Arr_algebraic_segment_traits_2<Coefficient>`
|
* \cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
|
||||||
* \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>`
|
* \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*
|
*
|
||||||
* \sa `ArrangementVerticalSideTraits_2`
|
* \sa `ArrangementVerticalSideTraits_2`
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -5,9 +5,10 @@
|
||||||
* functions that enable reading an arrangement from an input stream using a
|
* functions that enable reading an arrangement from an input stream using a
|
||||||
* specific format.
|
* specific format.
|
||||||
*
|
*
|
||||||
* \cgalHasModel `CGAL::Arr_text_formatter<Arrangement>`
|
* \cgalHasModelsBegin CGAL::Arr_text_formatter<Arrangement>
|
||||||
* \cgalHasModel `CGAL::Arr_face_extended_text_formatter<Arrangement>`
|
* \cgalHasModels CGAL::Arr_face_extended_text_formatter<Arrangement>
|
||||||
* \cgalHasModel `CGAL::Arr_extended_dcel_text_formatter<Arrangement>`
|
* \cgalHasModels CGAL::Arr_extended_dcel_text_formatter<Arrangement>
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*
|
*
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -11,14 +11,15 @@
|
||||||
*
|
*
|
||||||
* \cgalRefines{ArrangementApproximateTraits_2,ArrangementConstructXMonotoneCurveTraits_2}
|
* \cgalRefines{ArrangementApproximateTraits_2,ArrangementConstructXMonotoneCurveTraits_2}
|
||||||
*
|
*
|
||||||
* \cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
|
* \cgalHasModelsBegin CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
|
||||||
* \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2`
|
* \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2
|
||||||
* \cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
|
* \cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
|
* \cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
|
* \cgalHasModels CGAL::Arr_segment_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_polycurve_traits_2<GeometryTraits_2>`
|
* \cgalHasModels CGAL::Arr_polycurve_traits_2<GeometryTraits_2>
|
||||||
* \cgalHasModel `CGAL::Arr_polyline_traits_2<SegmentTraits_2>`
|
* \cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits_2>
|
||||||
* \cgalHasModel `CGAL::Arr_rational_function_traits_2`
|
* \cgalHasModels CGAL::Arr_rational_function_traits_2
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*
|
*
|
||||||
* \sa `ArrangementXMonotoneTraits_2` and
|
* \sa `ArrangementXMonotoneTraits_2` and
|
||||||
* `ArrangementTraits_2<AlgebraicKernel_d_1>`
|
* `ArrangementTraits_2<AlgebraicKernel_d_1>`
|
||||||
|
|
|
||||||
|
|
@ -39,11 +39,12 @@
|
||||||
*
|
*
|
||||||
* \cgalRefines{ArrangementBasicTraits_2}
|
* \cgalRefines{ArrangementBasicTraits_2}
|
||||||
*
|
*
|
||||||
* \cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
|
* \cgalHasModelsBegin CGAL::Arr_linear_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
|
* \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
|
||||||
* \cgalHasModel `CGAL::Arr_algebraic_segment_traits_2<Coefficient>`
|
* \cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
|
||||||
* \cgalHasModel `CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>`
|
* \cgalHasModels CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>
|
||||||
* \cgalHasModel `CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>`
|
* \cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*
|
*
|
||||||
* \sa `ArrangementBasicTraits_2`
|
* \sa `ArrangementBasicTraits_2`
|
||||||
* \sa `ArrangementXMonotoneTraits_2`
|
* \sa `ArrangementXMonotoneTraits_2`
|
||||||
|
|
|
||||||
|
|
@ -6,9 +6,10 @@
|
||||||
A model for the `ArrangementOutputFormatter` concept supports a set of functions that enable
|
A model for the `ArrangementOutputFormatter` concept supports a set of functions that enable
|
||||||
writing an arrangement to an output stream using a specific format.
|
writing an arrangement to an output stream using a specific format.
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Arr_text_formatter<Arrangement>`
|
\cgalHasModelsBegin CGAL::Arr_text_formatter<Arrangement>
|
||||||
\cgalHasModel `CGAL::Arr_face_extended_text_formatter<Arrangement>`
|
\cgalHasModels CGAL::Arr_face_extended_text_formatter<Arrangement>
|
||||||
\cgalHasModel `CGAL::Arr_extended_dcel_text_formatter<Arrangement>`
|
\cgalHasModels CGAL::Arr_extended_dcel_text_formatter<Arrangement>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -20,10 +20,11 @@ the old style without any overhead, the macro
|
||||||
`CGAL_ARR_POINT_LOCATION_VERSION` can be defined to 1 before any
|
`CGAL_ARR_POINT_LOCATION_VERSION` can be defined to 1 before any
|
||||||
\cgal header is included.
|
\cgal header is included.
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Arr_naive_point_location<Arrangement>`
|
\cgalHasModelsBegin CGAL::Arr_naive_point_location<Arrangement>
|
||||||
\cgalHasModel `CGAL::Arr_walk_along_line_point_location<Arrangement>`
|
\cgalHasModels CGAL::Arr_walk_along_line_point_location<Arrangement>
|
||||||
\cgalHasModel `CGAL::Arr_trapezoid_ric_point_location<Arrangement>`
|
\cgalHasModels CGAL::Arr_trapezoid_ric_point_location<Arrangement>
|
||||||
\cgalHasModel `CGAL::Arr_landmarks_point_location<Arrangement,Generator>`
|
\cgalHasModels CGAL::Arr_landmarks_point_location<Arrangement,Generator>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `CGAL::Arr_naive_point_location<Arrangement>`
|
\sa `CGAL::Arr_naive_point_location<Arrangement>`
|
||||||
\sa `CGAL::Arr_walk_along_line_point_location<Arrangement>`
|
\sa `CGAL::Arr_walk_along_line_point_location<Arrangement>`
|
||||||
|
|
|
||||||
|
|
@ -11,7 +11,8 @@
|
||||||
* \cgalRefines{ArrangementBasicTraits_2,ArrangementIdentifiedVerticalTraits_2,
|
* \cgalRefines{ArrangementBasicTraits_2,ArrangementIdentifiedVerticalTraits_2,
|
||||||
* ArrangementContractedBottomTraits_2,ArrangementContractedTopTraits_2}
|
* ArrangementContractedBottomTraits_2,ArrangementContractedTopTraits_2}
|
||||||
*
|
*
|
||||||
* \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>`
|
* \cgalHasModelsBegin CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*
|
*
|
||||||
* \sa `ArrangementOpenBoundaryTraits_2`
|
* \sa `ArrangementOpenBoundaryTraits_2`
|
||||||
* \sa `ArrangementBasicTraits_2`
|
* \sa `ArrangementBasicTraits_2`
|
||||||
|
|
|
||||||
|
|
@ -20,9 +20,10 @@
|
||||||
*
|
*
|
||||||
* At this point we do not expose all the requirements of this concept.
|
* At this point we do not expose all the requirements of this concept.
|
||||||
*
|
*
|
||||||
* \cgalHasModel `CGAL::Arr_bounded_planar_topology_traits_2<GeometryTraits_2,Dcel>`
|
* \cgalHasModelsBegin CGAL::Arr_bounded_planar_topology_traits_2<GeometryTraits_2,Dcel>
|
||||||
* \cgalHasModel `CGAL::Arr_unb_planar_topology_traits_2<GeometryTraits_2,Dcel>`
|
* \cgalHasModels CGAL::Arr_unb_planar_topology_traits_2<GeometryTraits_2,Dcel>
|
||||||
* \cgalHasModel `CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2,Dcel>`
|
* \cgalHasModels CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2,Dcel>
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*
|
*
|
||||||
* \sa `Arrangement_on_surface_2<GeometryTraits_2,TopologyTraits>`
|
* \sa `Arrangement_on_surface_2<GeometryTraits_2,TopologyTraits>`
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -30,20 +30,21 @@ that accept such curves, such as `intsert()`.
|
||||||
|
|
||||||
\cgalRefines{ArrangementXMonotoneTraits_2}
|
\cgalRefines{ArrangementXMonotoneTraits_2}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
|
\cgalHasModelsBegin CGAL::Arr_segment_traits_2<Kernel>
|
||||||
\cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
|
\cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
|
||||||
\cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
|
\cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
|
||||||
\cgalHasModel `CGAL::Arr_polyline_traits_2<SegmentTraits>`
|
\cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits>
|
||||||
\cgalHasModel `CGAL::Arr_circle_segment_traits_2<Kernel>`
|
\cgalHasModels CGAL::Arr_circle_segment_traits_2<Kernel>
|
||||||
\cgalHasModel `CGAL::Arr_line_arc_traits_2<CircularKernel>`
|
\cgalHasModels CGAL::Arr_line_arc_traits_2<CircularKernel>
|
||||||
\cgalHasModel `CGAL::Arr_circular_arc_traits_2<CircularKernel>`
|
\cgalHasModels CGAL::Arr_circular_arc_traits_2<CircularKernel>
|
||||||
\cgalHasModel `CGAL::Arr_circular_line_arc_traits_2<CircularKernel>`
|
\cgalHasModels CGAL::Arr_circular_line_arc_traits_2<CircularKernel>
|
||||||
\cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
|
\cgalHasModels CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
|
||||||
\cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
|
\cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
|
||||||
\cgalHasModel `CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>`
|
\cgalHasModels CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>
|
||||||
\cgalHasModel `CGAL::Arr_algebraic_segment_traits_2<Coefficient>`
|
\cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
|
||||||
\cgalHasModel `CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>`
|
\cgalHasModels CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>
|
||||||
\cgalHasModel `CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>`
|
\cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `ArrangementBasicTraits_2`
|
\sa `ArrangementBasicTraits_2`
|
||||||
\sa `ArrangementXMonotoneTraits_2`
|
\sa `ArrangementXMonotoneTraits_2`
|
||||||
|
|
|
||||||
|
|
@ -28,10 +28,11 @@ is recommended. To enable the old style without any overhead, the macro
|
||||||
`CGAL_ARR_POINT_LOCATION_VERSION` can be defined to 1 before any
|
`CGAL_ARR_POINT_LOCATION_VERSION` can be defined to 1 before any
|
||||||
\cgal header is included.
|
\cgal header is included.
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Arr_naive_point_location<Arrangement>`
|
\cgalHasModelsBegin CGAL::Arr_naive_point_location<Arrangement>
|
||||||
\cgalHasModel `CGAL::Arr_walk_along_line_point_location<Arrangement>`
|
\cgalHasModels CGAL::Arr_walk_along_line_point_location<Arrangement>
|
||||||
\cgalHasModel `CGAL::Arr_trapezoid_ric_point_location<Arrangement>`
|
\cgalHasModels CGAL::Arr_trapezoid_ric_point_location<Arrangement>
|
||||||
\cgalHasModel `CGAL::Arr_landmarks_point_location<Arrangement,Generator>`
|
\cgalHasModels CGAL::Arr_landmarks_point_location<Arrangement,Generator>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `CGAL::Arr_naive_point_location<Arrangement>`
|
\sa `CGAL::Arr_naive_point_location<Arrangement>`
|
||||||
\sa `CGAL::Arr_walk_along_line_point_location<Arrangement>`
|
\sa `CGAL::Arr_walk_along_line_point_location<Arrangement>`
|
||||||
|
|
|
||||||
|
|
@ -11,10 +11,11 @@
|
||||||
*
|
*
|
||||||
* \cgalRefines{ArrangementBasicTraits_2}
|
* \cgalRefines{ArrangementBasicTraits_2}
|
||||||
*
|
*
|
||||||
* \cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
|
* \cgalHasModelsBegin CGAL::Arr_linear_traits_2<Kernel>
|
||||||
* \cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
|
* \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
|
||||||
* \cgalHasModel `CGAL::Arr_algebraic_segment_traits_2<Coefficient>`
|
* \cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
|
||||||
* \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>`
|
* \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>
|
||||||
|
* \cgalHasModelsEnd
|
||||||
*
|
*
|
||||||
* \sa `ArrangementVerticalSideTraits_2`
|
* \sa `ArrangementVerticalSideTraits_2`
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -9,7 +9,8 @@ specific format.
|
||||||
|
|
||||||
\cgalRefines{ArrangementInputFormatter}
|
\cgalRefines{ArrangementInputFormatter}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Arr_with_history_text_formatter<ArrFormatter>`
|
\cgalHasModelsBegin CGAL::Arr_with_history_text_formatter<ArrFormatter>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -9,7 +9,8 @@ specific format.
|
||||||
|
|
||||||
\cgalRefines{ArrangementOutputFormatter}
|
\cgalRefines{ArrangementOutputFormatter}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Arr_with_history_text_formatter<ArrFormatter>`
|
\cgalHasModelsBegin CGAL::Arr_with_history_text_formatter<ArrFormatter>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -18,20 +18,21 @@ curve splitting.
|
||||||
|
|
||||||
\cgalRefines{ArrangementBasicTraits_2}
|
\cgalRefines{ArrangementBasicTraits_2}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
|
\cgalHasModelsBegin CGAL::Arr_segment_traits_2<Kernel>
|
||||||
\cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
|
\cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
|
||||||
\cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
|
\cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
|
||||||
\cgalHasModel `CGAL::Arr_polyline_traits_2<SegmentTraits>`
|
\cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits>
|
||||||
\cgalHasModel `CGAL::Arr_circle_segment_traits_2<Kernel>`
|
\cgalHasModels CGAL::Arr_circle_segment_traits_2<Kernel>
|
||||||
\cgalHasModel `CGAL::Arr_line_arc_traits_2<CircularKernel>`
|
\cgalHasModels CGAL::Arr_line_arc_traits_2<CircularKernel>
|
||||||
\cgalHasModel `CGAL::Arr_circular_arc_traits_2<CircularKernel>`
|
\cgalHasModels CGAL::Arr_circular_arc_traits_2<CircularKernel>
|
||||||
\cgalHasModel `CGAL::Arr_circular_line_arc_traits_2<CircularKernel>`
|
\cgalHasModels CGAL::Arr_circular_line_arc_traits_2<CircularKernel>
|
||||||
\cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
|
\cgalHasModels CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
|
||||||
\cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
|
\cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
|
||||||
\cgalHasModel `CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>`
|
\cgalHasModels CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>
|
||||||
\cgalHasModel `CGAL::Arr_algebraic_segment_traits_2<Coefficient>`
|
\cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
|
||||||
\cgalHasModel `CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>`
|
\cgalHasModels CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>
|
||||||
\cgalHasModel `CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>`
|
\cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `ArrangementBasicTraits_2`
|
\sa `ArrangementBasicTraits_2`
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -11,8 +11,9 @@ Models for the concept are used by the global `overlay()` function to
|
||||||
maintain the auxiliary data stored with the \dcel records of the resulting
|
maintain the auxiliary data stored with the \dcel records of the resulting
|
||||||
overlaid arrangement, based on the contents of the input records.
|
overlaid arrangement, based on the contents of the input records.
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Arr_default_overlay_traits<Arrangement>`
|
\cgalHasModelsBegin CGAL::Arr_default_overlay_traits<Arrangement>
|
||||||
\cgalHasModel `CGAL::Arr_face_overlay_traits<Arr1,Arr2,ResArr,OvlFaceData>`
|
\cgalHasModels CGAL::Arr_face_overlay_traits<Arr1,Arr2,ResArr,OvlFaceData>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `overlay`
|
\sa `overlay`
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -11,7 +11,7 @@ and adds the requirement for traversal of all edges in a graph.
|
||||||
|
|
||||||
\cgalRefines{<a href="https://www.boost.org/libs/graph/doc/Graph.html">Graph</a>}
|
\cgalRefines{<a href="https://www.boost.org/libs/graph/doc/Graph.html">Graph</a>}
|
||||||
|
|
||||||
\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
|
\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
|
||||||
|
|
||||||
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -20,7 +20,7 @@ A face descriptor must be `DefaultConstructible`, `Assignable`, `EqualityCompara
|
||||||
|
|
||||||
\cgalRefines{HalfedgeGraph}
|
\cgalRefines{HalfedgeGraph}
|
||||||
|
|
||||||
\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
|
\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
|
||||||
|
|
||||||
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -16,7 +16,7 @@ face iterator must be the same as the face descriptor of the graph.
|
||||||
|
|
||||||
\cgalRefines{FaceGraph}
|
\cgalRefines{FaceGraph}
|
||||||
|
|
||||||
\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
|
\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
|
||||||
|
|
||||||
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -38,7 +38,7 @@ An edge descriptor must be `DefaultConstructible`, `Assignable`, `EqualityCompar
|
||||||
|
|
||||||
A model of `HalfedgeGraph` must have the interior property `vertex_point` attached to its vertices.
|
A model of `HalfedgeGraph` must have the interior property `vertex_point` attached to its vertices.
|
||||||
|
|
||||||
\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
|
\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
|
||||||
|
|
||||||
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -16,7 +16,7 @@ halfedge iterator must be the same as the halfedge descriptor of the graph.
|
||||||
|
|
||||||
\cgalRefines{HalfedgeGraph}
|
\cgalRefines{HalfedgeGraph}
|
||||||
|
|
||||||
\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
|
\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
|
||||||
|
|
||||||
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -7,7 +7,7 @@ the requirement for operations to add faces and to modify face-halfedge relation
|
||||||
|
|
||||||
\cgalRefines{FaceGraph,MutableHalfedgeGraph}
|
\cgalRefines{FaceGraph,MutableHalfedgeGraph}
|
||||||
|
|
||||||
\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
|
\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
|
||||||
|
|
||||||
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -8,7 +8,7 @@ update the incidence information between vertices and halfedges.
|
||||||
|
|
||||||
\cgalRefines{HalfedgeGraph}
|
\cgalRefines{HalfedgeGraph}
|
||||||
|
|
||||||
\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
|
\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
|
||||||
|
|
||||||
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -11,7 +11,7 @@ and adds the requirement for traversal of all vertices in a graph.
|
||||||
|
|
||||||
\cgalRefines{<a href="https://www.boost.org/libs/graph/doc/Graph.html">Graph</a>}
|
\cgalRefines{<a href="https://www.boost.org/libs/graph/doc/Graph.html">Graph</a>}
|
||||||
|
|
||||||
\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
|
\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
|
||||||
|
|
||||||
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
\sa \link PkgBGLConcepts Graph Concepts \endlink
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -8,10 +8,10 @@ namespace Barycentric_coordinates {
|
||||||
A concept that describes the set of methods that should be defined for all coordinate
|
A concept that describes the set of methods that should be defined for all coordinate
|
||||||
models used to parameterize the class `Generalized_barycentric_coordinates_2`.
|
models used to parameterize the class `Generalized_barycentric_coordinates_2`.
|
||||||
|
|
||||||
\cgalHasModel
|
\cgalHasModelsBegin Wachspress_2
|
||||||
- `Wachspress_2`
|
\cgalHasModels Mean_value_2
|
||||||
- `Mean_value_2`
|
\cgalHasModels Discrete_harmonic_2
|
||||||
- `Discrete_harmonic_2`
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\deprecated This part of the package is deprecated since the version 5.4 of \cgal.
|
\deprecated This part of the package is deprecated since the version 5.4 of \cgal.
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -9,12 +9,11 @@ A concept that describes the set of requirements of the template parameter
|
||||||
`GeomTraits` used to parameterize all classes and functions with 2D barycentric
|
`GeomTraits` used to parameterize all classes and functions with 2D barycentric
|
||||||
coordinates from the namespace `CGAL::Barycentric_coordinates`.
|
coordinates from the namespace `CGAL::Barycentric_coordinates`.
|
||||||
|
|
||||||
\cgalHasModel
|
\cgalHasModelsBareBegin{All models of `Kernel`} CGAL::Projection_traits_3<K>
|
||||||
- All models of `Kernel`
|
\cgalHasModels CGAL::Projection_traits_xy_3<K>
|
||||||
- `CGAL::Projection_traits_3<K>`
|
\cgalHasModels CGAL::Projection_traits_yz_3<K>
|
||||||
- `CGAL::Projection_traits_xy_3<K>`
|
\cgalHasModels CGAL::Projection_traits_xz_3<K>
|
||||||
- `CGAL::Projection_traits_yz_3<K>`
|
\cgalHasModelsEnd
|
||||||
- `CGAL::Projection_traits_xz_3<K>`
|
|
||||||
*/
|
*/
|
||||||
class BarycentricTraits_2 {
|
class BarycentricTraits_2 {
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -13,7 +13,8 @@ elements, which share common edges and vertices. These finite elements are then
|
||||||
used to approximate certain types of generalized barycentric coordinate functions.
|
used to approximate certain types of generalized barycentric coordinate functions.
|
||||||
The domain is bounded by the polygon.
|
The domain is bounded by the polygon.
|
||||||
|
|
||||||
\cgalHasModel `Delaunay_domain_2`
|
\cgalHasModelsBegin Delaunay_domain_2
|
||||||
|
\cgalHasModelsEnd
|
||||||
*/
|
*/
|
||||||
class DiscretizedDomain_2 {
|
class DiscretizedDomain_2 {
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrDirectionalTraits {
|
||||||
|
|
||||||
\cgalRefines{AdaptableBinaryFunction}
|
\cgalRefines{AdaptableBinaryFunction}
|
||||||
|
|
||||||
\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Are_mergeable_2`
|
\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Are_mergeable_2
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -6,7 +6,8 @@ namespace ArrDirectionalTraits {
|
||||||
|
|
||||||
\cgalRefines{AdaptableUnaryFunction}
|
\cgalRefines{AdaptableUnaryFunction}
|
||||||
|
|
||||||
\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Compare_endpoints_xy_2`
|
\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Compare_endpoints_xy_2
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -6,7 +6,8 @@ namespace ArrDirectionalTraits {
|
||||||
|
|
||||||
\cgalRefines{AdaptableUnaryFunction}
|
\cgalRefines{AdaptableUnaryFunction}
|
||||||
|
|
||||||
\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Construct_opposite_2`
|
\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Construct_opposite_2
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrDirectionalTraits {
|
||||||
|
|
||||||
\cgalRefines{AdaptableBinaryFunction}
|
\cgalRefines{AdaptableBinaryFunction}
|
||||||
|
|
||||||
\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Intersect_2`
|
\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Intersect_2
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrDirectionalTraits {
|
||||||
|
|
||||||
\cgalRefines{AdaptableBinaryFunction}
|
\cgalRefines{AdaptableBinaryFunction}
|
||||||
|
|
||||||
\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Merge_2`
|
\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Merge_2
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -5,7 +5,8 @@ namespace ArrDirectionalTraits {
|
||||||
|
|
||||||
\cgalRefines{AdaptableUnaryFunction}
|
\cgalRefines{AdaptableUnaryFunction}
|
||||||
|
|
||||||
\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Split_2`
|
\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Split_2
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -16,13 +16,14 @@ as its <I>source</I> and the other as its <I>target</I>.
|
||||||
|
|
||||||
\cgalRefines{ArrangementXMonotoneTraits_2}
|
\cgalRefines{ArrangementXMonotoneTraits_2}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
|
\cgalHasModelsBegin CGAL::Arr_segment_traits_2<Kernel>
|
||||||
\cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
|
\cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
|
||||||
\cgalHasModel `CGAL::Arr_circle_segment_traits_2<Kernel>`
|
\cgalHasModels CGAL::Arr_circle_segment_traits_2<Kernel>
|
||||||
\cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
|
\cgalHasModels CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
|
||||||
\cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgKernel,NtTraits>`
|
\cgalHasModels CGAL::Arr_rational_function_traits_2<AlgKernel,NtTraits>
|
||||||
\cgalHasModel `CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>`
|
\cgalHasModels CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>
|
||||||
\cgalHasModel `CGAL::Arr_algebraic_segment_traits_2<Coefficient>`
|
\cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `ArrangementXMonotoneTraits_2`
|
\sa `ArrangementXMonotoneTraits_2`
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -16,7 +16,8 @@ respectively
|
||||||
|
|
||||||
\cgalRefines{ArrangementDcel}
|
\cgalRefines{ArrangementDcel}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Gps_default_dcel<Traits>`
|
\cgalHasModelsBegin CGAL::Gps_default_dcel<Traits>
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `GeneralPolygonSetDcelFace`
|
\sa `GeneralPolygonSetDcelFace`
|
||||||
\sa `GeneralPolygonSetDcelHalfedge`
|
\sa `GeneralPolygonSetDcelHalfedge`
|
||||||
|
|
|
||||||
|
|
@ -9,7 +9,8 @@ to represent the underlying internal `Arrangement_2` data structure.
|
||||||
|
|
||||||
\cgalRefines{ArrangementDcelFace}
|
\cgalRefines{ArrangementDcelFace}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Gps_face_base`
|
\cgalHasModelsBegin CGAL::Gps_face_base
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `ArrangementDcel`
|
\sa `ArrangementDcel`
|
||||||
\sa `ArrangementDcelVertex`
|
\sa `ArrangementDcelVertex`
|
||||||
|
|
|
||||||
|
|
@ -8,7 +8,8 @@ to represent the underlying internal `Arrangement_2` data structure.
|
||||||
|
|
||||||
\cgalRefines{ArrangementDcelHalfedge}
|
\cgalRefines{ArrangementDcelHalfedge}
|
||||||
|
|
||||||
\cgalHasModel `CGAL::Gps_face_halfedge`
|
\cgalHasModelsBegin CGAL::Gps_face_halfedge
|
||||||
|
\cgalHasModelsEnd
|
||||||
|
|
||||||
\sa `ArrangementDcel`
|
\sa `ArrangementDcel`
|
||||||
\sa `ArrangementDcelVertex`
|
\sa `ArrangementDcelVertex`
|
||||||
|
|
|
||||||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue