triangulation.hpp File Reference

#include <edelsbrunner96/triangulation.h>
#include <algorithm>
#include <edelsbrunner96/simplex.hpp>
#include <edelsbrunner96/induced_subcomplex.hpp>
#include <edelsbrunner96/line_walker.hpp>
#include <mpblocks/util/set_operations.hpp>

Go to the source code of this file.

Namespaces
	edelsbrunner96

Functions
template<class Traits , class Container >
std::list< std::pair< typename Traits::SimplexRef, typename Traits::SimplexRef > >	edelsbrunner96::BuildHorizonRidge (typename Traits::Storage &storage, Container &visible_hull)
	Build the horizon ridge, which is the set of all edges which border the x-visible hull. More...
template<class Traits , class Container >
void	edelsbrunner96::DemoteHullSimplices (typename Traits::Storage &storage, Container &visible_hull, typename Traits::PointRef point_ref)
	For each infinite simplex references in hull_simplices, replace the null vertex with the vertex pointed to by point_ref. More...
template<class Traits , class Container >
std::list< typename Traits::SimplexRef >	edelsbrunner96::FillHorizonWedges (typename Traits::Storage &storage, Container &horizon_ridge, typename Traits::PointRef point_ref)
	For each simplex pair (s1,s2) in , fill the empty wedge that was created when s1 was demoted to a non-infinite simplex. More...
template<class Traits >
void	edelsbrunner96::FindFillNeighbor (typename Traits::Storage &storage, typename Traits::SimplexRef s_ref, typename Traits::PointRef v_ref, typename Traits::PointRef peak_ref)
	Find the neighbor of a fill simplex that is across from v_ref. More...
template<class Traits >
void	edelsbrunner96::FindWedgeNeighbor (typename Traits::Storage &storage, typename Traits::SimplexRef wedge_ref, int i)
	Given a simplex which fills an empty wedge created by demotion of a simplex along the horizon ridge, find the i'th neighbor by walking around the common edge which contains the peak vertex. More...
template<typename Traits >
Traits::SimplexRef	edelsbrunner96::FuzzyWalkInsert (typename Traits::Storage &storage, const typename Traits::SimplexRef s_0, const typename Traits::PointRef x_ref, const typename Traits::Scalar epsilon)
	Perform a fuzzy walk to get the set of simplices intersecting the query point, then insert the point into the triangulation. More...
template<class Traits >
Traits::SimplexRef	edelsbrunner96::InsertInside (typename Traits::Storage &storage, typename Traits::SimplexRef simplex_ref, typename Traits::PointRef point_ref)
	Inserts a point into a simplex, performs 1-to-n+1 flip, and performs the delaunay maintenance on the modified graph. More...
template<class Traits >
Traits::SimplexRef	edelsbrunner96::InsertOutside (typename Traits::Storage &storage, typename Traits::SimplexRef simplex_ref, typename Traits::PointRef point_ref)
	Inserts a point outside of the hull of the current point set. Note that simplex_ref must point to a hull facet which is visible by the point to insert. More...
template<class Traits , class Iterator >
Traits::SimplexRef	edelsbrunner96::InsertReplace (typename Traits::Storage &storage, typename Traits::PointRef point_ref, Iterator S_begin, Iterator S_end)
	Inserts a point into the triangulation, replacing the given simplex set which intersect the new point. More...
template<class Traits >
Traits::SimplexRef	edelsbrunner96::Maintain (typename Traits::Storage &storage, typename Traits::PointRef point_ref, typename Traits::SimplexRef return_ref, std::list< Facet< Traits >> &link_facets)
	While the link of the specified point is not locally Delaunay, continue flipping locally non-Delaunay facets. More...
template<class Traits >
Traits::SimplexRef	edelsbrunner96::Triangulate (typename Traits::Storage &storage, std::initializer_list< typename Traits::PointRef > refs)
	Initialize a triangulation with NDim+1 points and return the simplex. More...

Detailed Description

Date

Oct 25, 2012

Author

Josh Bialkowski (jbial.nosp@m.k@mi.nosp@m.t.edu)

Definition in file triangulation.hpp.