* \brief Wrapper around gzwrite() to write more than 4Gb */

* \brief Checks whether an halfedge exists between * the two origins of two halfedges. * \param[in] MH the mesh, wrapped with halfedge acces

* \brief Checks whether a halfedge is * incident to a vertex. * \details Checks whether the origin of \p H * is adjacent to \p v. In o

* \brief Gets a 3d vector that connects the origin with the arrow * extremity of a Halfedge. * \param[in] M the Mesh * \pa

* \brief Tests whether a 3d vector has a NaN (not a number) coordinate. * \param[in] v a 3d vector * \return true if one of the coor

https://mathworld.wolfram.com/Helix.html For a helix defined as: F(t) = [r*cost(t), r*sin(t), c*t] for t in [0,T) The helical arc length

* \brief Computes the area of a hole, i.e. the area of the generated * triangles that will fill the hole. * \param[in] M the mesh * \p

* \brief Constructs a color from hue,saturation and lightness * \param[in] h hue in [0.0,1.0] * \param[in] s saturation in [0.0,1.0] *

* \brief gets the image data. * \return a raw pointer to the image data. */

* \brief Gets the size of the target texture image in * pixels. * \return the size of the target texture image. */

* \brief Declares the algorithm option group */

* \brief Imports the biblio option group */

* \brief Imports the reconstruction option group */

* \brief Imports the graphics option group */

* \brief Imports the gui option group. */

* \brief Imports the hex-dominant meshing option group */

* \brief Imports the optimizer option group */

* \brief Imports the polyhedral meshing option group */

* \brief Imports the post-processing option group */

* \brief Imports the pre-processing option group */

* \brief Imports the quad-dominant meshing option group */

* \brief Imports the remeshing option group */

* \brief Import the statistics option group */

* \brief Imports the tetrahedral meshing option group */

* \brief Arithmetic filter for the in_sphere_3d_SOS() predicate. * \details This filter was optimized by hand by Sylvain Pion * (may be fas

* \brief Creates a random point-set on the surface of a cone * \details Generates \p nb_vertices vertices randomly distributed on the * surf

* \brief Initializes the upper and lower horizons. * \param[in] step pixel-size in parameter space * \param[in] margin margin size i

* \brief Creates a random point-set on the surface of a sphere * \details Generates \p nb_vertices vertices randomly distributed on the * su

TODO: create all charts simultaneously (because here we are O(m*n), not good, there can be many charts...) ... (seems to be OK though, even on large m

* \brief Creates a mesh from a cube. * \details Creates a mesh that represents a cube centered on the * origin, with a edge length of 2.

* \brief Creates a surfacic mesh from a cube. * \param[out] M the resulting mesh */

* \brief Computes the squared distance between a point and a Box. * \param[in] p the point * \param[in] B the box * \return the squared

* \brief Insert a new element. * \param[in] x a const reference to the element to be inserted * \return an iterator to the inserted

* \brief Inserts a triangle of the mesh into the data structures * used for topology checks. * \param[in] t index of the triangles

* \brief Inserts a new neighbor. * \details Only the nb_neighbor nearest points are kept. * \param[in] neighbor the index of

* \brief Inserts a constraint * \param[in] v1 , v2 the two extremities of the constraint, as returned * by insert() * \par

converts a 32 bit represented by an int into a color.

* \brief Computes the linear interpolation between three colors. * \param[in] c1 , c2 , c3 the three colors to be interpolated. * \param[in]

* \brief Computes the intersection between a Voronoi cell * and a cell with radius of security or plain mode. * \param[in] seed the

* \brief Builds the invalid dimension error message * \param[in] dimension the specified dimension * \param[in] name the name of the Delauna

* \brief Checks the minimal mode * \retval true if the minimal mode is on * \retval false otherwise */

* \brief Tests whether intersection is just a point. * \details Points are encoded as segments with the * same symbolic information

* \brief Checks the console pretty mode * \retval true if the console pretty mode is on * \retval false otherwise */

* \brief Checks the quiet mode * \retval true if the quiet mode is on * \retval false otherwise */

* \brief Tests whether two facets are identical. * \param[in] f1 index of the first facet * \param[in] f2 index of the second facet

* \brief Tests whether two facets are identical. * \param[in] f1 index of the first facet * \param[in] f2 index of the second facet

* \brief Tests whether two points are identical. * \param[in] i1 index of the first point * \param[in] i2 index of the second point

* \brief Tests whether two facets are on the same chart * \details Two facets are on the same chart if their texture * coordinates match al

* \brief Tests whether this SmoothVertex can be applied. * \details A SmoothVertex cannot be applied if it is incident * to more th

Perform a design update

* \brief Gets an object by index. * \param[in] i the index, in [0..nb_objects()-1] * \return a pointer to the ith object. *

adds two 32 bits integers V1 and V2 represented as ivec4.

* \brief Gets the estimated maximum curvature. * \return the estimated maximum curvature */

* \brief Launches a primary ray. * \param[in] X , Y the pixel coordinates of the ray. * \return the launched ray. */

* \brief Gets the position of the leftmost * bit set in a 32 bits integer * \param[in] x the integer * \return the position of the lef

* \brief Computes the length of a vector. * \param[in] v the vector. * \return the length of \p v. */

* \brief Gets the squared length of the vector */

* \brief Loads a file in Alias Wavefront OFF format. * \param[in] file_name the name of the file. */

* \brief Loads the content of an ASCII file in a buffer. * \details Memory ownership is transfered * to the caller. Memory should be deall