fatarcs_fcts.hpp File Reference

#include <vector>
#include <realroot/Interval.hpp>
#include <realroot/Seq.hpp>

Go to the source code of this file.

Classes
struct	arc_rep< C >
struct	domain< C >
struct	box_rep< C >

Macros
#define	SMALL   C(10e-20)
#define	REP   poly.rep()
#define	SIZE   poly.size()

Functions
template<class C >
std::vector< C >	vec (const C c1, const C c2)
template<class C >
std::vector< C >	rotl (std::vector< C > p)
template<class C >
C	dot (std::vector< C > p, std::vector< C > q)
template<class C >
std::vector< C >	v_plus (std::vector< C > p, std::vector< C > q)
template<class C >
std::vector< C >	v_minus (std::vector< C > p, std::vector< C > q)
template<class C >
std::vector< C >	v_div (std::vector< C > p, C q)
template<class C >
std::vector< C >	v_mul (C q, std::vector< C > p)
template<class C >
C	v_length (std::vector< C > p)
template<class C >
std::vector< C >	matrat (std::vector< C > v1, std::vector< C > v2)
template<class C >
std::vector< C >	crossrat (std::vector< C > v1, std::vector< C > v2, std::vector< C > v3, std::vector< C > v4)
template<class C >
bool	is_zero (C p)
template<class C >
bool	is_small (C p)
template<class C >
Seq< C >	solve2 (C a, C b, C c)
template<class C >
bool	is_unit1 (C p)
template<class C >
bool	is_unit2 (std::vector< C > p)
int	binomial (int n, int p)
template<class C >
polynomial< C,with< Bernstein > >	bbasis (C co, int n, int deg)
template<class C >
void	pow (polynomial< C, with< Bernstein > > &poly, int n)
template<class C >
polynomial< C,with< Bernstein > >	seq2b (Seq< C > coeffseq)
template<class C >
C	pint (polynomial< C, with< MonomialTensor > > poly)
template<class C >
C	min_coeff (polynomial< C, with< Bernstein > > poly)
template<class C >
C	max_coeff (polynomial< C, with< Bernstein > > poly)
template<class C >
C	abs_max_coeff (polynomial< C, with< Bernstein > > poly)
template<class C >
Seq< C >	corner_values (polynomial< C, with< Bernstein > > p)
template<class C >
std::vector< C >	approx (polynomial< C, with< Bernstein > > poly, std::vector< C > ep1, std::vector< C > ep2, int MTH)
template<class C >
arc_rep< C >	median (box_rep< C > box, Seq< std::vector< C > > list, int MTH)
template<class C >
void	circ_is (std::vector< C > *ispts, arc_rep< C > c1, arc_rep< C > c2)
template<class C >
bool	is_arc (arc_rep< C > c)
template<class C >
bool	is_infatarc (std::vector< C > p, arc_rep< C > c1, arc_rep< C > c2)
template<class C >
Seq< std::vector< C > >	extpts (arc_rep< C > mc1, C r1, arc_rep< C > mc2, C r2)
template<class C >
domain< C >	minmax_box (Seq< std::vector< C > > ispts, domain< C > box)

Macro Definition Documentation

#define REP   poly.rep()

#define SIZE   poly.size()

#define SMALL   C(10e-20)

Function Documentation

template<class C >

C abs_max_coeff

(

polynomial< C, with< Bernstein > >

poly

)

template<class C >

std::vector<C> approx	(	polynomial< C, with< Bernstein > >	poly,
		std::vector< C >	ep1,
		std::vector< C >	ep2,
		int	MTH
	)

Examples:

solver_uv_inewton_test.cpp.

template<class C >

polynomial< C ,with<Bernstein> > bbasis	(	C	co,
		int	n,
		int	deg
	)

int binomial	(	int	n,
		int	p
	)

template<class C >

void circ_is	(	std::vector< C > *	ispts,
		arc_rep< C >	c1,
		arc_rep< C >	c2
	)

template<class C >

Seq<C> corner_values

(

polynomial< C, with< Bernstein > >

p

)

template<class C >

std::vector<C> crossrat	(	std::vector< C >	v1,
		std::vector< C >	v2,
		std::vector< C >	v3,
		std::vector< C >	v4
	)

template<class C >

C dot	(	std::vector< C >	p,
		std::vector< C >	q
	)

template<class C >

Seq< std::vector<C> > extpts	(	arc_rep< C >	mc1,
		C	r1,
		arc_rep< C >	mc2,
		C	r2
	)

template<class C >

bool is_arc

(

arc_rep< C >

c

)

template<class C >

bool is_infatarc	(	std::vector< C >	p,
		arc_rep< C >	c1,
		arc_rep< C >	c2
	)

template<class C >

bool is_small

(

C

p

)

template<class C >

bool is_unit1

(

C

p

)

template<class C >

bool is_unit2

(

std::vector< C >

p

)

template<class C >

bool is_zero

(

C

p

)

template<class C >

std::vector<C> matrat	(	std::vector< C >	v1,
		std::vector< C >	v2
	)

template<class C >

C max_coeff

(

polynomial< C, with< Bernstein > >

poly

)

template<class C >

arc_rep< C > median	(	box_rep< C >	box,
		Seq< std::vector< C > >	list,
		int	MTH
	)

template<class C >

C min_coeff

(

polynomial< C, with< Bernstein > >

poly

)

template<class C >

domain<C> minmax_box	(	Seq< std::vector< C > >	ispts,
		domain< C >	box
	)

template<class C >

C pint

(

polynomial< C, with< MonomialTensor > >

poly

)

template<class C >

void pow	(	polynomial< C, with< Bernstein > > &	poly,
		int	n
	)

template<class C >

std::vector<C> rotl

(

std::vector< C >

p

)

template<class C >

polynomial< C ,with<Bernstein> > seq2b

(

Seq< C >

coeffseq

)

template<class C >

Seq<C> solve2	(	C	a,
		C	b,
		C	c
	)

template<class C >

std::vector<C> v_div	(	std::vector< C >	p,
		C	q
	)

template<class C >

C v_length

(

std::vector< C >

p

)

template<class C >

std::vector<C> v_minus	(	std::vector< C >	p,
		std::vector< C >	q
	)

template<class C >

std::vector<C> v_mul	(	C	q,
		std::vector< C >	p
	)

template<class C >

std::vector<C> v_plus	(	std::vector< C >	p,
		std::vector< C >	q
	)

template<class C >

std::vector<C> vec	(	const C	c1,
		const C	c2
	)