/dports/math/cgal/CGAL-5.3/include/CGAL/Arr_topology_traits/ |
H A D | Arr_spherical_topology_traits_2_impl.h | 27 template <typename GeomTraits, typename Dcel> 28 Arr_spherical_topology_traits_2<GeomTraits, Dcel>:: 40 template <typename GeomTraits, typename Dcel> 53 template <typename GeomTraits, typename Dcel> 67 template <typename GeomTraits, typename Dcel> 137 template <typename GeomTraits, typename Dcel> 155 template <typename GeomTraits, typename Dcel> 417 template <typename GeomTraits, typename Dcel> 427 template <typename GeomTraits, typename Dcel> 464 template <typename GeomTraits, typename Dcel> [all …]
|
H A D | Arr_planar_topology_traits_base_2.h | 54 typedef Dcel_ Dcel; typedef 55 typedef typename Dcel::Size Size; 56 typedef typename Dcel::Vertex Vertex; 57 typedef typename Dcel::Halfedge Halfedge; 58 typedef typename Dcel::Face Face; 59 typedef typename Dcel::Outer_ccb Outer_ccb; 60 typedef typename Dcel::Inner_ccb Inner_ccb; 64 typedef Arr_planar_topology_traits_base_2<Geometry_traits_2, Dcel> 71 Dcel m_dcel; // The DCEL. 115 const Dcel& dcel() const { return m_dcel; } in dcel() [all …]
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Arrangement_2/ |
H A D | Arr_default_planar_topology.h | 35 template <class GeomTraits, class Dcel, class Tag> 38 template <class GeomTraits, class Dcel> 39 struct Default_planar_topology_impl<GeomTraits, Dcel, 43 typedef Arr_bounded_planar_topology_traits_2<GeomTraits, Dcel> Traits; 47 template <class GeomTraits, class Dcel> 48 struct Default_planar_topology_impl<GeomTraits, Dcel, 52 typedef Arr_unb_planar_topology_traits_2<GeomTraits, Dcel> Traits; 57 template <typename GeomTraits, typename Dcel > 60 GeomTraits, Dcel,
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | graph_traits_dual_arrangement_with_history_2.h | 38 template <typename GeomTraits_2, typename Dcel> 39 class Dual<Arrangement_with_history_2<GeomTraits_2,Dcel> > : 41 <GeomTraits_2, Dcel> > 44 typedef Arrangement_with_history_2<GeomTraits_2, Dcel> Arrangement; 65 template <typename GeomTraits_2, typename Dcel> 67 <GeomTraits_2, Dcel> > > : 69 <CGAL::Arrangement_with_history_2<GeomTraits_2, Dcel> >
|
H A D | graph_traits_dual_arrangement_2.h | 37 template <typename GeomTraits_2, typename Dcel> 38 class Dual<Arrangement_2<GeomTraits_2, Dcel> > : 39 public Dual_arrangement_on_surface<Arrangement_2<GeomTraits_2, Dcel> > 42 typedef Arrangement_2<GeomTraits_2, Dcel> Arrangement; 62 template <typename GeomTraits_2, typename Dcel> 63 class graph_traits<CGAL::Dual<CGAL::Arrangement_2<GeomTraits_2, Dcel> > > : 65 <GeomTraits_2, Dcel> >
|
H A D | Arr_spherical_topology_traits_2.h | 58 typedef Dcel_ Dcel; typedef 72 typedef typename Dcel::Size Size; 73 typedef typename Dcel::Vertex Vertex; 74 typedef typename Dcel::Halfedge Halfedge; 75 typedef typename Dcel::Face Face; 76 typedef typename Dcel::Outer_ccb Outer_ccb; 77 typedef typename Dcel::Inner_ccb Inner_ccb; 83 typedef Arr_spherical_topology_traits_2<Gt2, Dcel> Self; 156 Dcel m_dcel; 205 const Dcel& dcel() const { return (m_dcel); } in dcel() [all …]
|
H A D | General_polygon_set_2.h | 39 typedef Dcel_ Dcel; typedef 42 typename Default_planar_topology<Traits_2, Dcel >::Traits> 45 typedef CGAL::Arrangement_2<Traits_2, Dcel> Arrangement_2;
|
H A D | Arrangement_on_surface_2.h | 112 typedef typename Topology_traits::Dcel Dcel; typedef 113 typedef typename Dcel::Size Size; 120 typedef typename Dcel::Vertex DVertex; 121 typedef typename Dcel::Halfedge DHalfedge; 122 typedef typename Dcel::Face DFace; 123 typedef typename Dcel::Outer_ccb DOuter_ccb; 124 typedef typename Dcel::Inner_ccb DInner_ccb; 136 typedef typename Dcel::Edge_iterator DEdge_iter; 1559 typename Dcel::Inner_ccb_iterator current = it ++; in clean_inner_ccbs_after_sweep() 1640 inline Dcel& _dcel() { return (m_topol_traits.dcel()); } in _dcel() [all …]
|
H A D | Arr_simple_point_location.h | 66 typedef typename Topology_traits::Dcel Dcel; typedef
|
H A D | graph_traits_Arrangement_2.h | 344 typedef Dcel_ Dcel; typedef 346 typename CGAL::Arrangement_2<Traits_2, Dcel>::Geometry_traits_2, 347 typename CGAL::Arrangement_2<Traits_2, Dcel>::Topology_traits> > Base; 352 graph_traits (const CGAL::Arrangement_2<Traits_2, Dcel>& arr) : in graph_traits()
|
/dports/math/cgal/CGAL-5.3/demo/Arrangement_on_surface_2/ |
H A D | ArrangementTypes.h | 61 class Dcel : 74 typedef Dcel<T> other; 86 typedef Dcel<Seg_traits> Seg_dcel; 92 typedef Dcel<Pol_traits> Pol_dcel; 98 typedef Dcel<Lin_traits> Lin_dcel; 115 typedef Dcel<Conic_traits> Conic_dcel; 121 typedef Dcel<Alg_seg_traits> Alg_seg_dcel; 128 typedef Dcel<Bezier_traits> Bezier_dcel; 135 typedef Dcel<Rational_traits> Rational_dcel;
|
/dports/math/cgal/CGAL-5.3/include/CGAL/IO/ |
H A D | Arr_text_formatter.h | 42 typedef typename Arrangement_2::Dcel Dcel; typedef 56 typedef typename Dcel::Vertex DVertex; 57 typedef typename Dcel::Halfedge DHalfedge; 58 typedef typename Dcel::Face DFace; 507 typedef typename Base::Dcel Dcel; typedef 563 typedef typename Base::Dcel Dcel; typedef
|
H A D | Arr_with_history_text_formatter.h | 43 typedef typename Arr_with_history_2::Dcel Dcel; typedef
|
H A D | Arrangement_2_writer.h | 42 typedef typename Arrangement_2::Dcel Dcel; typedef 68 const Dcel* m_dcel;
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Arr_point_location/ |
H A D | Arr_simple_point_location_impl.h | 116 typename Dcel::Edge_const_iterator eit = in _base_vertical_ray_shoot() 118 typename Dcel::Edge_const_iterator e_end = in _base_vertical_ray_shoot() 120 const typename Dcel::Halfedge* he; // The current edge. in _base_vertical_ray_shoot() 121 const typename Dcel::Vertex* vs; // The current edge source in _base_vertical_ray_shoot() 122 const typename Dcel::Vertex* vt; // The current edge target. in _base_vertical_ray_shoot() 127 const typename Dcel::Halfedge* closest_he = nullptr; // The closest so far. in _base_vertical_ray_shoot() 128 const typename Dcel::Vertex* cl_vs = nullptr; // Its source. in _base_vertical_ray_shoot() 129 const typename Dcel::Vertex* cl_vt = nullptr; // Its target. in _base_vertical_ray_shoot()
|
/dports/math/cgal/CGAL-5.3/demo/Arrangement_on_surface_2/tests/ |
H A D | TestRayPL.cpp | 12 typedef CGAL::Arr_default_dcel<Traits> Dcel; typedef 13 typedef CGAL::Arrangement_with_history_2< Traits, Dcel> Arrangement;
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Boolean_set_operations_2/ |
H A D | Gps_on_surface_base_2.h | 937 typename Aos_2::Dcel::Halfedge* 968 typedef Union_find<typename Aos_2::Dcel::Face*> UF_faces; in _remove_redundant_edges() 971 std::vector< typename Aos_2::Dcel::Halfedge* > edges_to_remove; in _remove_redundant_edges() 983 typename Aos_2::Dcel::Face* f1=&(*he->face()), in _remove_redundant_edges() 1121 std::vector< typename Aos_2::Dcel::Vertex* > vertices_to_remove; in _remove_redundant_edges() 1124 typename Aos_2::Dcel::Vertex* v_ptr=&(*vi); in _remove_redundant_edges() 1163 std::vector< typename Aos_2::Dcel::Face*> faces_to_remove; in _remove_redundant_edges() 1197 …typedef std::pair<typename Aos_2::Dcel::Outer_ccb*, typename Aos_2::Dcel::Face*> Outer_ccb_and_fac… in _remove_redundant_edges() 1198 …typedef std::pair<typename Aos_2::Dcel::Inner_ccb*, typename Aos_2::Dcel::Face*> Inner_ccb_and_fac… in _remove_redundant_edges() 1214 typename Aos_2::Dcel::Face* f=&(*h->face()); in _remove_redundant_edges() [all …]
|
H A D | Gps_polygon_validation.h | 342 typedef CGAL::Gps_default_dcel<Traits_2> Dcel; in is_crossover_outer_boundary() typedef 347 typedef typename Default_planar_topology<Traits_2, Dcel>::Traits in is_crossover_outer_boundary() 461 typedef CGAL::Gps_default_dcel<Traits_2> Dcel; in is_crossover_outer_boundary() typedef 465 typedef typename Default_planar_topology<Traits_2, Dcel>::Traits in is_crossover_outer_boundary() 599 typedef CGAL::Gps_default_dcel<Traits_2> Dcel; in are_holes_and_boundary_pairwise_disjoint() typedef 603 typedef typename Default_planar_topology<Traits_2, Dcel>::Traits in are_holes_and_boundary_pairwise_disjoint()
|
/dports/math/cgal/CGAL-5.3/examples/Arrangement_on_surface_2/ |
H A D | face_extension.cpp | 15 typedef CGAL::Arr_face_extended_dcel<Traits_2, int> Dcel; typedef 16 typedef CGAL::Arrangement_2<Traits_2, Dcel> Arrangement_2;
|
H A D | bgl_dual_adapter.cpp | 43 typedef CGAL::Arr_face_extended_dcel<Traits_2, unsigned int> Dcel; typedef 44 typedef CGAL::Arrangement_2<Traits_2, Dcel> Ex_arrangement;
|
H A D | face_extension_overlay.cpp | 16 typedef CGAL::Arr_face_extended_dcel<Traits_2, bool> Dcel; typedef 17 typedef CGAL::Arrangement_2<Traits_2, Dcel> Arrangement_2;
|
H A D | dcel_extension.cpp | 16 typedef CGAL::Arr_extended_dcel<Traits_2,Color, bool, int> Dcel; typedef 17 typedef CGAL::Arrangement_2<Traits_2, Dcel> Arrangement_2;
|
H A D | dcel_extension_io.cpp | 47 Color, bool, int> Dcel; typedef 48 typedef CGAL::Arrangement_2<Traits_2, Dcel> Arrangement_2;
|
/dports/math/cgal/CGAL-5.3/examples/BGL_arrangement_2/ |
H A D | arrangement_dual.cpp | 42 typedef CGAL::Arr_face_extended_dcel<Traits_2, unsigned int> Dcel; typedef 43 typedef CGAL::Arrangement_2<Traits_2, Dcel> Ex_arrangement;
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Minkowski_sum_2/ |
H A D | Union_of_cycles_2.h | 41 typedef Arr_face_extended_dcel<Traits_2, int> Dcel; typedef 42 typedef CGAL::Arrangement_2<Traits_2, Dcel> Arrangement_2;
|