simplex_mesh.hpp File Reference

Simplicial mesh in R^d (cells are d-simplices): point location with barycentric coordinates, closest point on/in the mesh, CG1 (piecewise linear) finite element evaluation, and ellipsoid queries against the cells. More...

#include <algorithm>
#include <cmath>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <stdexcept>
#include <utility>
#include <vector>
#include <Eigen/Dense>
#include "ellipsoid_tree/geometry.hpp"
#include "ellipsoid_tree/intersections.hpp"
#include "ellipsoid_tree/object_tree.hpp"
#include "ellipsoid_tree/kd_tree.hpp"
#include "ellipsoid_tree/detail/parallel_for.hpp"

Classes
class	ellipsoid_tree::SimplexMesh
	Simplicial mesh in R^d (cells are d-simplices) with point location, closest-point, CG1 evaluation, and ellipsoid queries. More...

Namespaces
namespace	ellipsoid_tree

Detailed Description

Simplicial mesh in R^d (cells are d-simplices): point location with barycentric coordinates, closest point on/in the mesh, CG1 (piecewise linear) finite element evaluation, and ellipsoid queries against the cells.

The boundary is extracted as the faces belonging to exactly one cell. Closest-point queries use a nearest-boundary-vertex kd-tree bound to shortlist candidate boundary faces, then project onto each candidate with closest_point_in_simplex — whose face enumeration replaces the explicit subface bookkeeping (edges, corners, ...) of a hand-rolled projector.