* \brief Loads a mesh from a file in STL format (binary version). * \param[in] filename name of the file * \param[out] M the loaded

* \brief Loads a XYZ point file * \details Load points from file \p filename in XYZ format and stores the * points coordinates to output vec

* \brief Loads points from a file. * \param[in] points_filename the name of the file with the points. * -If the example was compiled with t

* \brief Acquires a lock on this mesh * \details A single thread can have the lock. When multiple threads * want the lock, the ones that do

* \brief Clears the last error message in LUA registry. * \param[in] L a pointer to the LUA state. */

* \brief Tentatively calls glupPopMatrix(). If a stack underflow * is detected, the function does nothing and returns false. * \det

* \brief Tentatively calls glupPushMatrix(). If a stack overflow * is detected, the function does nothing and returns false. * \det

For testing the VorpatestLibrary

for each group g, check if another group h is a subset/is equal to g. store this subset/dependency relation

* \brief Gets the size of the margin (or "gutter") around the charts. * \details This may be required to avoid undesirable blends due to *

* \brief Specify that a triangle belongs to the conflict zone. */

* \brief Specify that a triangle is used. */

* \brief Marks the facets * \param[out] facet_is_marked on exit, set to 1 for facets present * in the list of coplanar facets. Need

* \brief Marks a tetrahedron. * \details A tetrahedron is marked whenever it is * detected as non-conflict. The same space is used

* \brief Marks a triangle. * \details A triangle is marked whenever it is * detected as non-conflict. The same space is used

* \brief Gets the maximum configuration size. * \return the largest number of vertices in an intersection polygon */

* \brief Gets the computed max squared distance. * \return the maximum squared distance computed so far */

* \brief Tests whether the meshes in a scope may have intersections * \param[in] scope a scope * \retval true if there may be some intersect

* \return false if distance is greater than 5% * of bbox radius. */

* \brief Merges a list of triangles into the free list. * \param[in] list_begin first triangle in the list to be freed * \param[in] list_end

* \brief Computes the 2D parameter-space area of a parameterized mesh. * \param[in] mesh a const reference to a parameterized surface mesh.

* \brief Computes the difference of two surface meshes. * \details A and B need to be two closed surface * mesh without intersections.

* \brief Tests whether the facets of a mesh are exactly planar. * \retval true if all the facets are exactly planar * \retval false otherwis

* \brief Computes the intersection between two mesh triangular facets * \details This function is just a wrapper around triangles_intersections()

* \brief Computes the intersection of two surface meshes. * \details A and B need to be two closed surface * mesh without intersections.

* \brief Tests whether a mesh tetrahedron contains a given point * \param[in] M a const reference to the mesh * \param[in] t the index of th

* \brief Tests whether a mesh triangle contains a given point * \param[in] M a const reference to the mesh * \param[in] t the index of the t

* \brief Computes the union of two surface meshes. * \details A and B need to be two closed surface * mesh without intersections. * \p

* \brief Tests whether all the vertices of a mesh are of degree 3. * \retval true if all the vertices are of degree 3 * \retval false otherw

* \brief Gets 32 bits float minimum negative value */

* \brief Replaces a Halfedge with the next one around the facet. * \param[in,out] H the Halfedge */

* \brief Replaces a Halfedge with the previous one around the facet. * \param[in,out] H the Halfedge */

mul

* \brief Post-multiplies the top of the current matrix stack * with the specified matrix. * \param[in] m the matrix that will post

* \brief Gets the number of attributes. * \return The number of attributes managed by this * AttributesManager. */

* \brief Gets the number of arrays used internally. */

* \brief Gets the number of bisectors represented * in a symbolic vertex. */

* \brief gets the bumber of bundles around a vertex * \param[in] v the vertex * \return the number of bundles starting from \p v

* \brief Gets the number of facets. * \return the number of facets in this mesh. */

* \brief Gets the number of halfedges around a vertex * \partam[in] v a vertex * \return the number of halfedges starting fr

* \brief Computes the number of surface vertices that are not isolated. * \param[in] M the mesh * \return the number of vertices of a mesh w

* \brief Gets the number of objects in the scene. * \return the number of objects, comprising lights. */

* \brief Gets the number of poles. * \return the number of poles. */

* \brief Gets the number of primitives stored in the buffers. */

* \brief Gets the number of reconstructed triangles. * \return the number of reconstructed triangles */

* \brief Gets the number of vertices. * \return the number of vertices in this Delaunay */

* \brief Finds the nearest facet from an arbitrary 3d query point. * \param[in] p query point * \param[out] nearest_point nearest po

* \brief Flips the sign of an expansion. */

* \brief Creates a new vertex array object. * \return the index of the newly created vertex * array object. */

* \brief Advances to the next vertex. * \details This copies all the current values of all enabled attributes * to the current vert

* \brief Normalizes the parameterization of a chart. * \param[in,out] chart a reference to the chart to be normalized. * \details This resca

* \brief Normalizes the coordinates of a mesh * in the unit box. * \details A uniform scaling is applied. * \param[in,out] M the mesh

* \brief gets the opposite bundle * \param[in] bndl a bundle index * \return the bundle connecting the same vertices as a given

* \brief Optimizes the internal representation without changing the * represented value */

* \brief Computes the (approximate) orientation predicate in 2d. * \details Computes the sign of the (approximate) signed volume of * the t