| /dports/math/cgal/CGAL-5.3/examples/Polynomial/ |
| H A D | construction.cpp | 8 typedef CGAL::Polynomial_type_generator<int,2>::Type Poly_2; in main() typedef
9 typedef CGAL::Polynomial_traits_d<Poly_2> PT_2; in main()
14 Poly_2 dc; in main()
18 Poly_2 two(2); // = 2 in main()
28 Poly_2 F = // 5*y^2 + 3 in main()
38 Poly_2 G = // (2*x^3)*y^5 + (-2) in main()
44 Poly_2 x = shift(Poly_2(1),1,0); // 'multiply' 1 by x_0^1 in main()
45 Poly_2 y = shift(Poly_2(1),1,1); // 'multiply' 1 by x_1^1 in main()
47 Poly_2 H = 5 * x * y + 3 * y * y; // = 3*y^2 + (5*x)*y in main()
|
| H A D | substitute.cpp | 7 typedef CGAL::Polynomial_type_generator<int,2>::Type Poly_2; in main() typedef
8 typedef CGAL::Polynomial_traits_d<Poly_2> PT_2; in main()
11 Poly_2 x = PT_2::Shift()(Poly_2(1),1,0); // x^1 in main()
12 Poly_2 y = PT_2::Shift()(Poly_2(1),1,1); // y^1 in main()
15 Poly_2 F = 2*x*y + 3*CGAL::ipower(y,3); in main()
39 std::list<Poly_2> replacements; in main()
|
| H A D | degree.cpp | 7 typedef CGAL::Polynomial_type_generator<int,2>::Type Poly_2; in main() typedef
8 typedef CGAL::Polynomial_traits_d<Poly_2> PT_2; in main()
11 Poly_2 x = PT_2::Shift()(Poly_2(1),1,0); // x_0^1 in main()
12 Poly_2 y = PT_2::Shift()(Poly_2(1),1,1); // x_1^1 in main()
14 Poly_2 F // = (11*x^2 + 5*x)*y^4 + (7*x^2)*y^3 in main()
|
| H A D | coefficient_access.cpp | 7 typedef CGAL::Polynomial_type_generator<int,2>::Type Poly_2; in main() typedef
8 typedef CGAL::Polynomial_traits_d<Poly_2> PT_2; in main()
11 Poly_2 x = PT_2::Shift()(Poly_2(1),1,0); // = x^1 in main()
12 Poly_2 y = PT_2::Shift()(Poly_2(1),1,1); // = y^1 in main()
14 Poly_2 F // = (11*x^2 + 5*x)*y^4 + (7*x^2)*y^3 in main()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Algebraic_kernel_d/ |
| H A D | shear.h | 40 typedef CGAL::Polynomial<Poly_1> Poly_2; in shear() typedef
45 Poly_2 for_x(x,Poly_1(NT(s))); in shear()
46 Poly_2 for_y(zero,one); in shear()
48 std::vector<Poly_2> coeffs; in shear()
52 return typename CGAL::Polynomial_traits_d<Poly_2>::Substitute() in shear()
|
| H A D | algebraic_curve_kernel_2_tools.h | 102 template<typename Algebraic_kernel_d_1,typename Poly_2, typename Algebraic_real>
103 Poly_2 poly_non_vanish_leading_term(Algebraic_kernel_d_1* kernel, in poly_non_vanish_leading_term()
104 const Poly_2& pol, in poly_non_vanish_leading_term()
106 Poly_2 f(pol); in poly_non_vanish_leading_term()
110 typename Poly_2::const_iterator poly_end = f.end(); in poly_non_vanish_leading_term()
115 f=Poly_2(f.begin(),poly_end); in poly_non_vanish_leading_term()
|
| H A D | LRU_hashed_map.h | 370 template <class Poly_2>
371 std::size_t operator()(const Poly_2& p) const { in operator()
376 typedef typename Poly_2::NT Poly_1; in operator()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Curved_kernel_via_analysis_2/gfx/ |
| H A D | Subdivision_2.h | 65 typedef CGAL::Polynomial<Poly_1> Poly_2; typedef
79 typedef typename Poly_2::Vector Vector_2;
81 typedef typename Poly_2::const_iterator const_iterator_2;
223 Poly_2 coeffs_x, coeffs_y; //! f(x(y)) / f(y(x))
226 std::vector<Poly_2> mixed_derivatives;
295 typename std::vector<Poly_2>::const_iterator der_it = in get_range_RT_2()
475 Intern::Transform<Poly_2, Coeff, Rational, in precompute()
529 Poly_2 p = mixed_derivatives[idx+j]; in precompute()
|
| H A D | Curve_renderer_internals.h | 190 typedef CGAL::Polynomial<Poly_1> Poly_2; typedef
194 typedef typename Poly_2::const_iterator const_iterator_2;
366 Poly_2 *coeffs_x, *coeffs_y; //! f(x(y)) / f(y(x))
392 Poly_2 coeffs_x_[CGAL_N_CACHES], coeffs_y_[CGAL_N_CACHES];
889 Poly_2 *coeffs = coeffs_x; in get_precached_poly()
996 *coeffs_x = typename CGAL::Polynomial_traits_d<Poly_2>:: in precompute()
|
| H A D | Subdivision_1.h | 120 typedef CGAL::Polynomial<Poly_1> Poly_2; typedef
|
| H A D | Curve_renderer_2.h | 202 typedef typename Renderer_internals::Poly_2 Poly_2; typedef
|