* \brief Computes the sign of the determinant of a 3x3 * matrix formed by three 3d points using exact arithmetics. * \param[in] p0 , p1 , p

* \brief Computes the sign of the determinant of a 4x4 * matrix formed by four 4d points. * \param[in] p0 , p1 , p2 , p3 the four p

* \brief Gets the dimension of this ConvexCell. * \return the dimension of this ConvexCell, e.g. 3 for 3d */

* \brief Gets the dimension */

* \brief Disables this ImmediateBuffer. */

* \brief Gets the distance to a vector * \param[in] v another vector * \return (\p v - \p this).length() */

* \brief Gets the squared distance to a vector * \param[in] v another vector * \return (\p v - \p this).length2() */

* \brief Computes the sign of the dot product between two * vectors. * \param[in] p0 , p1 , p2 three 3d points. * \return

* \brief Computes the sign of the dot product between two * vectors using exact arithmetics. * \param[in] p0 , p1 , p2 three 3d points.

* \brief Compares two dot products using exact arithmetics. * \param[in] v0 , v1 , v2 three vectors * \return the sign of v0.v1 - v0.v2

* \brief Tests whether vertices are stored in * double-precision mode. * \details Double precision mode is the default. *

* \brief Draws this FileDialog and handles the gui. */

* \brief Draws the everting sphere with the current parameters. */

* \copydoc Object::draw_gui() */

* \brief Computes the score obtained when generating a triangle * in the ear cutting algorithm triangulate_hole_ear_cutting(). * \param[in]

* \brief Tests whether an element type is trivially copyable * \param[in] element_type_name the type name of the elements, as * registered

* \brief Tests whether an element type is trivially copyable * \param[in] element_typeid_name the type name of the elements, as * given by

* \brief Gets an element type name from its mangled name * \param[in] element_typeid_name a const reference to a * string with the mangled

* \copydoc AttributeStoreCreator::elements_are_trivially_copyable() */

* \brief Tests whether this material is emissive. * \retval true if this material has non-zero Ke, false otherwise. */

* \brief Tests whether the stack is empty. * \retval true if the stack is empty * \retval false otherwise */

* \brief Tests whether this stack is empty. * \retval true if this stack is empty. * \retval false otherwise. */

* \brief This function is called by the HTML shell each * time a file is loaded. */

\copydoc GEO::ProgressClient::end(bool) */

* \brief To be called at the end of each command. * \details Switches mesh storage from double precision * to single precision. Sin

* \brief needs to be called at the end of each frame. * \details In transparent mode, sorts and draws all the stored * transparent quads

* \brief Terminates the current surface. */

* \brief Notifies clients that a task has ended. * \details This function is called by the ProgressTask destructor. It * restores the previo

* \brief Enlarges the box * \param[in] d the amount that should be subtracted from the lower * bounds and added to the upper bounds */

* \brief Estimates the direction of the maximum principal curvature. * \details The direction of maximum principal curvature is encoded * a

* \brief Compares two expansion_nt * \details Optimized using the low-level API * \param [in] x , y the two expansion_nt to compare * \

* \brief Tests whether an expansion_nt is equal to one. * \details Optimized using the low-level API * \param[in] x a const reference to the

* \brief Tests whether an expansion_nt is zero. * \details Optimized using the low-level API * \param[in] x a const reference to the expansi

* \brief Low-level implementation of the in_sphere predicate. */

* \brief Low-level implementation of the in_sphere predicate. */

* \brief Computes the square of an expansion_nt * \details Optimized using the low-level API * \param[in] x the expansion_nt to be squared

* \brief Tests whether a facet of a mesh is on the border. * \param[in] M the mesh * \param[in] f index of the facet * \return true if

* \brief Gets the index of the tetrahedron adjacent to the current * facet or index_t(-1) if there is no such facet. * \return the

* \brief Gets the facets of a cell. * \param[in] c the index of the cell. * \return a range with all the global indices of the cell

* \brief Gets the upper limit for iterating over the * facets of a cell * \param[in] c the cell, in 0..nb()-1 * \return on

* \brief Sets all the elements in this attribute * to a specified value. * \param[in] val the value */

* \brief Finds the local index of a facet in a cell * that can be connected to a facet of another cell * \param[in] c1 index of the

* \brief Finds the corner of a facet that is adjacent to a given facet. * \param[in] M a const reference to a Mesh * \param[in] f a facet in

* \brief Finds the non-duplicated vertices of a facet * \param[in] M a const reference to a mesh * \param[in] f a facet index in \p M *

* \brief Finds the index of the facet accros which t1 is * adjacent to t2. * \param[in] t1 first tetrahedron * \param[in]

* \brief Finds the local index of a facet in a tetrahedron * by the global indices of its vertices. * \param[in] t index of the tet

* \brief Finds the index of the edge accros which t1 is * adjacent to t2_in. * \param[in] t1 first triangle * \param[in] t

* \brief Gets a triangle and an edge on the internal border of the conflict zone. * \details The returned triangle touches the conflict zone from

* \brief Finds the index of the vertex in a triangle. * \param[in] t the triangle * \param[in] v the vertex * \return iv su

* \brief Tests whether computation is finished * \details If we just want to know whether there is an intersection * then we can st

* \brief Gets the value of a floating-point argument by index. * \details If the index is out of range, or if the * argument is not

expression is used as argument in funcall