Public Member Functions
	Tree_curve (Array< double > &&nodes, int skip_levels=0)

int	skip_levels () const

Int	n_points () const

const Array< double >	nodes () const

const Array< double >	arc_length () const

const Array< Segment >	segments (int level) const

const Segment &	root () const

Nearest_index	nearest_point (Mat< 3 > point, double max_dist=std::sqrt(huge), std::array< double, 2 > arc_len_bounds={-huge, huge}) const

Mat< 3 >	interp_point (double interp_index) const

Mat< 3 >	interp_point (Nearest_index) const

std::vector< double >	intersections_2d (Mat< 3 > p0, Mat< 3 > p1) const

Member Function Documentation

◆ interp_point()

Mat< 3 > hexed::Tree_curve::interp_point ( double interp_index ) const

The documentation for this class was generated from the following files: