mirror of https://github.com/CGAL/cgal
issue #7395 Improvement of layout of model relations
- Completed the cgalModels part
This commit is contained in:
albert-github
parent
ee2a55279d
commit
301728a8a9
|
|
@ -5,7 +5,7 @@ namespace CGAL {
|
|||
|
||||
An instance of `Algebraic_structure_traits` is a model of `AlgebraicStructureTraits`, where <span class="textsc">T</span> is the associated type.
|
||||
|
||||
\cgalModels `AlgebraicStructureTraits`
|
||||
\cgalModels{AlgebraicStructureTraits}
|
||||
|
||||
*/
|
||||
template< typename T >
|
||||
|
|
@ -22,7 +22,7 @@ namespace CGAL {
|
|||
Tag indicating that a type is a model of the
|
||||
`EuclideanRing` concept.
|
||||
|
||||
\cgalModels `DefaultConstructible`
|
||||
\cgalModels{DefaultConstructible}
|
||||
|
||||
\sa `EuclideanRing`
|
||||
\sa `AlgebraicStructureTraits`
|
||||
|
|
@ -38,7 +38,7 @@ struct Euclidean_ring_tag : public Unique_factorization_domain_tag {
|
|||
|
||||
Tag indicating that a type is a model of the `Field` concept.
|
||||
|
||||
\cgalModels `DefaultConstructible`
|
||||
\cgalModels{DefaultConstructible}
|
||||
|
||||
\sa `Field`
|
||||
\sa `AlgebraicStructureTraits`
|
||||
|
|
@ -54,7 +54,7 @@ struct Field_tag : public Integral_domain_tag {
|
|||
|
||||
Tag indicating that a type is a model of the `FieldWithKthRoot` concept.
|
||||
|
||||
\cgalModels `DefaultConstructible`
|
||||
\cgalModels{DefaultConstructible}
|
||||
|
||||
\sa `FieldWithKthRoot`
|
||||
\sa `AlgebraicStructureTraits`
|
||||
|
|
@ -70,7 +70,7 @@ struct Field_with_kth_root_tag : public Field_with_sqrt_tag {
|
|||
|
||||
Tag indicating that a type is a model of the `FieldWithRootOf` concept.
|
||||
|
||||
\cgalModels `DefaultConstructible`
|
||||
\cgalModels{DefaultConstructible}
|
||||
|
||||
\sa `FieldWithRootOf`
|
||||
\sa `AlgebraicStructureTraits`
|
||||
|
|
@ -86,7 +86,7 @@ struct Field_with_root_of_tag : public Field_with_kth_root_tag {
|
|||
|
||||
Tag indicating that a type is a model of the `FieldWithSqrt` concept.
|
||||
|
||||
\cgalModels `DefaultConstructible`
|
||||
\cgalModels{DefaultConstructible}
|
||||
|
||||
\sa `FieldWithSqrt`
|
||||
\sa `AlgebraicStructureTraits`
|
||||
|
|
@ -102,7 +102,7 @@ struct Field_with_sqrt_tag : public Field_tag {
|
|||
|
||||
Tag indicating that a type is a model of the `IntegralDomain` concept.
|
||||
|
||||
\cgalModels `DefaultConstructible`
|
||||
\cgalModels{DefaultConstructible}
|
||||
|
||||
\sa `IntegralDomain`
|
||||
\sa `AlgebraicStructureTraits`
|
||||
|
|
@ -118,7 +118,7 @@ struct Integral_domain_tag : public Integral_domain_without_division_tag {
|
|||
|
||||
Tag indicating that a type is a model of the `IntegralDomainWithoutDivision` concept.
|
||||
|
||||
\cgalModels `DefaultConstructible`
|
||||
\cgalModels{DefaultConstructible}
|
||||
|
||||
\sa `IntegralDomainWithoutDivision`
|
||||
|
||||
|
|
@ -133,7 +133,7 @@ struct Integral_domain_without_division_tag {
|
|||
|
||||
Tag indicating that a type is a model of the `UniqueFactorizationDomain` concept.
|
||||
|
||||
\cgalModels `DefaultConstructible`
|
||||
\cgalModels{DefaultConstructible}
|
||||
|
||||
\sa `UniqueFactorizationDomain`
|
||||
\sa `AlgebraicStructureTraits`
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@ namespace CGAL {
|
|||
An instance of `Fraction_traits` is a model of `FractionTraits`,
|
||||
where `T` is the associated type.
|
||||
|
||||
\cgalModels `FractionTraits`
|
||||
\cgalModels{FractionTraits}
|
||||
|
||||
*/
|
||||
template< typename T >
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@ namespace CGAL {
|
|||
|
||||
An instance of `Real_embeddable_traits` is a model of `RealEmbeddableTraits`, where <span class="textsc">T</span> is the associated type.
|
||||
|
||||
\cgalModels `RealEmbeddableTraits`
|
||||
\cgalModels{RealEmbeddableTraits}
|
||||
|
||||
*/
|
||||
template< typename T >
|
||||
|
|
|
|||
|
|
@ -27,7 +27,7 @@ approximation of an algebraic real root is a slightly modified
|
|||
(filtered) version of the one presented in \cgalCite{abbott-qir-06}. The
|
||||
method has quadratic convergence.
|
||||
|
||||
\cgalModels `AlgebraicKernel_d_1`
|
||||
\cgalModels{AlgebraicKernel_d_1}
|
||||
|
||||
\sa `AlgebraicKernel_d_1`
|
||||
\sa `Polynomial_d`
|
||||
|
|
|
|||
|
|
@ -47,7 +47,7 @@ above. `ROOT` should be one of the integer types. See also the
|
|||
documentation of `Sqrt_extension<NT,ROOT>`.
|
||||
\cgalAdvancedEnd
|
||||
|
||||
\cgalModels `AlgebraicKernel_d_2`
|
||||
\cgalModels{AlgebraicKernel_d_2}
|
||||
|
||||
\sa `AlgebraicKernel_d_1`
|
||||
\sa `AlgebraicKernel_d_2`
|
||||
|
|
|
|||
|
|
@ -12,7 +12,7 @@ rational univariate polynomial root isolation. It is a model of the
|
|||
isolate integer polynomials, the operations of this kernel have the
|
||||
overhead of converting the polynomials to integer.
|
||||
|
||||
\cgalModels `AlgebraicKernel_d_1`
|
||||
\cgalModels{AlgebraicKernel_d_1}
|
||||
|
||||
\sa `Algebraic_kernel_rs_gmpz_d_1`
|
||||
|
||||
|
|
|
|||
|
|
@ -10,7 +10,7 @@ This univariate algebraic kernel uses the Rs library to perform
|
|||
integer univariate polynomial root isolation. It is a model of the
|
||||
`AlgebraicKernel_d_1` concept.
|
||||
|
||||
\cgalModels `AlgebraicKernel_d_1`
|
||||
\cgalModels{AlgebraicKernel_d_1}
|
||||
|
||||
\sa `Algebraic_kernel_rs_gmpz_d_1`
|
||||
|
||||
|
|
|
|||
|
|
@ -16,7 +16,7 @@ if `Alpha_shape_face_base_2` is intended to be used with an alpha-shape class ba
|
|||
\link Tag_true `Tag_true`\endlink, triggers exact comparisons between alpha values. See the description
|
||||
provided in the documentation of `Alpha_shape_2` for more details. The default value is \link Tag_false `Tag_false`\endlink.
|
||||
|
||||
\cgalModels `AlphaShapeFace_2`
|
||||
\cgalModels{AlphaShapeFace_2}
|
||||
|
||||
\sa `Triangulation_face_base_2`
|
||||
\sa `Regular_triangulation_face_base_2`
|
||||
|
|
|
|||
|
|
@ -17,7 +17,7 @@ if `Alpha_shape_vertex_base_2` is intended to be used with an alpha-shape class
|
|||
\link Tag_true `Tag_true`\endlink, triggers exact comparisons between alpha values. See the description
|
||||
provided in the documentation of `Alpha_shape_2` for more details. The default value is \link Tag_false `Tag_false`\endlink.
|
||||
|
||||
\cgalModels `AlphaShapeVertex_2`
|
||||
\cgalModels{AlphaShapeVertex_2}
|
||||
|
||||
\sa `Triangulation_vertex_base_2`
|
||||
\sa `Regular_triangulation_vertex_base_2`
|
||||
|
|
|
|||
|
|
@ -19,7 +19,7 @@ provided in the documentation of `Alpha_shape_3` for more details. The default v
|
|||
must be \link Tag_true `Tag_true`\endlink if the underlying triangulation of the alpha shape to be used is a regular triangulation
|
||||
and \link Tag_false `Tag_false`\endlink otherwise. The default is \link Tag_false `Tag_false`\endlink.
|
||||
|
||||
\cgalModels `AlphaShapeCell_3`
|
||||
\cgalModels{AlphaShapeCell_3}
|
||||
|
||||
\sa `Delaunay_triangulation_cell_base_3`
|
||||
\sa `Regular_triangulation_cell_base_3`
|
||||
|
|
|
|||
|
|
@ -19,7 +19,7 @@ provided in the documentation of `Alpha_shape_3` for more details. The default v
|
|||
must be \link Tag_true `Tag_true`\endlink if the underlying triangulation of the alpha shape to be used is a regular triangulation
|
||||
and \link Tag_false `Tag_false`\endlink otherwise. The default is \link Tag_false `Tag_false`\endlink.
|
||||
|
||||
\cgalModels `AlphaShapeVertex_3`
|
||||
\cgalModels{AlphaShapeVertex_3}
|
||||
|
||||
\sa `Triangulation_vertex_base_3`
|
||||
\sa `Regular_triangulation_vertex_base_3`
|
||||
|
|
|
|||
|
|
@ -13,7 +13,7 @@ to the `Alpha_shape_3` class.
|
|||
By default, it is instantiated with `Delaunay_triangulation_cell_base_3<Traits>`,
|
||||
which is appropriate for basic alpha shapes.
|
||||
|
||||
\cgalModels `FixedAlphaShapeCell_3`
|
||||
\cgalModels{FixedAlphaShapeCell_3}
|
||||
|
||||
\sa `Alpha_shape_cell_base_3`
|
||||
\sa `Delaunay_triangulation_cell_base_3`
|
||||
|
|
|
|||
|
|
@ -13,7 +13,7 @@ to the `Alpha_shape_3` class.
|
|||
By default, it is instantiated with `Triangulation_vertex_base_3<Traits>`,
|
||||
which is appropriate for basic alpha shapes.
|
||||
|
||||
\cgalModels `FixedAlphaShapeVertex_3`
|
||||
\cgalModels{FixedAlphaShapeVertex_3}
|
||||
|
||||
\sa `Alpha_shape_vertex_base_3`
|
||||
\sa `Triangulation_vertex_base_3`
|
||||
|
|
|
|||
|
|
@ -46,7 +46,7 @@ ag.incident_edges(ag.infinite_vertex());
|
|||
ag.incident_edges(ag.infinite_vertex(), f);
|
||||
\endcode
|
||||
|
||||
\cgalModels `DelaunayGraph_2`
|
||||
\cgalModels{DelaunayGraph_2}
|
||||
|
||||
\sa `CGAL::Apollonius_graph_traits_2<K,Method_tag>`
|
||||
\sa `CGAL::Apollonius_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>`
|
||||
|
|
|
|||
|
|
@ -37,7 +37,7 @@ The default values for the template parameters are as follows:
|
|||
`FK = CGAL::Simple_cartesian<CGAL::Interval_nt<false> >`,
|
||||
`FM = CM`.
|
||||
|
||||
\cgalModels `ApolloniusGraphTraits_2`
|
||||
\cgalModels{ApolloniusGraphTraits_2}
|
||||
|
||||
\sa `Kernel`
|
||||
\sa `ApolloniusGraphTraits_2`
|
||||
|
|
|
|||
|
|
@ -11,7 +11,7 @@ vertex base required by the
|
|||
`Apollonius_graph_hierarchy_vertex_base_2` is templated by a class `Agvb` which must be a model
|
||||
of the `ApolloniusGraphVertexBase_2` concept.
|
||||
|
||||
\cgalModels `ApolloniusGraphHierarchyVertexBase_2`
|
||||
\cgalModels{ApolloniusGraphHierarchyVertexBase_2}
|
||||
|
||||
\sa `CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden>`
|
||||
\sa `CGAL::Triangulation_data_structure_2<Vb,Fb>`
|
||||
|
|
|
|||
|
|
@ -20,7 +20,7 @@ default value for `Method_tag` is `CGAL::Integral_domain_without_division_tag`.
|
|||
The way the predicates are evaluated is discussed in
|
||||
\cgalCite{cgal:ke-ppawv-02}, \cgalCite{cgal:ke-rctac-03}.
|
||||
|
||||
\cgalModels `ApolloniusGraphTraits_2`
|
||||
\cgalModels{ApolloniusGraphTraits_2}
|
||||
|
||||
\sa `CGAL::Apollonius_graph_2<Gt,Agds>`
|
||||
\sa `CGAL::Apollonius_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>`
|
||||
|
|
|
|||
|
|
@ -17,7 +17,7 @@ site can become visible. If `StoreHidden` is set to
|
|||
`true`, hidden sites are stored, otherwise they are
|
||||
discarded. By default `StoreHidden` is set to `true`.
|
||||
|
||||
\cgalModels `ApolloniusGraphVertexBase_2`
|
||||
\cgalModels{ApolloniusGraphVertexBase_2}
|
||||
|
||||
\sa `CGAL::Triangulation_data_structure_2<Vb,Fb>`
|
||||
\sa `CGAL::Apollonius_graph_hierarchy_vertex_base_2<Gt>`
|
||||
|
|
|
|||
|
|
@ -8,7 +8,7 @@ The class `Apollonius_site_2` is a model for the concept
|
|||
`ApolloniusSite_2`. It is parametrized by a template parameter
|
||||
`K` which must be a model of the `Kernel` concept.
|
||||
|
||||
\cgalModels `ApolloniusSite_2`
|
||||
\cgalModels{ApolloniusSite_2}
|
||||
|
||||
\cgalHeading{Types}
|
||||
|
||||
|
|
|
|||
|
|
@ -52,8 +52,7 @@ the `Are_mergeable_2` operation does not enforce the input curves
|
|||
to have the same direction as a precondition. Moreover, `Arr_Bezier_curve_traits_2`
|
||||
supports the merging of curves of opposite directions.
|
||||
|
||||
\cgalModels `ArrangementTraits_2`
|
||||
\cgalModels `ArrangementDirectionalXMonotoneTraits_2`
|
||||
\cgalModels{ArrangementTraits_2,ArrangementDirectionalXMonotoneTraits_2}
|
||||
|
||||
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -22,7 +22,7 @@ the types `leda::integer` and `CORE::BigInt` are supported as well
|
|||
as any instance of `CGAL::Sqrt_extension` that is instantiated with
|
||||
one of the integral types above.
|
||||
|
||||
\cgalModels `ArrangementTraits_2`
|
||||
\cgalModels{ArrangementTraits_2}
|
||||
|
||||
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -21,7 +21,7 @@ namespace CGAL {
|
|||
* `Arr_default_dcel<Traits>`.
|
||||
* </UL>
|
||||
*
|
||||
* \cgalModels `ArrangementBasicTopologyTraits`
|
||||
* \cgalModels{ArrangementBasicTopologyTraits}
|
||||
*
|
||||
* \sa `Arr_default_dcel<Traits>`
|
||||
* \sa `CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel,x,y>`
|
||||
|
|
|
|||
|
|
@ -32,8 +32,7 @@ namespace CGAL {
|
|||
* same direction as a precondition. Moreover, `Arr_circle_segment_traits_2`
|
||||
* supports the merging of curves of opposite directions.
|
||||
*
|
||||
* \cgalModels `ArrangementTraits_2`
|
||||
* \cgalModels `ArrangementDirectionalXMonotoneTraits_2`
|
||||
* \cgalModels{ArrangementTraits_2,ArrangementDirectionalXMonotoneTraits_2}
|
||||
*
|
||||
*/
|
||||
template< typename Kernel >
|
||||
|
|
|
|||
|
|
@ -8,7 +8,7 @@ This class is a traits class for \cgal arrangements, built on top of a model of
|
|||
concept `CircularKernel`.
|
||||
It provides curves of type `CGAL::Circular_arc_2<CircularKernel>`.
|
||||
|
||||
\cgalModels `ArrangementTraits_2`
|
||||
\cgalModels{ArrangementTraits_2}
|
||||
|
||||
*/
|
||||
template< typename CircularKernel >
|
||||
|
|
|
|||
|
|
@ -12,7 +12,7 @@ of both types
|
|||
|
||||
It uses the <A HREF="https://www.boost.org/doc/html/variant.html">boost::variant</A>.
|
||||
|
||||
\cgalModels `ArrangementTraits_2`
|
||||
\cgalModels{ArrangementTraits_2}
|
||||
|
||||
*/
|
||||
template< typename CircularKernel >
|
||||
|
|
|
|||
|
|
@ -80,9 +80,7 @@ namespace CGAL {
|
|||
* to have the same direction as a precondition. Moreover, `Arr_conic_traits_2`
|
||||
* supports the merging of curves of opposite directions.
|
||||
*
|
||||
* \cgalModels `ArrangementTraits_2`
|
||||
* \cgalModels `ArrangementLandmarkTraits_2`
|
||||
* \cgalModels `ArrangementDirectionalXMonotoneTraits_2`
|
||||
* \cgalModels{ArrangementTraits_2,ArrangementLandmarkTraits_2,ArrangementDirectionalXMonotoneTraits_2}
|
||||
*
|
||||
* \cgalHeading{Types}
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -21,7 +21,7 @@ both resulting subcurves. In case two (or more) \f$ x\f$-monotone curves
|
|||
overlap, their data sets are consolidated, and are inserted into the set
|
||||
of the \f$ x\f$-monotone curve that represents the overlap.
|
||||
|
||||
\cgalModels `ArrangementTraits_2`
|
||||
\cgalModels{ArrangementTraits_2}
|
||||
|
||||
*/
|
||||
template< typename Traits, typename Data >
|
||||
|
|
|
|||
|
|
@ -49,7 +49,7 @@ namespace CGAL {
|
|||
* `d1` and `d2`. The \f$ x\f$-monotone curve that represents the overlap is
|
||||
* associated with the output of this functor.
|
||||
*
|
||||
* \cgalModels `ArrangementTraits_2`
|
||||
* \cgalModels{ArrangementTraits_2}
|
||||
*/
|
||||
template <typename Tr, typename XData, typename Mrg, typename CData, typename Cnv>
|
||||
class Arr_curve_data_traits_2 : public Tr {
|
||||
|
|
|
|||
|
|
@ -16,7 +16,7 @@ must be instantiated with models of the concepts
|
|||
`ArrangementDcelVertex`, `ArrangementDcelHalfedge`,
|
||||
and `ArrangementDcelFace` respectively.
|
||||
|
||||
\cgalModels `ArrangementDcel`
|
||||
\cgalModels{ArrangementDcel}
|
||||
|
||||
*/
|
||||
template< typename V, typename H, typename F >
|
||||
|
|
@ -29,7 +29,7 @@ public:
|
|||
The basic \dcel face type. Serves as a basis class for an extended
|
||||
face record with auxiliary data fields.
|
||||
|
||||
\cgalModels `ArrangementDcelFace`
|
||||
\cgalModels{ArrangementDcelFace}
|
||||
|
||||
*/
|
||||
class Arr_face_base {
|
||||
|
|
@ -43,7 +43,7 @@ The basic \dcel halfedge type. Serves as a basis class for an
|
|||
extended halfedge record with auxiliary data fields. The `Curve`
|
||||
parameter is the type of \f$ x\f$-monotone curves associated with the vertices.
|
||||
|
||||
\cgalModels `ArrangementDcelHalfedge`
|
||||
\cgalModels{ArrangementDcelHalfedge}
|
||||
|
||||
*/
|
||||
template< typename Curve >
|
||||
|
|
@ -58,7 +58,7 @@ The basic \dcel vertex type. Serves as a basis class for an extended
|
|||
vertex record with auxiliary data fields. The `Point` parameter is
|
||||
the type of points associated with the vertices.
|
||||
|
||||
\cgalModels `ArrangementDcelVertex`
|
||||
\cgalModels{ArrangementDcelVertex}
|
||||
|
||||
*/
|
||||
template< typename Point >
|
||||
|
|
|
|||
|
|
@ -12,7 +12,7 @@ the base vertex and halfedge types, respectively. Thus, the default
|
|||
\dcel records store no other information, except for the topological
|
||||
incidence relations and the geometric data attached to vertices and edges.
|
||||
|
||||
\cgalModels `ArrangementDcelWithRebind`
|
||||
\cgalModels{ArrangementDcelWithRebind}
|
||||
|
||||
\sa `Arr_dcel_base<V,H,F>`
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -10,7 +10,7 @@ of type `Arrangement` that store no auxiliary data with their \dcel records, whe
|
|||
\dcel data as well. This class simply gives empty implementation for all
|
||||
traits-class functions.
|
||||
|
||||
\cgalModels `OverlayTraits`
|
||||
\cgalModels{OverlayTraits}
|
||||
|
||||
\sa `overlay`
|
||||
|
||||
|
|
@ -43,7 +43,7 @@ it uses the functor `OvlFaceData`, which accepts a `FaceData_A` object
|
|||
and a `FaceData_B` object and computes a corresponding `FaceData_R`
|
||||
object, in order to set the auxiliary data of the overlay face.
|
||||
|
||||
\cgalModels `OverlayTraits`
|
||||
\cgalModels{OverlayTraits}
|
||||
|
||||
\sa `overlay`
|
||||
\sa `CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>`
|
||||
|
|
|
|||
|
|
@ -33,7 +33,7 @@ The default values follow:
|
|||
|
||||
</TABLE>
|
||||
|
||||
\cgalModels `ArrangementDcelWithRebind`
|
||||
\cgalModels{ArrangementDcelWithRebind}
|
||||
|
||||
\sa `Arr_dcel_base<V,H,F>`
|
||||
|
||||
|
|
@ -57,7 +57,7 @@ The `Arr_extended_face` class-template extends the face topological-features of
|
|||
\dcel. It is parameterized by a face base-type `FaceBase` and a data type
|
||||
`FData` used to extend the face base-type.
|
||||
|
||||
\cgalModels `ArrangementDcelFace`
|
||||
\cgalModels{ArrangementDcelFace}
|
||||
|
||||
\sa `Arr_dcel_base<V,H,F>`
|
||||
|
||||
|
|
@ -109,7 +109,7 @@ The `Arr_extended_halfedge` class-template extends the halfedge topological-feat
|
|||
the \dcel. It is parameterized by a halfedge base-type `HalfedgeBase`
|
||||
and a data type `HData` used to extend the halfedge base-type.
|
||||
|
||||
\cgalModels `ArrangementDcelHalfedge`
|
||||
\cgalModels{ArrangementDcelHalfedge}
|
||||
|
||||
\sa `Arr_dcel_base<V,H,F>`
|
||||
|
||||
|
|
@ -162,7 +162,7 @@ topological-features of the \dcel. It is parameterized by a
|
|||
vertex base-type `VertexBase` and a data type `VData` used to extend
|
||||
the vertex base-type.
|
||||
|
||||
\cgalModels `ArrangementDcelVertex`
|
||||
\cgalModels{ArrangementDcelVertex}
|
||||
|
||||
\sa `Arr_dcel_base<V,H,F>`
|
||||
|
||||
|
|
@ -235,7 +235,7 @@ as follows:
|
|||
|
||||
</TABLE>
|
||||
|
||||
\cgalModels `ArrangementDcelWithRebind`
|
||||
\cgalModels{ArrangementDcelWithRebind}
|
||||
|
||||
\sa `Arr_dcel_base<V,H,F>`
|
||||
|
||||
|
|
|
|||
|
|
@ -19,10 +19,7 @@ existing faces might be removed, the notification mechanism is used
|
|||
to dynamically maintain the mapping of face handles to indices.
|
||||
|
||||
|
||||
\cgalModels DefaultConstructible
|
||||
\cgalModels CopyConstructible
|
||||
\cgalModels Assignable
|
||||
\cgalModels `ReadablePropertyMap`
|
||||
\cgalModels{DefaultConstructible,CopyConstructible,Assignable,ReadablePropertyMap}
|
||||
|
||||
\sa `Arr_observer<Arrangement>`
|
||||
\sa `Arr_vertex_index_map<Arrangement>`
|
||||
|
|
|
|||
|
|
@ -39,9 +39,7 @@ namespace CGAL {
|
|||
* normalized vector \f$(x,y)\f$ in the \f$xy\f$-plane that bisects the
|
||||
* identification curve.
|
||||
|
||||
* \cgalModels `ArrangementTraits_2`
|
||||
* \cgalModels `ArrangementLandmarkTraits_2`
|
||||
* \cgalModels `ArrangementSphericalBoundaryTraits_2`
|
||||
* \cgalModels{ArrangementTraits_2,ArrangementLandmarkTraits_2,ArrangementSphericalBoundaryTraits_2}
|
||||
*/
|
||||
|
||||
template <typename Kernel, typename X, typename Y>
|
||||
|
|
@ -52,9 +50,7 @@ namespace CGAL {
|
|||
* not-necessarily normalized 3D direction extended with information that
|
||||
* specifies the location of the point pre-image in the parameter space.
|
||||
*
|
||||
* \cgalModels `Assignable`
|
||||
* \cgalModels `DefaultConstructible`
|
||||
* \cgalModels `CopyConstructible`
|
||||
* \cgalModels{Assignable,DefaultConstructible,CopyConstructible}
|
||||
*/
|
||||
class Point_2 {
|
||||
public:
|
||||
|
|
@ -118,9 +114,7 @@ namespace CGAL {
|
|||
* intersect the identified left and right sides of the boundary of the
|
||||
* parameter space.
|
||||
*
|
||||
* \cgalModels `Assignable`
|
||||
* \cgalModels `DefaultConstructible`
|
||||
* \cgalModels `CopyConstructible`
|
||||
* \cgalModels{Assignable,DefaultConstructible,CopyConstructible}
|
||||
*/
|
||||
class X_monotone_curve_2 {
|
||||
public:
|
||||
|
|
@ -287,10 +281,7 @@ namespace CGAL {
|
|||
|
||||
/*! Construction functor of a point.
|
||||
*
|
||||
* \cgalModels `Assignable`
|
||||
* \cgalModels `CopyConstructible`
|
||||
* \cgalModels `AdaptableUnaryFunction`
|
||||
* \cgalModels `AdaptableTernaryFunction`
|
||||
* \cgalModels{Assignable,CopyConstructible,AdaptableUnaryFunction,AdaptableTernaryFunction}
|
||||
*/
|
||||
/*!
|
||||
*/
|
||||
|
|
@ -325,11 +316,7 @@ namespace CGAL {
|
|||
|
||||
/*! Construction functor of \f$x\f$-monotone geodesic arcs.
|
||||
*
|
||||
* \cgalModels `Assignable`
|
||||
* \cgalModels `CopyConstructible`
|
||||
* \cgalModels `AdaptableUnaryFunction`
|
||||
* \cgalModels `AdaptableBinaryFunction`
|
||||
* \cgalModels `AdaptableTernaryFunction`
|
||||
* \cgalModels{Assignable,CopyConstructible,AdaptableUnaryFunction,AdaptableBinaryFunction,AdaptableTernaryFunction}
|
||||
*/
|
||||
class Construct_x_monotone_curve_2 {
|
||||
public:
|
||||
|
|
@ -393,11 +380,7 @@ namespace CGAL {
|
|||
|
||||
/*! Construction functor of geodesic arcs.
|
||||
*
|
||||
* \cgalModels `Assignable`
|
||||
* \cgalModels `CopyConstructible`
|
||||
* \cgalModels `AdaptableUnaryFunction`
|
||||
* \cgalModels `AdaptableBinaryFunction`
|
||||
* \cgalModels `AdaptableTernaryFunction`
|
||||
* \cgalModels{Assignable,CopyConstructible,AdaptableUnaryFunction,AdaptableBinaryFunction,AdaptableTernaryFunction}
|
||||
*/
|
||||
class Construct_curve_2 {
|
||||
public:
|
||||
|
|
|
|||
|
|
@ -47,8 +47,7 @@ when the application frequently issues point-location queries on a
|
|||
rather static arrangement that the changes applied to it are mainly
|
||||
insertions of curves and not deletions of them.
|
||||
|
||||
\cgalModels `ArrangementPointLocation_2`
|
||||
\cgalModels `ArrangementVerticalRayShoot_2`
|
||||
\cgalModels{ArrangementPointLocation_2,ArrangementVerticalRayShoot_2}
|
||||
|
||||
\sa `ArrangementPointLocation_2`
|
||||
\sa `ArrangementVerticalRayShoot_2`
|
||||
|
|
|
|||
|
|
@ -8,7 +8,7 @@ This class is a traits class for \cgal arrangements, built on top of a
|
|||
model of concept `CircularKernel`. It provides curves of type
|
||||
`CGAL::Line_arc_2<CircularKernel>`.
|
||||
|
||||
\cgalModels `ArrangementTraits_2`
|
||||
\cgalModels{ArrangementTraits_2}
|
||||
|
||||
*/
|
||||
template< typename CircularKernel >
|
||||
|
|
|
|||
|
|
@ -21,9 +21,7 @@ namespace CGAL {
|
|||
* we can find out its actual type and convert it to the respective kernel
|
||||
* object (say, to a `Kernel::Ray_2`).
|
||||
*
|
||||
* \cgalModels `ArrangementTraits_2`
|
||||
* \cgalModels `ArrangementLandmarkTraits_2`
|
||||
* \cgalModels `ArrangementOpenBoundaryTraits_2`
|
||||
* \cgalModels{ArrangementTraits_2,ArrangementLandmarkTraits_2,ArrangementOpenBoundaryTraits_2}
|
||||
*/
|
||||
template< typename Kernel >
|
||||
class Arr_linear_traits_2 {
|
||||
|
|
|
|||
|
|
@ -13,8 +13,7 @@ The query time is therefore linear in the complexity of the arrangement.
|
|||
Naturally, this point-location strategy could turn into a heavy
|
||||
time-consuming process when applied to dense arrangements.
|
||||
|
||||
\cgalModels `ArrangementPointLocation_2`
|
||||
\cgalModels `ArrangementVerticalRayShoot_2`
|
||||
\cgalModels{ArrangementPointLocation_2,ArrangementVerticalRayShoot_2}
|
||||
|
||||
\sa `ArrangementPointLocation_2`
|
||||
\sa `ArrangementVerticalRayShoot_2`
|
||||
|
|
|
|||
|
|
@ -21,7 +21,7 @@ instantiations for the kernel. Using other (inexact) number types
|
|||
`Simple_cartesian<double>`) is also possible, at the user's own
|
||||
risk.
|
||||
|
||||
\cgalModels `ArrangementLandmarkTraits_2`
|
||||
\cgalModels{ArrangementLandmarkTraits_2}
|
||||
|
||||
*/
|
||||
template< typename Kernel >
|
||||
|
|
|
|||
|
|
@ -32,9 +32,7 @@ the `Are_mergeable_2` operation does not enforce the input curves
|
|||
to have the same direction as a precondition. Moreover, `Arr_non_caching_segment_traits_2`
|
||||
supports the merging of curves of opposite directions.
|
||||
|
||||
\cgalModels `ArrangementTraits_2`
|
||||
\cgalModels `ArrangementLandmarkTraits_2`
|
||||
\cgalModels `ArrangementDirectionalXMonotoneTraits_2`
|
||||
\cgalModels{ArrangementTraits_2,ArrangementLandmarkTraits_2,ArrangementDirectionalXMonotoneTraits_2}
|
||||
|
||||
\sa `Arr_segment_traits_2<Kernel>`
|
||||
|
||||
|
|
|
|||
|
|
@ -72,10 +72,9 @@ namespace CGAL {
|
|||
* set the macro `CGAL_ALWAYS_LEFT_TO_RIGHT` to 1 before any \cgal header is
|
||||
* included.
|
||||
*
|
||||
* \cgalModels `ArrangementTraits_2`
|
||||
* \cgalModels `ArrangementDirectionalXMonotoneTraits_2`
|
||||
* \cgalModels `ArrangementApproximateTraits_2` (if the type that substitutes
|
||||
* the template parameter `SubcurveTraits_2` models the concept as well)
|
||||
* \cgalModels{ArrangementTraits_2,ArrangementDirectionalXMonotoneTraits_2,
|
||||
* ArrangementApproximateTraits_2 (if the type that substitutes
|
||||
* the template parameter `SubcurveTraits_2` models the concept as well)}
|
||||
*
|
||||
* \sa `Arr_algebraic_segment_traits_2<Coefficient>`
|
||||
* \sa `Arr_Bezier_curve_traits_2<RatKernel, AlgKernel, NtTraits>`
|
||||
|
|
|
|||
|
|
@ -77,12 +77,9 @@ namespace CGAL {
|
|||
* the macro `CGAL_ALWAYS_LEFT_TO_RIGHT` to 1 before any \cgal header is
|
||||
* included.
|
||||
*
|
||||
* \cgalModels `ArrangementTraits_2`
|
||||
* \cgalModels `ArrangementDirectionalXMonotoneTraits_2`
|
||||
* \cgalModels `ArrangementConstructXMonotoneCurveTraits_2`
|
||||
* \cgalModels `ArrangementConstructCurveTraits_2`
|
||||
* \cgalModels `ArrangementApproximateTraits_2` (if the type that substitutes
|
||||
* the template parameter `SegmentTraits_2` models the concept as well)
|
||||
* \cgalModels{ArrangementTraits_2,ArrangementDirectionalXMonotoneTraits_2,`ArrangementConstructXMonotoneCurveTraits_2`
|
||||
* ArrangementConstructCurveTraits_2,ArrangementApproximateTraits_2 (if the type that substitutes
|
||||
* the template parameter `SegmentTraits_2` models the concept as well)}
|
||||
*
|
||||
* \sa `Arr_polycurve_traits_2<SubcurveTraits_2>`
|
||||
* \sa `Arr_Bezier_curve_traits_2<RatKernel, AlgKernel, NtTraits>`
|
||||
|
|
|
|||
|
|
@ -52,9 +52,7 @@ namespace CGAL {
|
|||
to have the same direction as a precondition. Moreover, `Arr_rational_function_traits_2`
|
||||
supports the merging of curves of opposite directions.
|
||||
|
||||
\cgalModels `ArrangementTraits_2`
|
||||
\cgalModels `ArrangementDirectionalXMonotoneTraits_2`
|
||||
\cgalModels `ArrangementOpenBoundaryTraits_2`
|
||||
\cgalModels{ArrangementTraits_2,ArrangementDirectionalXMonotoneTraits_2,ArrangementOpenBoundaryTraits_2}
|
||||
*/
|
||||
template< typename AlgebraicKernel_d_1 >
|
||||
class Arr_rational_function_traits_2 {
|
||||
|
|
@ -134,10 +132,7 @@ Functor to construct a `Curve_2`. To enable caching the class is not
|
|||
default constructible and must be obtained via the function
|
||||
`construct_curve_2_object()`, which is a member of the traits.
|
||||
|
||||
\cgalModels `Assignable`
|
||||
\cgalModels `CopyConstructible`
|
||||
\cgalModels `AdaptableBinaryFunction`
|
||||
\cgalModels `AdaptableUnaryFunction`
|
||||
\cgalModels{Assignable,CopyConstructible,AdaptableBinaryFunction,AdaptableUnaryFunction}
|
||||
|
||||
*/
|
||||
class Construct_curve_2 {
|
||||
|
|
@ -289,10 +284,7 @@ Functor to construct a `X_monotone_curve_2`. To enable caching the class
|
|||
is not default constructible and must be obtained via the function
|
||||
`construct_x_monotone_curve_2_object()`, which is a member of the traits.
|
||||
|
||||
\cgalModels `Assignable`
|
||||
\cgalModels `CopyConstructible`
|
||||
\cgalModels `AdaptableBinaryFunction`
|
||||
\cgalModels `AdaptableUnaryFunction`
|
||||
\cgalModels{Assignable,CopyConstructible,AdaptableBinaryFunction,AdaptableUnaryFunction}
|
||||
|
||||
*/
|
||||
class Construct_x_monotone_curve_2 {
|
||||
|
|
@ -460,7 +452,7 @@ const Algebraic_real_1& lower, const Algebraic_real_1& upper); const
|
|||
The `Curve_2` class nested within the traits is used
|
||||
to represent rational functions which may be restricted to a certain x-range.
|
||||
|
||||
\cgalModels `ArrTraits::Curve_2`
|
||||
\cgalModels{ArrTraits::Curve_2}
|
||||
|
||||
*/
|
||||
class Curve_2 {
|
||||
|
|
@ -531,7 +523,7 @@ Algebraic_real_1 right_x() const;
|
|||
/*!
|
||||
|
||||
|
||||
\cgalModels `ArrTraits::Point_2`
|
||||
\cgalModels{ArrTraits::Point_2}
|
||||
|
||||
*/
|
||||
class Point_2 {
|
||||
|
|
@ -633,7 +625,7 @@ The `X_monotone_curve_2` class nested within the traits is used
|
|||
to represent \f$ x\f$-monotone parts of rational functions. In particular, such an \f$ x\f$-monotone curve
|
||||
may not contain a vertical asymptote in its interior \f$ x\f$-range.
|
||||
|
||||
\cgalModels `ArrTraits::XMonotoneCurve_2`
|
||||
\cgalModels{ArrTraits::XMonotoneCurve_2}
|
||||
|
||||
*/
|
||||
class X_monotone_curve_2 {
|
||||
|
|
|
|||
|
|
@ -52,9 +52,7 @@ namespace CGAL {
|
|||
* same direction as a precondition. Moreover, `Arr_segment_traits_2` supports
|
||||
* the merging of curves of opposite directions.
|
||||
*
|
||||
* \cgalModels `ArrangementTraits_2`
|
||||
* \cgalModels `ArrangementLandmarkTraits_2`
|
||||
* \cgalModels `ArrangementDirectionalXMonotoneTraits_2`
|
||||
* \cgalModels{ArrangementTraits_2,ArrangementLandmarkTraits_2,ArrangementDirectionalXMonotoneTraits_2}
|
||||
*/
|
||||
template <typename Kernel>
|
||||
class Arr_segment_traits_2 : public Kernel {
|
||||
|
|
|
|||
|
|
@ -21,7 +21,7 @@ namespace CGAL {
|
|||
* `Arr_default_dcel<Traits>`.
|
||||
* </UL>
|
||||
*
|
||||
* \cgalModels `ArrangementBasicTopologyTraits`
|
||||
* \cgalModels{ArrangementBasicTopologyTraits}
|
||||
*
|
||||
* \sa `Arr_default_dcel<Traits>`
|
||||
* \sa `CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel,x,y>`
|
||||
|
|
|
|||
|
|
@ -26,8 +26,7 @@ is relatively large.
|
|||
|
||||
This strategy supports arbitrary subdivisions, including unbounded ones.
|
||||
|
||||
\cgalModels `ArrangementPointLocation_2`
|
||||
\cgalModels `ArrangementVerticalRayShoot_2`
|
||||
\cgalModels{ArrangementPointLocation_2,ArrangementVerticalRayShoot_2}
|
||||
|
||||
\sa `ArrangementPointLocation_2`
|
||||
\sa `ArrangementVerticalRayShoot_2`
|
||||
|
|
|
|||
|
|
@ -15,8 +15,7 @@ namespace CGAL {
|
|||
* (especially when the number of modifications applied to the arrangement is
|
||||
* high) and provided only for educational purposes.
|
||||
*
|
||||
* \cgalModels `ArrangementPointLocation_2`
|
||||
* \cgalModels `ArrangementVerticalRayShoot_2`
|
||||
* \cgalModels{ArrangementPointLocation_2,ArrangementVerticalRayShoot_2}
|
||||
*
|
||||
* \sa `ArrangementPointLocation_2`
|
||||
* \sa `ArrangementVerticalRayShoot_2`
|
||||
|
|
|
|||
|
|
@ -21,7 +21,7 @@ namespace CGAL {
|
|||
* `Arr_default_dcel<Traits>`.
|
||||
* </UL>
|
||||
*
|
||||
* \cgalModels `ArrangementBasicTopologyTraits`
|
||||
* \cgalModels{ArrangementBasicTopologyTraits}
|
||||
*
|
||||
* \sa `Arr_default_dcel<Traits>`
|
||||
* \sa `CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel,x,y>`
|
||||
|
|
|
|||
|
|
@ -19,10 +19,7 @@ existing vertices might be removed, the notification mechanism is used
|
|||
to dynamically maintain the mapping of vertex handles to indices.
|
||||
|
||||
|
||||
\cgalModels DefaultConstructible
|
||||
\cgalModels CopyConstructible
|
||||
\cgalModels Assignable
|
||||
\cgalModels `ReadablePropertyMap`
|
||||
\cgalModels{DefaultConstructible,CopyConstructible,Assignable,ReadablePropertyMap}
|
||||
|
||||
\sa `Arr_observer<Arrangement>`
|
||||
\sa `Arr_face_index_map<Arrangement>`
|
||||
|
|
|
|||
|
|
@ -23,8 +23,7 @@ It is therefore recommended to use the "walk" point-location strategy
|
|||
for arrangements that are constantly changing, especially if the number
|
||||
of issued queries is not large.
|
||||
|
||||
\cgalModels `ArrangementPointLocation_2`
|
||||
\cgalModels `ArrangementVerticalRayShoot_2`
|
||||
\cgalModels{ArrangementPointLocation_2,ArrangementVerticalRayShoot_2}
|
||||
|
||||
\sa `ArrangementPointLocation_2`
|
||||
\sa `ArrangementVerticalRayShoot_2`
|
||||
|
|
|
|||
|
|
@ -18,8 +18,7 @@ defined by the `Arrangement` template-parameter, as well as the `VertexData`,
|
|||
`HalfedgeData` and `FaceData` types, can all be written to an input stream using
|
||||
the `<<` operator and read from an input stream using the `>>` operator.
|
||||
|
||||
\cgalModels `ArrangementInputFormatter`
|
||||
\cgalModels `ArrangementOutputFormatter`
|
||||
\cgalModels{ArrangementInputFormatter,ArrangementOutputFormatter}
|
||||
|
||||
\sa `PkgArrangementOnSurface2Read`
|
||||
\sa `PkgArrangementOnSurface2Write`
|
||||
|
|
@ -50,8 +49,7 @@ The `Arr_face_extended_text_formatter` class assumes that the nested `Point_2` a
|
|||
defined by the `Arrangement` template-parameter and that the `FaceData` type
|
||||
can all be written to an input stream using the `<<` operator and read from an input stream using the `>>` operator.
|
||||
|
||||
\cgalModels `ArrangementInputFormatter`
|
||||
\cgalModels `ArrangementOutputFormatter`
|
||||
\cgalModels{ArrangementInputFormatter,ArrangementOutputFormatter}
|
||||
|
||||
\sa `PkgArrangementOnSurface2Read`
|
||||
\sa `PkgArrangementOnSurface2Write`
|
||||
|
|
@ -81,8 +79,7 @@ defined by the `Arrangement` template-parameter can both be written to an input
|
|||
stream using the `<<` operator and read from an input stream using the `>>`
|
||||
operator.
|
||||
|
||||
\cgalModels `ArrangementInputFormatter`
|
||||
\cgalModels `ArrangementOutputFormatter`
|
||||
\cgalModels{ArrangementInputFormatter,ArrangementOutputFormatter}
|
||||
|
||||
\sa `PkgArrangementOnSurface2Read`
|
||||
\sa `PkgArrangementOnSurface2Write`
|
||||
|
|
|
|||
|
|
@ -15,8 +15,7 @@ the base arrangement, while the derived class is responsible for reading and
|
|||
writing the set of curves inducing the arrangement and maintaining the
|
||||
relations between these curves and the edges they induce.
|
||||
|
||||
\cgalModels `ArrangementWithHistoryInputFormatter`
|
||||
\cgalModels `ArrangementWithHistoryOutputFormatter`
|
||||
\cgalModels{ArrangementWithHistoryInputFormatter,ArrangementWithHistoryOutputFormatter}
|
||||
|
||||
\sa `PkgArrangementOnSurface2Read`
|
||||
\sa `PkgArrangementOnSurface2Write`
|
||||
|
|
|
|||
|
|
@ -19,7 +19,7 @@ running a graph algorithm.
|
|||
|
||||
\tparam Refs must be an instantiation of a `HalfedgeDS`.
|
||||
|
||||
\cgalModels `HalfedgeDSFace`
|
||||
\cgalModels{HalfedgeDSFace}
|
||||
|
||||
\sa `HalfedgeDS<Traits,Items,Alloc>`
|
||||
\sa `HalfedgeDSItems`
|
||||
|
|
|
|||
|
|
@ -17,7 +17,7 @@ running a graph algorithm.
|
|||
|
||||
\tparam Refs must be an instantiation of a `HalfedgeDS`.
|
||||
|
||||
\cgalModels `HalfedgeDSHalfedge`
|
||||
\cgalModels{HalfedgeDSHalfedge}
|
||||
|
||||
\sa `HalfedgeDS<Traits,Items,Alloc>`
|
||||
\sa `HalfedgeDSItems`
|
||||
|
|
|
|||
|
|
@ -17,7 +17,7 @@ running a graph algorithm.
|
|||
|
||||
\tparam Refs must be an instantiation of a `HalfedgeDS`.
|
||||
|
||||
\cgalModels `HalfedgeDSVertex`
|
||||
\cgalModels{HalfedgeDSVertex}
|
||||
|
||||
\sa `HalfedgeDS<Traits,Items,Alloc>`
|
||||
\sa `HalfedgeDSItems`
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@ namespace CGAL {
|
|||
|
||||
The class `Linear_cell_complex_bgl_min_items` defines `void` as the information associated with darts, darts have ids and 0- and 2-attributes are enabled and have ids.
|
||||
|
||||
\cgalModels `LinearCellComplexItems`
|
||||
\cgalModels{LinearCellComplexItems}
|
||||
|
||||
\cgalHeading{Example}
|
||||
|
||||
|
|
|
|||
|
|
@ -13,7 +13,7 @@ the point and the plane equation.
|
|||
Vertices and facets both contain a halfedge handle to an incident
|
||||
halfedge.
|
||||
|
||||
\cgalModels `PolyhedronItems_3`
|
||||
\cgalModels{PolyhedronItems_3}
|
||||
|
||||
\cgalHeading{Operations}
|
||||
|
||||
|
|
|
|||
|
|
@ -19,7 +19,7 @@ and must be a model of `TriangulationTraits_2`.
|
|||
`Triangulation_face_base_with_id_2` derives. It has the default
|
||||
value `Triangulation_face_base_2<TriangulationTraits_2>`.
|
||||
|
||||
\cgalModels `TriangulationFaceBase_2`
|
||||
\cgalModels{TriangulationFaceBase_2}
|
||||
|
||||
\sa `CGAL::Triangulation_face_base_2`
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -19,7 +19,7 @@ and must be a model of `TriangulationTraits_2`.
|
|||
`Triangulation_vertex_base_with_id_2` derives. It has the default
|
||||
value `Triangulation_vertex_base_2<TriangulationTraits_2>`.
|
||||
|
||||
\cgalModels `TriangulationVertexBase_2`
|
||||
\cgalModels{TriangulationVertexBase_2}
|
||||
|
||||
\sa `CGAL::Triangulation_vertex_base_2`
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -6,31 +6,31 @@ namespace CGAL {
|
|||
|
||||
/// The constant `vertex_index` is a property tag which identifies the <i>index</i> property of a vertex of a \bgl
|
||||
/// <a href="https://www.boost.org/libs/graph/doc/Graph.html"><code>Graph</code></a>.
|
||||
/// \cgalModels <a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>
|
||||
/// \cgalModelsBare{<a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>}
|
||||
enum vertex_index_t { vertex_index };
|
||||
|
||||
/// The constant `halfedge_index` is a property tag which identifies the <i>index</i> property of a halfedge of a `HalfedgeGraph`.
|
||||
///
|
||||
/// This is a property tag introduced by \cgal.
|
||||
/// \cgalModels <a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>
|
||||
/// \cgalModelsBare{<a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>}
|
||||
enum halfedge_index_t { halfedge_index };
|
||||
|
||||
/// The constant `edge_index` is a property tag which identifies the <i>index</i> property of an edge of a \bgl
|
||||
/// <a href="https://www.boost.org/libs/graph/doc/Graph.html"><code>Graph</code></a>.
|
||||
/// \cgalModels <a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>
|
||||
/// \cgalModelsBare{<a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>}
|
||||
enum edge_index_t { edge_index };
|
||||
|
||||
/// The constant `face_index` is a property tag which identifies the <i>index</i> property of a face of a `FaceGraph`.
|
||||
///
|
||||
/// This is a property tag introduced by \cgal.
|
||||
/// \cgalModels <a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>
|
||||
/// \cgalModelsBare{<a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>}
|
||||
enum face_index_t { face_index };
|
||||
|
||||
/// The constant `vertex_point` is a property tag which refers to the geometric embedding property of
|
||||
/// a vertex of a `HalfedgeGraph`.
|
||||
///
|
||||
/// This is a property tag introduced by \cgal.
|
||||
/// \cgalModels <a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>
|
||||
/// \cgalModelsBare{<a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>}
|
||||
enum vertex_point_t { vertex_point };
|
||||
|
||||
/// @}
|
||||
|
|
|
|||
|
|
@ -44,7 +44,7 @@ error.
|
|||
|
||||
\tparam Primal_ must be a model of `FaceGraph`
|
||||
|
||||
\cgalModels `FaceGraph`
|
||||
\cgalModels{FaceGraph}
|
||||
|
||||
*/
|
||||
template <typename Primal_>
|
||||
|
|
|
|||
|
|
@ -66,9 +66,7 @@ namespace CGAL {
|
|||
* \tparam VIMap a model of `ReadablePropertyMap` with `graph_traits<Graph>::%vertex_descriptor` as key and `graph_traits<Graph>::%vertices_size_type` as value
|
||||
* \tparam HIMap a model of `ReadablePropertyMap` with `graph_traits<Graph>::%halfedge_descriptor` as key and `graph_traits<Graph>::%halfedges_size_type` as value
|
||||
*
|
||||
* \cgalModels `FaceListGraph`
|
||||
* \cgalModels `HalfedgeListGraph`
|
||||
* \cgalModels \bgllink{VertexListGraph}
|
||||
* \cgalModels{FaceListGraph,HalfedgeListGraph,\bgllink{VertexListGraph}}
|
||||
*/
|
||||
template<typename Graph,
|
||||
typename FIMap = Default,
|
||||
|
|
|
|||
|
|
@ -115,9 +115,7 @@ All internal properties of the underlying graph are forwarded.
|
|||
Property maps can be wrapped with `Graph_with_descriptor_with_graph_property_map`.
|
||||
\tparam Graph must be a model of a `FaceListGraph` and `HalfedgeListGraph`.
|
||||
|
||||
\cgalModels `FaceListGraph`
|
||||
\cgalModels `HalfedgeListGraph`
|
||||
\cgalModels `MutableFaceGraph` if `Graph` is a model of `MutableFaceGraph`
|
||||
\cgalModels{FaceListGraph,HalfedgeListGraph,MutableFaceGraph if `Graph` is a model of `MutableFaceGraph`}
|
||||
*/
|
||||
|
||||
template<typename Graph_>
|
||||
|
|
@ -689,7 +687,7 @@ is_valid(const Graph_with_descriptor_with_graph<Graph> & w, bool verbose = false
|
|||
\ingroup PkgBGLAdaptors
|
||||
`Graph_with_descriptor_with_graph_property_map` enables to forward properties from a
|
||||
`Graph` to a `Graph_with_descriptor_with_graph`.
|
||||
\cgalModels `Graph_with_descriptor_with_graph_property_map` the same property map concept as `PM`
|
||||
\cgalModels{Graph_with_descriptor_with_graph_property_map the same property map concept as `PM`}
|
||||
@tparam Graph a model of the `FaceListGraph` and `HalfedgeListGraph` concepts.
|
||||
@tparam PM a property_map of a `Graph`.
|
||||
|
||||
|
|
|
|||
|
|
@ -185,7 +185,7 @@ public:
|
|||
/// a border edge (that is, such that either halfedge or the edge have null_face()
|
||||
/// as incident face). Marking a border edge as seam will not do anything.
|
||||
///
|
||||
/// \cgalModels `FaceGraph` or `FaceListGraph`, depending on the underlying mesh `TM`.
|
||||
/// \cgalModels{FaceGraph or `FaceListGraph` depending on the underlying mesh `TM`.}
|
||||
///
|
||||
/// \tparam TM a model of `FaceGraph` or `FaceListGraph`
|
||||
/// \tparam SEM a model of `ReadablePropertyMap` with `boost::graph_traits<TM>::%edge_descriptor` as key type and `bool` as value type.
|
||||
|
|
@ -271,9 +271,7 @@ public:
|
|||
/// Implementation note: a halfedge of the seam mesh is represented as a halfedge
|
||||
/// of the mesh and a boolean to indicate whether the halfedge is on a seam or not.
|
||||
///
|
||||
/// \cgalModels `Descriptor`
|
||||
/// \cgalModels `LessThanComparable`
|
||||
/// \cgalModels `Hashable`
|
||||
/// \cgalModels{Descriptor,LessThanComparable,Hashable}
|
||||
///
|
||||
class halfedge_descriptor
|
||||
{
|
||||
|
|
@ -356,9 +354,7 @@ public:
|
|||
/// Implementation note: to properly duplicate vertices that are on seams,
|
||||
/// a vertex_descriptor is in fact represented as a halfedge of the seam mesh.
|
||||
///
|
||||
/// \cgalModels `Descriptor`
|
||||
/// \cgalModels `LessThanComparable`
|
||||
/// \cgalModels `Hashable`
|
||||
/// \cgalModels{Descriptor,LessThanComparable,Hashable}
|
||||
///
|
||||
class vertex_descriptor
|
||||
{
|
||||
|
|
@ -461,8 +457,7 @@ public:
|
|||
#ifdef DOXYGEN_RUNNING
|
||||
/// This class represents an edge of the seam mesh.
|
||||
///
|
||||
/// \cgalModels `Descriptor`
|
||||
/// \cgalModels `Hashable`
|
||||
/// \cgalModels{Descriptor,Hashable}
|
||||
///
|
||||
class edge_descriptor
|
||||
{
|
||||
|
|
@ -562,7 +557,7 @@ public:
|
|||
|
||||
/// This class represents a face of the seam mesh.
|
||||
///
|
||||
/// \cgalModels `Descriptor`
|
||||
/// \cgalModels{Descriptor}
|
||||
///
|
||||
typedef typename boost::graph_traits<TM>::face_descriptor face_descriptor;
|
||||
|
||||
|
|
|
|||
|
|
@ -182,7 +182,7 @@ struct Opposite_face {
|
|||
* Let `h` be a halfedge of graph `g`. For a `Halfedge_around_source_iterator` `havi` with `h = *havi;`
|
||||
* the following holds: Either `++havi` is the past the end iterator, or `next(opposite(h,g),g) == *++havi`.
|
||||
* \tparam Graph must be a model of the concept `HalfedgeGraph`
|
||||
* \cgalModels `BidirectionalIterator`
|
||||
* \cgalModels{BidirectionalIterator}
|
||||
*/
|
||||
template <typename Graph>
|
||||
class Halfedge_around_source_iterator {
|
||||
|
|
@ -274,7 +274,7 @@ public:
|
|||
* Let `h` be a halfedge of graph `g`. For a `Halfedge_around_target_iterator` `havi` with `h = *havi;`
|
||||
* the following holds: Either `++havi` is the past the end iterator, or `opposite(next(h,g),g) == *++havi`.
|
||||
* \tparam Graph must be a model of the concept `HalfedgeGraph`
|
||||
* \cgalModels `BidirectionalIterator`
|
||||
* \cgalModels{BidirectionalIterator}
|
||||
*/
|
||||
|
||||
template <typename Graph>
|
||||
|
|
@ -369,7 +369,7 @@ public:
|
|||
* Let `h` be a halfedge of graph `g`. For a `Halfedge_around_face_iterator` `hafi` with `h = *hafi`
|
||||
* the following holds: Either `++hafi` is the past the end iterator, or `next(h,g) == *++hafi`.
|
||||
* \tparam Graph must be a model of the concept `HalfedgeGraph`
|
||||
* \cgalModels `BidirectionalIterator`
|
||||
* \cgalModels{BidirectionalIterator}
|
||||
*/
|
||||
|
||||
template <typename Graph>
|
||||
|
|
@ -465,7 +465,7 @@ class Halfedge_around_target_circulator;
|
|||
* Let `h` be a halfedge of graph `g`. For a `Halfedge_around_source_circulator` `havc` with `h = *havc;`
|
||||
* the following holds: `next(opposite(h,g),g) == *++havc`.
|
||||
* \tparam Graph must be a model of the concept `HalfedgeGraph`
|
||||
* \cgalModels `BidirectionalCirculator`
|
||||
* \cgalModels{BidirectionalCirculator}
|
||||
*/
|
||||
template <typename Graph>
|
||||
class Halfedge_around_source_circulator
|
||||
|
|
@ -531,7 +531,7 @@ private:
|
|||
* It circulates over the same halfedges as the `Halfedge_around_target_circulator`.
|
||||
*
|
||||
* \tparam Graph must be a model of the concept `HalfedgeGraph`
|
||||
* \cgalModels `BidirectionalCirculator`
|
||||
* \cgalModels{BidirectionalCirculator}
|
||||
*/
|
||||
|
||||
template <typename Graph>
|
||||
|
|
@ -590,7 +590,7 @@ private:
|
|||
* Let `h` be a halfedge of graph `g`. For a `Halfedge_around_target_circulator` `havc` with `h = *havc;`
|
||||
* the following holds: `opposite(next(h,g),g) == *++havc`.
|
||||
* \tparam Graph must be a model of the concept `HalfedgeGraph`
|
||||
* \cgalModels `BidirectionalCirculator`
|
||||
* \cgalModels{BidirectionalCirculator}
|
||||
*/
|
||||
|
||||
|
||||
|
|
@ -692,7 +692,7 @@ private:
|
|||
* Let `h` be a halfedge of graph `g`. For a `Halfedge_around_face_circulator` `hafc` with `h = *hafc`
|
||||
* the following holds: `next(h,g) == *++hafc`.
|
||||
* \tparam Graph must be a model of the concept `HalfedgeGraph`
|
||||
* \cgalModels `BidirectionalCirculator`
|
||||
* \cgalModels{BidirectionalCirculator}
|
||||
*/
|
||||
|
||||
template <typename Graph>
|
||||
|
|
@ -844,7 +844,7 @@ halfedges_around_face(typename boost::graph_traits<Graph>::halfedge_descriptor h
|
|||
* may be the null face, and it may be several times the same face descriptor.
|
||||
*
|
||||
* \tparam Graph must be a model of the concept `HalfedgeGraph`
|
||||
* \cgalModels `BidirectionalCirculator`
|
||||
* \cgalModels{BidirectionalCirculator}
|
||||
*/
|
||||
template <typename Graph>
|
||||
class Face_around_face_iterator
|
||||
|
|
@ -882,7 +882,7 @@ private:
|
|||
* may be the null face, and it may be several times the same face descriptor.
|
||||
*
|
||||
* \tparam Graph must be a model of the concept `HalfedgeGraph`
|
||||
* \cgalModels `BidirectionalCirculator`
|
||||
* \cgalModels{BidirectionalCirculator}
|
||||
*/
|
||||
template <typename Graph>
|
||||
class Face_around_face_circulator
|
||||
|
|
@ -896,7 +896,7 @@ class Face_around_face_circulator
|
|||
* may be the null face, and it may be several times the same face descriptor.
|
||||
*
|
||||
* \tparam Graph must be a model of the concept `HalfedgeGraph`
|
||||
* \cgalModels `BidirectionalIterator`
|
||||
* \cgalModels{BidirectionalIterator}
|
||||
*/
|
||||
template <typename Graph>
|
||||
class Face_around_target_iterator
|
||||
|
|
@ -956,7 +956,7 @@ faces_around_face(typename boost::graph_traits<Graph>::halfedge_descriptor h, co
|
|||
* \ingroup PkgBGLIterators
|
||||
* A bidirectional circulator with value type `boost::graph_traits<Graph>::%vertex_descriptor` over all vertices incident to the same face or border.
|
||||
* \tparam Graph must be a model of the concept `HalfedgeGraph`
|
||||
* \cgalModels `BidirectionalIterator`
|
||||
* \cgalModels{BidirectionalIterator}
|
||||
*/
|
||||
template <typename Graph>
|
||||
class Vertex_around_face_circulator
|
||||
|
|
@ -1013,7 +1013,7 @@ private:
|
|||
* A bidirectional iterator with value type `boost::graph_traits<Graph>::%vertex_descriptor`
|
||||
* over all vertices incident to the same face or border.
|
||||
* \tparam Graph must be a model of the concept `HalfedgeGraph`
|
||||
* \cgalModels `BidirectionalIterator`
|
||||
* \cgalModels{BidirectionalIterator}
|
||||
*/
|
||||
template <typename Graph>
|
||||
class Vertex_around_face_iterator
|
||||
|
|
@ -1135,7 +1135,7 @@ edges_around_face(typename boost::graph_traits<Graph>::halfedge_descriptor h, co
|
|||
* It circulates over the same halfedges as the `Halfedge_around_target_circulator`.
|
||||
*
|
||||
* \tparam Graph must be a model of the concept `HalfedgeGraph`
|
||||
* \cgalModels `BidirectionalCirculator`
|
||||
* \cgalModels{BidirectionalCirculator}
|
||||
*/
|
||||
template <typename Graph>
|
||||
class Vertex_around_target_circulator
|
||||
|
|
@ -1194,7 +1194,7 @@ private:
|
|||
* It iterates over the same halfedges as the `Halfedge_around_target_iterator`.
|
||||
*
|
||||
* \tparam Graph must be a model of the concept `HalfedgeGraph`
|
||||
* \cgalModels `BidirectionalIterator`
|
||||
* \cgalModels{BidirectionalIterator}
|
||||
*/
|
||||
template <typename Graph>
|
||||
class Vertex_around_target_iterator
|
||||
|
|
|
|||
|
|
@ -51,7 +51,7 @@ namespace Barycentric_coordinates {
|
|||
a model of `ReadablePropertyMap` whose key type is `VertexRange::value_type` and
|
||||
value type is `Point_2`. The default is `CGAL::Identity_property_map`.
|
||||
|
||||
\cgalModels `DiscretizedDomain_2`
|
||||
\cgalModels{DiscretizedDomain_2}
|
||||
*/
|
||||
template<
|
||||
typename VertexRange,
|
||||
|
|
|
|||
|
|
@ -48,7 +48,7 @@ namespace Barycentric_coordinates {
|
|||
|
||||
\tparam Traits must be a model of the concepts `BarycentricTraits_2` and `PolygonTraits_2`.
|
||||
|
||||
\cgalModels `BarycentricCoordinates_2`
|
||||
\cgalModels{BarycentricCoordinates_2}
|
||||
|
||||
\pre The provided polygon is strictly convex.
|
||||
|
||||
|
|
|
|||
|
|
@ -100,7 +100,7 @@ public:
|
|||
|
||||
\tparam Traits must be a model of the concept `BarycentricTraits_2`.
|
||||
|
||||
\cgalModels `BarycentricCoordinates_2`
|
||||
\cgalModels{BarycentricCoordinates_2}
|
||||
|
||||
*/
|
||||
template<class Traits>
|
||||
|
|
|
|||
|
|
@ -48,7 +48,7 @@ namespace Barycentric_coordinates {
|
|||
|
||||
\tparam Traits must be a model of the concepts `BarycentricTraits_2` and `PolygonTraits_2`.
|
||||
|
||||
\cgalModels `BarycentricCoordinates_2`
|
||||
\cgalModels{BarycentricCoordinates_2}
|
||||
|
||||
\pre The provided polygon is strictly convex.
|
||||
|
||||
|
|
|
|||
|
|
@ -15,7 +15,7 @@ You need to extend this template with auxiliary data only if you intend to
|
|||
obtain the underlying arrangement of the general polygon set and process it
|
||||
further.
|
||||
|
||||
\cgalModels `GeneralPolygonSetDcelFace`
|
||||
\cgalModels{GeneralPolygonSetDcelFace}
|
||||
|
||||
\sa `Arr_face_base`
|
||||
*/
|
||||
|
|
@ -35,7 +35,7 @@ You need to extend this template with auxiliary data only if you intend to
|
|||
obtain the underlying arrangement of the general polygon set and process it
|
||||
further.
|
||||
|
||||
\cgalModels `GeneralPolygonSetDcelHalfedge`
|
||||
\cgalModels{GeneralPolygonSetDcelHalfedge}
|
||||
|
||||
\sa `Arr_halfedge_base<X_monotone_curve_2>`
|
||||
*/
|
||||
|
|
@ -62,7 +62,7 @@ You need to override this default and use a different
|
|||
\dcel only if you intend to obtain the underlying
|
||||
arrangement of the general polygon set and process it further.
|
||||
|
||||
\cgalModels `GeneralPolygonSetDcel`
|
||||
\cgalModels{GeneralPolygonSetDcel}
|
||||
|
||||
\sa `Arr_dcel_base<V,H,F>`
|
||||
\sa `Gps_halfedge_base<X_monotone_curve_2>`
|
||||
|
|
|
|||
|
|
@ -20,7 +20,7 @@ support the following functions:
|
|||
This class supports a few convenient operations in addition to the
|
||||
requirements that the concept `GeneralPolygon_2` lists.
|
||||
|
||||
\cgalModels `GeneralPolygon_2`
|
||||
\cgalModels{GeneralPolygon_2}
|
||||
|
||||
*/
|
||||
template< typename ArrTraits >
|
||||
|
|
|
|||
|
|
@ -9,7 +9,7 @@ concept. It enables Boolean set-operations on general polygons bounded by
|
|||
linear segments or circular arcs.
|
||||
It should be parameterized with a kernel.
|
||||
|
||||
\cgalModels `GeneralPolygonSetTraits_2`
|
||||
\cgalModels{GeneralPolygonSetTraits_2}
|
||||
|
||||
\sa `CGAL::Arr_circle_segment_traits_2<Kernel>`
|
||||
|
||||
|
|
|
|||
|
|
@ -4,7 +4,7 @@ namespace CGAL {
|
|||
/*!
|
||||
\ingroup PkgBooleanSetOperations2Ref
|
||||
|
||||
\cgalModels `GeneralPolygonSetTraits_2`
|
||||
\cgalModels{GeneralPolygonSetTraits_2}
|
||||
|
||||
\sa `CGAL::Arr_segment_traits_2<Kernel>`
|
||||
|
||||
|
|
|
|||
|
|
@ -13,7 +13,7 @@ the concept `ArrangementXMonotoneTraits_2`). The template parameter
|
|||
of `GpsTraitsGeneralPolygon_2`. By default, the latter is instantiated by
|
||||
`CGAL::General_polygon_2<ArrTraits>`.
|
||||
|
||||
\cgalModels `GeneralPolygonSetTraits_2`
|
||||
\cgalModels{GeneralPolygonSetTraits_2}
|
||||
|
||||
*/
|
||||
template< typename ArrTraits, typename GeneralPolygon_t >
|
||||
|
|
|
|||
|
|
@ -18,7 +18,7 @@ exact computations.
|
|||
`CGAL::Tag_true`. (Examples of such a
|
||||
number-type are `MP_Float`, `CORE::Expr`, and `Gmpq`.)
|
||||
|
||||
\cgalModels `ApproximateMinEllipsoid_d_Traits_d`
|
||||
\cgalModels{ApproximateMinEllipsoid_d_Traits_d}
|
||||
|
||||
\sa `CGAL::Approximate_min_ellipsoid_d_traits_3<K,ET>`
|
||||
\sa `CGAL::Approximate_min_ellipsoid_d_traits_d<K,ET>`
|
||||
|
|
|
|||
|
|
@ -19,7 +19,7 @@ exact computations.
|
|||
`Tag_true` (Examples of such a
|
||||
number-type are `MP_Float`, `CORE::Expr`, and `Gmpq`.)
|
||||
|
||||
\cgalModels `ApproximateMinEllipsoid_d_Traits_d`
|
||||
\cgalModels{ApproximateMinEllipsoid_d_Traits_d}
|
||||
|
||||
\sa `CGAL::Approximate_min_ellipsoid_d_traits_2<K,ET>`
|
||||
\sa `CGAL::Approximate_min_ellipsoid_d_traits_d<K,ET>`
|
||||
|
|
|
|||
|
|
@ -18,7 +18,7 @@ exact computations.
|
|||
`CGAL::Tag_true` (Examples of such a
|
||||
number-type are `MP_Float`, `CORE::Expr`, and `Gmpq`.)
|
||||
|
||||
\cgalModels `ApproximateMinEllipsoid_d_Traits_d`
|
||||
\cgalModels{ApproximateMinEllipsoid_d_Traits_d}
|
||||
|
||||
\sa `CGAL::Approximate_min_ellipsoid_d_traits_2<K,ET>`
|
||||
\sa `CGAL::Approximate_min_ellipsoid_d_traits_3<K,ET>`
|
||||
|
|
|
|||
|
|
@ -9,7 +9,7 @@ using the two-dimensional \cgal kernel.
|
|||
|
||||
\tparam K must be a model for `Kernel`.
|
||||
|
||||
\cgalModels `MinCircle2Traits`
|
||||
\cgalModels{MinCircle2Traits}
|
||||
|
||||
\sa `CGAL::Min_circle_2<Traits>`
|
||||
\sa `MinCircle2Traits`
|
||||
|
|
|
|||
|
|
@ -9,7 +9,7 @@ using the two-dimensional \cgal kernel.
|
|||
|
||||
The template parameter `K` must be a model for `Kernel`.
|
||||
|
||||
\cgalModels `MinEllipse2Traits`
|
||||
\cgalModels{MinEllipse2Traits}
|
||||
|
||||
\sa `CGAL::Min_ellipse_2<Traits>`
|
||||
\sa `MinEllipse2Traits`
|
||||
|
|
|
|||
|
|
@ -10,7 +10,7 @@ functions `min_rectangle_2()`, `min_parallelogram_2()` and
|
|||
|
||||
\tparam K must be a model for `Kernel`.
|
||||
|
||||
\cgalModels `MinQuadrilateralTraits_2`
|
||||
\cgalModels{MinQuadrilateralTraits_2}
|
||||
|
||||
\sa `CGAL::min_rectangle_2()`
|
||||
\sa `CGAL::min_parallelogram_2()`
|
||||
|
|
|
|||
|
|
@ -10,7 +10,7 @@ optimisation algorithms using the two-dimensional \cgal kernel.
|
|||
\tparam K must bea model for `Kernel`.
|
||||
\tparam ET NT are models for `RingNumberType`. Their default type is `K::RT`.
|
||||
|
||||
\cgalModels `MinSphereAnnulusDTraits`
|
||||
\cgalModels{MinSphereAnnulusDTraits}
|
||||
|
||||
\sa `CGAL::Min_sphere_d<Traits>`
|
||||
\sa `CGAL::Min_annulus_d<Traits>`
|
||||
|
|
|
|||
|
|
@ -10,7 +10,7 @@ optimisation algorithms using the three-dimensional \cgal kernel.
|
|||
\tparam K must be a model for `Kernel`.
|
||||
\tparam ET NT are models for `RingNumberType`. Their default type is `K::RT`.
|
||||
|
||||
\cgalModels `MinSphereAnnulusDTraits`
|
||||
\cgalModels{MinSphereAnnulusDTraits}
|
||||
|
||||
\sa `CGAL::Min_sphere_d<Traits>`
|
||||
\sa `CGAL::Min_annulus_d<Traits>`
|
||||
|
|
|
|||
|
|
@ -10,7 +10,7 @@ optimisation algorithms using the \f$ d\f$-dimensional \cgal kernel.
|
|||
\tparam K must be a model for `Kernel`.
|
||||
\tparam ET NT are models for `RingNumberType`. Their default type is `K::RT`.
|
||||
|
||||
\cgalModels `MinSphereAnnulusDTraits`
|
||||
\cgalModels{MinSphereAnnulusDTraits}
|
||||
|
||||
\sa `CGAL::Min_sphere_d<Traits>`
|
||||
\sa `CGAL::Min_annulus_d<Traits>`
|
||||
|
|
|
|||
|
|
@ -8,7 +8,7 @@ The class
|
|||
model for concept `MinSphereOfSpheresTraits`. It uses the \cgal
|
||||
type `Point_2` to represent circles.
|
||||
|
||||
\cgalModels `MinSphereOfSpheresTraits`
|
||||
\cgalModels{MinSphereOfSpheresTraits}
|
||||
|
||||
|
||||
|
||||
|
|
|
|||
|
|
@ -8,7 +8,7 @@ The class
|
|||
model for concept `MinSphereOfSpheresTraits`. It uses the \cgal
|
||||
type `Point_3` to represent spheres.
|
||||
|
||||
\cgalModels `MinSphereOfSpheresTraits`
|
||||
\cgalModels{MinSphereOfSpheresTraits}
|
||||
|
||||
|
||||
|
||||
|
|
|
|||
|
|
@ -8,7 +8,7 @@ The class
|
|||
a model for concept `MinSphereOfSpheresTraits`. It uses the
|
||||
\cgal type `Point_d` to represent circles.
|
||||
|
||||
\cgalModels `MinSphereOfSpheresTraits`
|
||||
\cgalModels{MinSphereOfSpheresTraits}
|
||||
|
||||
|
||||
\tparam K is a model for `Kernel`.
|
||||
|
|
|
|||
|
|
@ -8,7 +8,7 @@ The class
|
|||
model for concept `MinSphereOfSpheresTraits`. It uses a pair of \cgal
|
||||
`Point_2` and `FT` to represent circles.
|
||||
|
||||
\cgalModels `MinSphereOfSpheresTraits`
|
||||
\cgalModels{MinSphereOfSpheresTraits}
|
||||
|
||||
|
||||
The last two template parameters, `UseSqrt` and `Algorithm`, have
|
||||
|
|
|
|||
|
|
@ -8,7 +8,7 @@ The class
|
|||
model for concept `MinSphereOfSpheresTraits`. It uses a pair of \cgal
|
||||
`Point_3` and `FT` to represent spheres.
|
||||
|
||||
\cgalModels `MinSphereOfSpheresTraits`
|
||||
\cgalModels{MinSphereOfSpheresTraits}
|
||||
|
||||
|
||||
\tparam K must be a model for `Kernel`.
|
||||
|
|
|
|||
|
|
@ -8,7 +8,7 @@ The class
|
|||
a model for concept `MinSphereOfSpheresTraits`. It uses the
|
||||
\cgal type `Point_d` to represent circles.
|
||||
|
||||
\cgalModels `MinSphereOfSpheresTraits`
|
||||
\cgalModels{MinSphereOfSpheresTraits}
|
||||
|
||||
|
||||
\tparam K is a model for `Kernel`.
|
||||
|
|
|
|||
|
|
@ -10,7 +10,7 @@ using the function `rectangular_p_center_2()`.
|
|||
|
||||
\tparam K must be a model for `Kernel`.
|
||||
|
||||
\cgalModels `RectangularPCenterTraits_2`
|
||||
\cgalModels{RectangularPCenterTraits_2}
|
||||
|
||||
\sa `CGAL::rectangular_p_center_2()`
|
||||
|
||||
|
|
|
|||
|
|
@ -40,7 +40,7 @@ creates copies of the boxes that would not have identical
|
|||
`id`-numbers.
|
||||
</UL>
|
||||
|
||||
\cgalModels `BoxIntersectionBox_d`
|
||||
\cgalModels{BoxIntersectionBox_d}
|
||||
|
||||
\sa \link PkgBoxIntersectionD_box_intersection_d `CGAL::box_intersection_d()` \endlink
|
||||
\sa \link PkgBoxIntersectionD_box_self_intersection_d `CGAL::box_self_intersection_d()` \endlink
|
||||
|
|
|
|||
|
|
@ -20,7 +20,7 @@ cases it just uses the pointer type.
|
|||
const-pointer `const B*`, where `B` is a model of the
|
||||
`BoxIntersectionBox_d` concept.
|
||||
|
||||
\cgalModels `BoxIntersectionTraits_d`
|
||||
\cgalModels{BoxIntersectionTraits_d}
|
||||
|
||||
\sa \link PkgBoxIntersectionD_box_intersection_d `CGAL::box_intersection_d()` \endlink
|
||||
\sa \link PkgBoxIntersectionD_box_self_intersection_d `CGAL::box_self_intersection_d()` \endlink
|
||||
|
|
|
|||
|
|
@ -52,7 +52,7 @@ the safe default implementation.
|
|||
available for the `CGAL::Box_intersection_d::Box_d` type
|
||||
that does not store a handle.
|
||||
|
||||
\cgalModels `BoxIntersectionBox_d`
|
||||
\cgalModels{BoxIntersectionBox_d}
|
||||
|
||||
\sa \link PkgBoxIntersectionD_box_intersection_d `CGAL::box_intersection_d()` \endlink
|
||||
\sa \link PkgBoxIntersectionD_box_self_intersection_d `CGAL::box_self_intersection_d()` \endlink
|
||||
|
|
|
|||
|
|
@ -4,7 +4,7 @@ namespace CGAL {
|
|||
/*!
|
||||
\ingroup PkgCircularKernel2AlgebraicClasses
|
||||
|
||||
\cgalModels `AlgebraicKernelForCircles`
|
||||
\cgalModels{AlgebraicKernelForCircles}
|
||||
|
||||
*/
|
||||
template< typename RT >
|
||||
|
|
|
|||
|
|
@ -4,7 +4,7 @@ namespace CGAL {
|
|||
/*!
|
||||
\ingroup PkgCircularKernel2GeometricClasses
|
||||
|
||||
\cgalModels `CircularKernel::CircularArc_2`
|
||||
\cgalModels{CircularKernel::CircularArc_2}
|
||||
|
||||
\sa `CGAL::Circular_arc_point_2<CircularKernel>`
|
||||
\sa `CGAL::Line_arc_2<CircularKernel>`
|
||||
|
|
|
|||
|
|
@ -4,7 +4,7 @@ namespace CGAL {
|
|||
/*!
|
||||
\ingroup PkgCircularKernel2GeometricClasses
|
||||
|
||||
\cgalModels `CircularKernel::CircularArcPoint_2`
|
||||
\cgalModels{CircularKernel::CircularArcPoint_2}
|
||||
|
||||
\sa `CGAL::Circular_arc_2<CircularKernel>`
|
||||
\sa `CGAL::Line_arc_2<CircularKernel>`
|
||||
|
|
|
|||
|
|
@ -4,7 +4,7 @@ namespace CGAL {
|
|||
/*!
|
||||
\ingroup PkgCircularKernel2GeometricClasses
|
||||
|
||||
\cgalModels `CircularKernel`
|
||||
\cgalModels{CircularKernel}
|
||||
|
||||
\cgalHeading{Parameters}
|
||||
|
||||
|
|
|
|||
|
|
@ -8,7 +8,7 @@ A typedef to a circular kernel that provides both exact geometric
|
|||
predicates and exact geometric constructions. This kernel uses some
|
||||
geometric filtering (based on bounding boxes) to gain efficiency.
|
||||
|
||||
\cgalModels `CircularKernel`
|
||||
\cgalModels{CircularKernel}
|
||||
|
||||
\sa `CGAL::Circular_kernel_2<Kernel,AlgebraicKernelForCircles>`
|
||||
|
||||
|
|
|
|||
|
|
@ -4,7 +4,7 @@ namespace CGAL {
|
|||
/*!
|
||||
\ingroup PkgCircularKernel2GeometricClasses
|
||||
|
||||
\cgalModels `CircularKernel::LineArc_2`
|
||||
\cgalModels{CircularKernel::LineArc_2}
|
||||
|
||||
\cgalHeading{I/O}
|
||||
|
||||
|
|
|
|||
|
|
@ -4,7 +4,7 @@ namespace CGAL {
|
|||
/*!
|
||||
\ingroup PkgCircularKernel2AlgebraicClasses
|
||||
|
||||
\cgalModels `AlgebraicKernelForCircles::Polynomial_1_2`
|
||||
\cgalModels{AlgebraicKernelForCircles::Polynomial_1_2}
|
||||
|
||||
*/
|
||||
template< typename RT >
|
||||
|
|
|
|||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue