mirror of https://github.com/CGAL/cgal
parent
c5207cb5ad
commit
f79d8bb542
|
|
@ -345,7 +345,7 @@ public:
|
||||||
/*{\Mtypes}*/
|
/*{\Mtypes}*/
|
||||||
// define additional types
|
// define additional types
|
||||||
typedef GenericLocation<Node, Edge> Location;
|
typedef GenericLocation<Node, Edge> Location;
|
||||||
/*{\Mtypedef usual return value for the point loction.}*/
|
/*{\Mtypedef usual return value for the point location.}*/
|
||||||
|
|
||||||
enum Direction { downwards, upwards};
|
enum Direction { downwards, upwards};
|
||||||
/*{\Menum used to specify the direction for the point location.}*/
|
/*{\Menum used to specify the direction for the point location.}*/
|
||||||
|
|
|
||||||
|
|
@ -410,7 +410,7 @@ namespace Polygon_mesh_processing {
|
||||||
\cgalParamNEnd
|
\cgalParamNEnd
|
||||||
|
|
||||||
\cgalParamNBegin{density_control_factor}
|
\cgalParamNBegin{density_control_factor}
|
||||||
\cgalParamDescription{factor to control density of the otuput mesh,
|
\cgalParamDescription{factor to control density of the output mesh,
|
||||||
where larger values cause denser refinements, as in `refine()`}
|
where larger values cause denser refinements, as in `refine()`}
|
||||||
\cgalParamType{double}
|
\cgalParamType{double}
|
||||||
\cgalParamDefault{\f$ \sqrt{2}\f$}
|
\cgalParamDefault{\f$ \sqrt{2}\f$}
|
||||||
|
|
|
||||||
|
|
@ -109,7 +109,7 @@ void Scene_triangle_item::draw(CGAL::Three::Viewer_interface* viewer) const
|
||||||
}
|
}
|
||||||
|
|
||||||
//set the uniform properties for the TriangleContainer.
|
//set the uniform properties for the TriangleContainer.
|
||||||
//Uniform values are setd at each draw call and are defined for the whole item.
|
//Uniform values are set at each draw call and are defined for the whole item.
|
||||||
//Values per simplex are computed as buffers in ComputeElements() and bound in initializeBuffers().
|
//Values per simplex are computed as buffers in ComputeElements() and bound in initializeBuffers().
|
||||||
getTriangleContainer(0)->setColor(this->color());
|
getTriangleContainer(0)->setColor(this->color());
|
||||||
getTriangleContainer(0)->draw(viewer, true);
|
getTriangleContainer(0)->draw(viewer, true);
|
||||||
|
|
|
||||||
|
|
@ -34,7 +34,7 @@
|
||||||
/// - User is responsible to call invalidate_bounds() after adding, moving or removing points.
|
/// - User is responsible to call invalidate_bounds() after adding, moving or removing points.
|
||||||
/// - Selecting points changes the order of the points in the
|
/// - Selecting points changes the order of the points in the
|
||||||
/// container. If selection is *not* empty, it becomes invalid after
|
/// container. If selection is *not* empty, it becomes invalid after
|
||||||
/// adding, moving or removing points, user is responsible to call
|
/// adding, moving or removing points, the user is responsible for calling
|
||||||
/// unselect_all() in those cases.
|
/// unselect_all() in those cases.
|
||||||
///
|
///
|
||||||
/// @heading Parameters:
|
/// @heading Parameters:
|
||||||
|
|
|
||||||
|
|
@ -46,7 +46,7 @@ namespace CGAL {
|
||||||
// The implementation uses interpolatation for multivariate polynomials
|
// The implementation uses interpolatation for multivariate polynomials
|
||||||
// Due to the recursive structuture of CGAL::Polynomial<Coeff> it is better
|
// Due to the recursive structuture of CGAL::Polynomial<Coeff> it is better
|
||||||
// to write the function such that the inner most variable is eliminated.
|
// to write the function such that the inner most variable is eliminated.
|
||||||
// However, CGAL::internal::resultant(F,G) eliminates the outer most variabl.
|
// However, CGAL::internal::resultant(F,G) eliminates the outer most variable.
|
||||||
// This is due to backward compatibility issues with code base on EXACUS.
|
// This is due to backward compatibility issues with code base on EXACUS.
|
||||||
// In turn CGAL::internal::resultant_(F,G) eliminates the innermost variable.
|
// In turn CGAL::internal::resultant_(F,G) eliminates the innermost variable.
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue