hexed::brep::Circular_arc Class Reference

A circular arc in the \( x_0, x_1 \) plane. More...

#include <brep.hpp>

Inheritance diagram for hexed::brep::Circular_arc:

Public Member Functions
	Circular_arc (Mat< 3 > center, double radius, double start_angle, double end_angle)
Mat< 3 >	point (Mat< 1 > params) const override
Mat< 2, 1 >	orig_param_bounds () const override
	returns the parameter bounds in the original IGES definition (low, high)
Public Member Functions inherited from hexed::brep::Parametric< 1 >
virtual Mat< 3 >	point (Mat< n_param > params) const=0
	Obtains the point at parameters params.
virtual Mat< n_param, 2 >	reparameterize (Mat< n_param, 2 > bounds)
	May reparameterize the entity to keep parameters in [0, 1].
virtual Mat< n_param, 2 >	reparameterize (const std::vector< Mat< 3 > > &points)
	reparameterizes to contain the projections of points.

Detailed Description

A circular arc in the \( x_0, x_1 \) plane.

Constructor & Destructor Documentation

Circular_arc()

hexed::brep::Circular_arc::Circular_arc	(	Mat< 3 >	center,
		double	radius,
		double	start_angle,
		double	end_angle )

The arc will contain the angle interval [start_angle, end_angle]. start_angle and end_angle may be in any domain (i.e. they don't need to be in \( [-\pi, \pi] \) or something like that), but must satisfy end_angle > start_angle (note the strict inequality). If end_angle - start_angle \( \ge 2\pi \), then the arc will contain redundant points. In this case, nearest_params() is not guaranteed to check more than 1 of the redundant points for feasibility, and which one it checks it not specified.

Member Function Documentation

orig_param_bounds()

Mat< 2, 1 > hexed::brep::Circular_arc::orig_param_bounds ( ) const

overridevirtual

returns the parameter bounds in the original IGES definition (low, high)

Implements hexed::brep::Parametric< 1 >.

---

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

• /home/micaiah/Desktop/hexed/include/brep.hpp