Inheritance diagram for hexed::Tree_curve_geom:

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

Nearest_point< dyn >	nearest_point (Mat<> point, double max_distance=huge, double distance_guess=huge) override
	Computes the point on the surface which is nearest to `point` within `max_distance`.

std::vector< double >	intersections (Mat<> point0, Mat<> point1, bool high_prec=true) override

next::Sequence< Mat< 3 > >	points () override

Public Member Functions inherited from hexed::Surface_geom
virtual next::Sequence< const Geom_edge & >	edges ()
	Returns a list of any geometry edges that require mesh edges to be snapped to them.

Member Function Documentation

◆ intersections()

std::vector< double > hexed::Tree_curve_geom::intersections	(	Mat<>	point0,
		Mat<>	point1,
		bool	high_prec = true )

overridevirtual

Warning: Only 2D! Ignores the any entries past the second and assumes the \( x_2 \) coordinate is zero.

Nearest_point< dyn > hexed::Tree_curve_geom::nearest_point	(	Mat<>	point,
		double	max_distance = huge,
		double	distance_guess = huge )

overridevirtual

Computes the point on the surface which is nearest to point within max_distance.

If no point is found, returns an empty Nearest_point.

Parameters

point	The point you want to find the nearest point to.
max_distance	Only consider points within `max_distance` of `point`.
distance_guess	If you have some reason to suspect the nearest point is within a certain distance of the input point, you can pass it to this parameter as a hint to possibly improve performance.

next::Sequence< Mat< 3 > > hexed::Tree_curve_geom::points ( )

overridevirtual

Reimplemented from hexed::Surface_geom.

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