Rocstar  1.0
Rocstar multiphysics simulation application
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
include/CGAL/SimpleCartesian/simple_cartesian_rep.h
Go to the documentation of this file.
1 /* *******************************************************************
2  * Rocstar Simulation Suite *
3  * Copyright@2015, Illinois Rocstar LLC. All rights reserved. *
4  * *
5  * Illinois Rocstar LLC *
6  * Champaign, IL *
7  * www.illinoisrocstar.com *
8  * sales@illinoisrocstar.com *
9  * *
10  * License: See LICENSE file in top level of distribution package or *
11  * http://opensource.org/licenses/NCSA *
12  *********************************************************************/
13 /* *******************************************************************
14  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, *
15  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES *
16  * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND *
17  * NONINFRINGEMENT. IN NO EVENT SHALL THE CONTRIBUTORS OR *
18  * COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
19  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, *
20  * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE *
21  * USE OR OTHER DEALINGS WITH THE SOFTWARE. *
22  *********************************************************************/
23 // ======================================================================
24 //
25 // Copyright (c) 1999 The CGAL Consortium
26 
27 // This software and related documentation is part of the Computational
28 // Geometry Algorithms Library (CGAL).
29 // This software and documentation is provided "as-is" and without warranty
30 // of any kind. In no event shall the CGAL Consortium be liable for any
31 // damage of any kind.
32 //
33 // Every use of CGAL requires a license.
34 //
35 // Academic research and teaching license
36 // - For academic research and teaching purposes, permission to use and copy
37 // the software and its documentation is hereby granted free of charge,
38 // provided that it is not a component of a commercial product, and this
39 // notice appears in all copies of the software and related documentation.
40 //
41 // Commercial licenses
42 // - A commercial license is available through Algorithmic Solutions, who also
43 // markets LEDA (http://www.algorithmic-solutions.de).
44 // - Commercial users may apply for an evaluation license by writing to
45 // Algorithmic Solutions (contact@algorithmic-solutions.com).
46 //
47 // The CGAL Consortium consists of Utrecht University (The Netherlands),
48 // ETH Zurich (Switzerland), Free University of Berlin (Germany),
49 // INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Wittenberg
50 // (Germany), Max-Planck-Institute Saarbrucken (Germany), RISC Linz (Austria),
51 // and Tel-Aviv University (Israel).
52 //
53 // ----------------------------------------------------------------------
54 // release : CGAL-2.2
55 // release_date : 2000, September 30
56 //
57 // source : Simple_cartesian.lw
58 // file : include/CGAL/SimpleCartesian/simple_cartesian_rep.h
59 // package : S2 (1.7)
60 // revision : 1.7
61 // revision_date : 11 Aug 2000
62 // author(s) : Stefan Schirra
63 //
64 // coordinator : MPI, Saarbruecken
65 // email : contact@cgal.org
66 // www : http://www.cgal.org
67 //
68 // ======================================================================
69 
70 #ifndef CGAL_SIMPLE_CARTESIAN_REP_H
71 #define CGAL_SIMPLE_CARTESIAN_REP_H
72 
73 #define CGAL_REP_CLASS_DEFINED
74 
78 
80 template < class FT_ >
81 class Data_accessorS2
82 {
83 public:
84  typedef FT_ FT;
85  typedef PointS2<FT> Point;
86 
87  FT get_x( Point const& p) const { return( p.x()); }
88  FT get_y( Point const& p) const { return( p.y()); }
89 
90  void
91  get( Point const& p, FT& x, FT& y) const
92  {
93  x = get_x( p);
94  y = get_y( p);
95  }
96 
97  void
98  set( Point& p, FT const& x, FT const& y) const
99  {
100  p = Point( x, y);
101  }
102 };
103 
104 template <class FT_> class Simple_cartesian;
105 
106 template <class FT_>
108 {
110  public:
111  typedef FT_ RT;
112  typedef FT_ FT;
114  // we have: template <class R> CGAL::Point_2 : public R::Point_2_base
115  typedef CGAL::Point_2< R_ > Point_2;
116  typedef CGAL::Vector_2< R_ > Vector_2;
117  typedef CGAL::Direction_2< R_ > Direction_2;
118  typedef CGAL::Segment_2< R_ > Segment_2;
119  typedef CGAL::Line_2< R_ > Line_2;
120  typedef CGAL::Ray_2< R_ > Ray_2;
121  typedef CGAL::Circle_2< R_ > Circle_2;
122  typedef CGAL::Triangle_2< R_ > Triangle_2;
123  typedef CGAL::Iso_rectangle_2< R_ > Iso_rectangle_2;
124  typedef CGAL::Aff_transformation_2< R_ > Aff_transformation_2;
126  typedef CGAL::Point_3< R_ > Point_3;
127  typedef CGAL::Vector_3< R_ > Vector_3;
128  typedef CGAL::Direction_3< R_ > Direction_3;
129  typedef CGAL::Segment_3< R_ > Segment_3;
130  typedef CGAL::Plane_3< R_ > Plane_3;
131  typedef CGAL::Line_3< R_ > Line_3;
132  typedef CGAL::Ray_3< R_ > Ray_3;
133  typedef CGAL::Triangle_3< R_ > Triangle_3;
134  typedef CGAL::Tetrahedron_3< R_ > Tetrahedron_3;
135  typedef CGAL::Iso_cuboid_3< R_ > Iso_cuboid_3;
136  typedef CGAL::Sphere_3< R_ > Sphere_3;
137  typedef CGAL::Aff_transformation_3< R_ > Aff_transformation_3;
138  // we have: template <class R> CGAL::Point_d : public R::Point_d_base
139  typedef CGAL::Point_d< R_ > Point_d;
140 
141 };
142 
143 template <class FT_>
144 class Simple_cartesian
145  : public Simple_cartesian_base< FT_ >
146 {
147  public:
148  typedef FT_ RT;
149  typedef FT_ FT;
160 
162 
163  typedef typename KernelBase::Point_2 Point_2;
164  typedef typename KernelBase::Vector_2 Vector_2;
166  typedef typename KernelBase::Line_2 Line_2;
168  typedef typename KernelBase::Ray_2 Ray_2;
169  typedef typename KernelBase::Circle_2 Circle_2;
173 
183 
186  { return Construct_point_2(); }
187 
190  { return Construct_vector_2(); }
191 
194  { return Construct_direction_2(); }
195 
198  { return Construct_segment_2(); }
199 
202  { return Construct_line_2(); }
203 
206  { return Construct_ray_2(); }
207 
210  { return Construct_circle_2(); }
211 
214  { return Construct_triangle_2(); }
215 
218  { return Construct_aff_transformation_2(); }
219 
220 
224  { return Construct_point_on_2(); }
225 
229  { return Construct_second_point_on_2(); }
230 
234  { return Construct_source_point_2(); }
235 
239  { return Construct_target_point_2(); }
240 
244  { return Construct_min_point_2(); }
245 
249  { return Construct_max_point_2(); }
250 
254  { return Construct_direction_of_line_2(); }
255 
259  { return Construct_direction_of_ray_2(); }
260 
264  { return Construct_supporting_line_2(); }
265 
270 
275 
279  { return Construct_perpendicular_line_2(); }
280 
284  { return Construct_midpoint(); }
285 
289  { return Construct_circumcenter_2(); }
290 
294  { return Construct_bisector_2(); }
295 
299  { return Construct_opposite_segment_2(); }
300 
304  { return Construct_opposite_ray_2(); }
305 
309  { return Construct_opposite_line_2(); }
310 
314  { return Construct_opposite_triangle_2(); }
315 
319  { return Construct_opposite_circle_2(); }
320 
324  { return Transform_2(); }
325 
326 
328  Assign_2
330  { return Assign_2(); }
331 
335  { return Intersect_2(); }
336 
340  { return Compute_y_at_x_2(); }
341 
345  { return Compute_squared_length_2(); }
347  Equal_2
348  equal_2_object() const
349  { return Equal_2(); }
350 
352  Equal_x_2
354  { return Equal_x_2(); }
355 
357  Equal_y_2
359  { return Equal_y_2(); }
360 
362  Equal_xy_2
364  { return Equal_xy_2(); }
365 
367  Less_x_2
369  { return Less_x_2(); }
370 
372  Less_y_2
374  { return Less_y_2(); }
375 
376  typedef CGAL::p_Less_xy<Point_2> Less_xy_2;
377  Less_xy_2
379  { return Less_xy_2(); }
380 
381  typedef CGAL::p_Less_yx<Point_2> Less_yx_2;
382  Less_yx_2
384  { return Less_yx_2(); }
385 
389  { return Compare_x_2(); }
390 
394  { return Compare_y_2(); }
395 
399  { return Compare_xy_2(); }
400 
404  { return Compare_y_at_x_2(); }
405 
406  typedef CGAL ::p_Less_dist_to_point<Point_2> Less_distance_to_point_2;
409  { return Less_distance_to_point_2(p); }
410 
411  typedef CGAL ::p_Less_dist_to_line_2p<Point_2> Less_signed_distance_to_line_2;
414  { return Less_signed_distance_to_line_2(p,q); }
415 
416  typedef CGAL ::p_Less_rotate_ccw<Point_2> Less_rotate_ccw_2;
419  { return Less_rotate_ccw_2(p); }
420 
424  { return Counterclockwise_in_between_2(); }
425 
426  typedef CGAL ::p_Leftturn<Point_2> Leftturn_2;
427  Leftturn_2
429  { return Leftturn_2(); }
430 
431  typedef CGAL ::p_Left_of_line_2p<Point_2> Left_of_line_2;
433  left_of_line_2_object(const Point_2& p, const Point_2& q) const
434  { return Left_of_line_2(p,q); }
435 
439  { return Collinear_2(); }
440 
441  typedef CGAL ::p_Orientation<Point_2> Orientation_2;
444  { return Orientation_2(); }
445 
449  { return Side_of_oriented_circle_2(); }
450 
454  { return Side_of_bounded_circle_2(); }
455 
459  { return Is_horizontal_2(); }
460 
464  { return Is_vertical_2(); }
465 
469  { return Is_degenerate_2(); }
470 
472  Has_on_2
474  { return Has_on_2(); }
475 
479  { return Collinear_has_on_2(); }
480 
484  { return Has_on_bounded_side_2(); }
485 
489  { return Has_on_unbounded_side_2(); }
490 
494  { return Has_on_boundary_2(); }
495 
499  { return Has_on_positive_side_2(); }
500 
504  { return Has_on_negative_side_2(); }
505 
509  { return Oriented_side_2(); }
510 
514  { return Are_ordered_along_line_2(); }
515 
520 
525 
530 
543  typedef typename KernelBase::Point_3 Point_3;
544  typedef typename KernelBase::Vector_3 Vector_3;
546  typedef typename KernelBase::Plane_3 Plane_3;
547  typedef typename KernelBase::Line_3 Line_3;
549  typedef typename KernelBase::Ray_3 Ray_3;
553 
564 
567  { return Construct_point_3(); }
568 
571  { return Construct_vector_3(); }
572 
575  { return Construct_direction_3(); }
576 
579  { return Construct_segment_3(); }
580 
583  { return Construct_plane_3(); }
584 
587  { return Construct_line_3(); }
588 
591  { return Construct_ray_3(); }
592 
595  { return Construct_triangle_3(); }
596 
599  { return Construct_tetrahedron_3(); }
600 
603  { return Construct_aff_transformation_3(); }
604 
608  { return Construct_point_on_3(); }
609 
613  { return Construct_second_point_on_3(); }
614 
618  { return Construct_perpendicular_plane_3(); }
619 
623  { return Construct_midpoint_3(); }
624 
628  { return Construct_circumcenter_3(); }
629 
633  { return Construct_opposite_segment_3(); }
634 
638  { return Construct_opposite_ray_3(); }
639 
643  { return Construct_opposite_line_3(); }
644 
648  { return Construct_supporting_plane_3(); }
649 
653  { return Transform_2(); }
654 
655 
657  Assign_3
659  { return Assign_3(); }
660 
664  { return Intersect_3(); }
665 
669  { return Compute_squared_length_3(); }
670 
672  Equal_3
673  equal_3_object() const
674  { return Equal_3(); }
675 
677  Equal_x_3
679  { return Equal_x_3(); }
680 
682  Equal_y_3
684  { return Equal_y_3(); }
685 
687  Equal_z_3
689  { return Equal_z_3(); }
690 
692  Equal_xy_3
694  { return Equal_xy_3(); }
695 
699  { return Equal_xyz_3(); }
700 
702  Less_x_3
704  { return Less_x_3(); }
705 
707  Less_y_3
709  { return Less_y_3(); }
710 
712  Less_z_3
714  { return Less_z_3(); }
715 
716  typedef CGAL::p_Less_xy<Point_3> Less_xy_3;
717  Less_xy_3
719  { return Less_xy_3(); }
720 
722  Less_xyz_3
724  { return Less_xyz_3(); }
725 
729  { return Compare_x_3(); }
730 
734  { return Compare_y_3(); }
735 
739  { return Compare_z_3(); }
740 
744  { return Compare_xy_3(); }
745 
749  { return Compare_xyz_3(); }
750 
751  typedef CGAL ::p_Less_dist_to_point<Point_3> Less_distance_to_point_3;
754  { return Less_distance_to_point_3(p); }
755 
759  { return Collinear_3(); }
760 
762  Coplanar_3
764  { return Coplanar_3(); }
765 
766  typedef CGAL ::p_Orientation<Point_3> Orientation_3;
769  { return Orientation_3(); }
770 
774  { return Is_degenerate_3(); }
775 
777  Has_on_3
779  { return Has_on_3(); }
780 
784  { return Has_on_bounded_side_3(); }
785 
789  { return Has_on_unbounded_side_3(); }
790 
794  { return Has_on_boundary_3(); }
795 
799  { return Has_on_positive_side_3(); }
800 
804  { return Has_on_negative_side_3(); }
805 
809  { return Oriented_side_3(); }
810 
814  { return Are_ordered_along_line_3(); }
815 
820 
825 
830 
834  { return Side_of_oriented_sphere_3(); }
835 
839  { return Side_of_bounded_sphere_3(); }
840 
842 
843  typedef typename KernelBase::Point_d Point_d;
844 
846 
849  { return Construct_point_d(); }
850 
853  static FT make_FT(const RT & num, const RT& denom) { return num/denom;}
854  static FT make_FT(const RT & num) { return num;}
855  static RT FT_numerator(const FT &r) { return r;}
856  static RT FT_denominator(const FT &) { return RT(1);}
857 };
859 
860 #endif // CGAL_SIMPLE_CARTESIAN_REP_H
861 
862 
863 
864 
865 
866 
Construct_circumcenter_2 construct_circumcenter_2_object() const
CGALi::Side_of_oriented_circle Side_of_oriented_circle_2
CGALi::Collinear_are_strictly_ordered_along_line Collinear_are_strictly_ordered_along_line_2
CGALi::Call_perpendicular_to_get< Direction_2 > Construct_perpendicular_direction_2
CGALi::Construct< Direction_2 > Construct_direction_2
Construct_perpendicular_direction_2 construct_perpendicular_direction_2_object() const
Construct_opposite_ray_3 construct_opposite_ray_3_object() const
CGALi::Call_perpendicular_to_get< Line_2 > Construct_perpendicular_line_2
Construct_point_on_2 construct_point_on_2_object() const
Construct_perpendicular_line_2 construct_perpendicular_line_2_object() const
Construct_perpendicular_vector_2 construct_perpendicular_vector_2_object() const
Counterclockwise_in_between_2 counterclockwise_in_between_2_object() const
CGALi::Call_has_on_positive_side Has_on_positive_side_3
Less_signed_distance_to_line_2 less_signed_distance_to_line_2_object(const Point_2 &p, const Point_2 &q) const
CGALi::Call_y_at_x_to_get< FT > Compute_y_at_x_2
Left_of_line_2 left_of_line_2_object(const Point_2 &p, const Point_2 &q) const
void int int REAL REAL * y
Definition: read.cpp:74
CGALi::Call_source_to_get< Point_2 > Construct_source_point_2
Construct_triangle_3 construct_triangle_3_object() const
CGALi::Are_ordered_along_line Are_ordered_along_line_2
Construct_direction_of_ray_2 construct_direction_of_ray_2_object() const
Collinear_are_ordered_along_line_3 collinear_are_ordered_along_line_3_object() const
Has_on_positive_side_3 has_on_positive_side_3_object() const
Collinear_are_strictly_ordered_along_line_2 collinear_are_strictly_ordered_along_line_2_object() const
Construct_min_point_2 construct_min_point_2_object() const
Collinear_are_ordered_along_line_2 collinear_are_ordered_along_line_2_object() const
CGALi::Call_has_on_negative_side Has_on_negative_side_3
KernelBase::Aff_transformation_3 Aff_transformation_3
Construct_direction_2 construct_direction_2_object() const
KernelBase::Aff_transformation_2 Aff_transformation_2
CGALi::Side_of_bounded_circle Side_of_bounded_circle_2
CGALi::Call_has_on_bounded_side Has_on_bounded_side_2
Construct_segment_3 construct_segment_3_object() const
Construct_supporting_plane_3 construct_supporting_plane_3_object() const
Construct_aff_transformation_3 construct_aff_transformation_3_object() const
CGALi::Call_opposite_to_get< Ray_3 > Construct_opposite_ray_3
CGALi::Call_perpendicular_plane_to_get< Plane_3 > Construct_perpendicular_plane_3
CGALi::Call_squared_length_to_get< FT > Compute_squared_length_2
CGALi::Call_opposite_to_get< Line_3 > Construct_opposite_line_3
CGALi::Are_strictly_ordered_along_line Are_strictly_ordered_along_line_3
Less_distance_to_point_3 less_distance_to_point_3_object(const Point_3 &p) const
CGALi::Call_opposite_to_get< Segment_3 > Construct_opposite_segment_3
void set(Point &p, FT const &x, FT const &y) const
CGALi::Call_squared_length_to_get< FT > Compute_squared_length_3
static FT make_FT(const RT &num, const RT &denom)
Has_on_unbounded_side_2 has_on_unbounded_side_2_object() const
Construct_opposite_triangle_2 construct_opposite_triangle_2_object() const
Construct_opposite_line_2 construct_opposite_line_2_object() const
CGALi::Counterclockwise_in_between Counterclockwise_in_between_2
Construct_source_point_2 construct_source_point_2_object() const
Construct_direction_of_line_2 construct_direction_of_line_2_object() const
Construct_second_point_on_2 construct_second_point_on_2_object() const
CGALi::Call_has_on_positive_side Has_on_positive_side_2
CGALi::Call_opposite_to_get< Circle_2 > Construct_opposite_circle_2
Construct_midpoint_3 construct_midpoint_3_object() const
CGALi::Call_perpendicular_to_get< Vector_2 > Construct_perpendicular_vector_2
Construct_supporting_line_2 construct_supporting_line_2_object() const
CGALi::Call_point_to_get< Point_3 > Construct_point_on_3
Definition: RayS2.h:60
Construct_point_on_3 construct_point_on_3_object() const
CGALi::Call_has_on_unbounded_side Has_on_unbounded_side_3
Compute_squared_length_2 Compute_squared_length_2_object() const
Construct_direction_3 construct_direction_3_object() const
Construct_opposite_circle_2 construct_opposite_circle_2_object() const
Construct_triangle_2 construct_triangle_2_object() const
Construct_circumcenter_3 construct_circumcenter_3_object() const
Are_ordered_along_line_3 are_ordered_along_line_3_object() const
Has_on_negative_side_3 has_on_negative_side_3_object() const
Are_strictly_ordered_along_line_2 are_strictly_ordered_along_line_2_object() const
Are_strictly_ordered_along_line_3 are_strictly_ordered_along_line_3_object() const
Construct_max_point_2 construct_max_point_2_object() const
CGALi::pl_Bisector< Point_2, Line_2 > Construct_bisector_2
CGALi::Call_max_to_get< Point_2 > Construct_max_point_2
CGALi::Construct< Aff_transformation_3 > Construct_aff_transformation_3
CGALi::Call_direction_to_get< Direction_2 > Construct_direction_of_ray_2
CGALi::Call_min_to_get< Point_2 > Construct_min_point_2
CGALi::Call_second_point_to_get< Point_2 > Construct_second_point_on_2
CGALi::Call_supporting_line_to_get< Line_2 > Construct_supporting_line_2
CGALi::Side_of_bounded_sphere Side_of_bounded_sphere_3
Construct_opposite_segment_2 construct_opposite_segment_2_object() const
void int int REAL * x
Definition: read.cpp:74
CGALi::Call_direction_to_get< Direction_2 > Construct_direction_of_line_2
CGALi::Call_opposite_to_get< Segment_2 > Construct_opposite_segment_2
CGALi::p_Circumcenter< Point_3 > Construct_circumcenter_3
Construct_target_point_2 construct_target_point_2_object() const
Less_distance_to_point_2 less_distance_to_point_2_object(const Point_2 &p) const
CGALi::Construct< Direction_3 > Construct_direction_3
CGALi::Construct< Tetrahedron_3 > Construct_tetrahedron_3
CGALi::Collinear_are_ordered_along_line Collinear_are_ordered_along_line_3
CGAL::p_Less_dist_to_line_2p< Point_2 > Less_signed_distance_to_line_2
CGALi::Call_opposite_to_get< Triangle_2 > Construct_opposite_triangle_2
CGAL::p_Left_of_line_2p< Point_2 > Left_of_line_2
Construct_opposite_ray_2 construct_opposite_ray_2_object() const
CGALi::Construct< Aff_transformation_2 > Construct_aff_transformation_2
CGALi::Are_strictly_ordered_along_line Are_strictly_ordered_along_line_2
Construct_segment_2 construct_segment_2_object() const
CGALi::Call_opposite_to_get< Ray_2 > Construct_opposite_ray_2
CGALi::Collinear_are_strictly_ordered_along_line Collinear_are_strictly_ordered_along_line_3
CGALi::Call_has_on_negative_side Has_on_negative_side_2
CGALi::Call_target_to_get< Point_2 > Construct_target_point_2
CGALi::Call_has_on_bounded_side Has_on_bounded_side_3
CGALi::Call_supporting_plane_to_get< Plane_3 > Construct_supporting_plane_3
CGALi::p_Circumcenter< Point_2 > Construct_circumcenter_2
Definition: LineS2.h:62
Has_on_positive_side_2 has_on_positive_side_2_object() const
CGALi::Call_point_to_get< Point_2 > Construct_point_on_2
Construct_tetrahedron_3 construct_tetrahedron_object() const
Construct_opposite_segment_3 construct_opposite_segment_3_object() const
Construct_second_point_on_3 construct_second_point_on_3_object() const
CGALi::Construct< Triangle_2 > Construct_triangle_2
Construct_aff_transformation_2 construct_aff_transformation_2_object() const
NT q
Are_ordered_along_line_2 are_ordered_along_line_2_object() const
Side_of_bounded_circle_2 side_of_bounded_circle_2_object() const
CGALi::Call_has_on_unbounded_side Has_on_unbounded_side_2
Collinear_are_strictly_ordered_along_line_3 collinear_are_strictly_ordered_along_line_3_object() const
CGALi::Collinear_are_ordered_along_line Collinear_are_ordered_along_line_2
CGALi::Construct< Triangle_3 > Construct_triangle_3
Definition: RayS3.h:59
#define CGAL_BEGIN_NAMESPACE
Definition: kdtree_d.h:86
ConicCPA2< Point_2, Data_accessor_2 > Conic_2
CGALi::Call_second_point_to_get< Point_3 > Construct_second_point_on_3
CGAL::p_Less_dist_to_point< Point_3 > Less_distance_to_point_3
Side_of_oriented_sphere_3 side_of_oriented_sphere_3_object() const
CGAL::p_Less_dist_to_point< Point_2 > Less_distance_to_point_2
CGAL::p_Less_rotate_ccw< Point_2 > Less_rotate_ccw_2
Compute_squared_length_3 compute_squared_length_3_object() const
CGALi::Side_of_oriented_sphere Side_of_oriented_sphere_3
Less_rotate_ccw_2 less_rotate_ccw_2_object(const Point_2 &p) const
Side_of_oriented_circle_2 side_of_oriented_circle_2_object() const
Has_on_bounded_side_2 has_on_bounded_side_2_object() const
CGALi::Are_ordered_along_line Are_ordered_along_line_3
Has_on_unbounded_side_3 has_on_unbounded_side_3_object() const
Construct_perpendicular_plane_3 construct_perpendicular_plane_3() const
CGAL_BEGIN_NAMESPACE void const NT NT NT NT & denom
#define CGAL_END_NAMESPACE
Definition: kdtree_d.h:87
Construct_opposite_line_3 construct_opposite_line_3_object() const
Has_on_bounded_side_3 has_on_bounded_side_3_object() const
Side_of_bounded_sphere_3 side_of_bounded_sphere_3_object() const
Definition: LineS3.h:59
Construct_bisector_2 construct_bisector_2_object() const
Has_on_negative_side_2 has_on_negative_side_2_object() const
CGALi::Call_opposite_to_get< Line_2 > Construct_opposite_line_2