CGAL 4.3 - 3D Envelopes
|
Namespaces | |
cpp11 | |
IO | |
Typedefs | |
typedef Interval_nt< false > | Interval_nt_advanced |
typedef Interval_nt< false > | Interval_nt_advanced |
Enumerations | |
enum | Arr_curve_end |
enum | Arr_halfedge_direction |
enum | Arr_parameter_space |
Functions | |
NT | abs (const NT &x) |
result_type | compare (const NT &x, const NT &y) |
result_type | div (const NT1 &x, const NT2 &y) |
void | div_mod (const NT1 &x, const NT2 &y, result_type &q, result_type &r) |
result_type | gcd (const NT1 &x, const NT2 &y) |
result_type | integral_division (const NT1 &x, const NT2 &y) |
NT | inverse (const NT &x) |
result_type | is_negative (const NT &x) |
result_type | is_one (const NT &x) |
result_type | is_positive (const NT &x) |
result_type | is_square (const NT &x) |
result_type | is_square (const NT &x, NT &y) |
result_type | is_zero (const NT &x) |
NT | kth_root (int k, const NT &x) |
result_type | mod (const NT1 &x, const NT2 &y) |
NT | root_of (int k, InputIterator begin, InputIterator end) |
result_type | sign (const NT &x) |
void | simplify (const NT &x) |
NT | sqrt (const NT &x) |
NT | square (const NT &x) |
double | to_double (const NT &x) |
std::pair< double, double > | to_interval (const NT &x) |
NT | unit_part (const NT &x) |
void | Assert_circulator (const C &c) |
void | Assert_iterator (const I &i) |
void | Assert_circulator_or_iterator (const IC &i) |
void | Assert_input_category (const I &i) |
void | Assert_output_category (const I &i) |
void | Assert_forward_category (const IC &ic) |
void | Assert_bidirectional_category (const IC &ic) |
void | Assert_random_access_category (const IC &ic) |
C::difference_type | circulator_distance (C c, C d) |
C::size_type | circulator_size (C c) |
bool | is_empty_range (const IC &i, const IC &j) |
iterator_traits< IC > ::difference_type | iterator_distance (IC ic1, IC ic2) |
Iterator_tag | query_circulator_or_iterator (const I &i) |
Circulator_tag | query_circulator_or_iterator (const C &c) |
Mode | get_mode (std::ios &s) |
Mode | set_ascii_mode (std::ios &s) |
Mode | set_binary_mode (std::ios &s) |
Mode | set_mode (std::ios &s, IO::Mode m) |
Mode | set_pretty_mode (std::ios &s) |
bool | is_ascii (std::ios &s) |
bool | is_binary (std::ios &s) |
bool | is_pretty (std::ios &s) |
Output_rep< T > | oformat (const T &t) |
Input_rep< T > | iformat (const T &t) |
Output_rep< T, F > | oformat (const T &t, F) |
ostream & | operator<< (ostream &os, Class c) |
istream & | operator>> (istream &is, Class c) |
Polynomial_traits_d < Polynomial_d > ::Canonicalize::result_type | canonicalize (const Polynomial_d &p) |
Polynomial_traits_d < Polynomial_d > ::Compare::result_type | compare (const Polynomial_d &p, const Polynomial_d &q) |
Polynomial_traits_d < Polynomial_d > ::Degree::result_type | degree (const Polynomial_d &p, int i, index=Polynomial_traits_d< Polynomial_d >::d-1) |
Polynomial_traits_d < Polynomial_d > ::Degree_vector::result_type | degree_vector (const Polynomial_d &p) |
Polynomial_traits_d < Polynomial_d > ::Differentiate::result_type | differentiate (const Polynomial_d &p, index=Polynomial_traits_d< Polynomial_d >::d-1) |
Polynomial_traits_d < Polynomial_d > ::Evaluate_homogeneous::result_type | evaluate_homogeneous (const Polynomial_d &p, Polynomial_traits_d< Polynomial_d >::Coefficient_type u, Polynomial_traits_d< Polynomial_d >::Coefficient_type v) |
Polynomial_traits_d < Polynomial_d > ::Evaluate::result_type | evaluate (const Polynomial_d &p, Polynomial_traits_d< Polynomial_d >::Coefficient_type x) |
Polynomial_traits_d < Polynomial_d > ::Gcd_up_to_constant_factor::result_type | gcd_up_to_constant_factor (const Polynomial_d &p, const Polynomial_d &q) |
Polynomial_traits_d < Polynomial_d > ::get_coefficient::result_type | get_coefficient (const Polynomial_d &p, int i) |
Polynomial_traits_d < Polynomial_d > ::get_innermost_coefficient::result_type | get_innermost_coefficient (const Polynomial_d &p, Exponent_vector ev) |
Polynomial_traits_d < Polynomial_d > ::Innermost_leading_coefficient::result_type | innermost_leading_coefficient (const Polynomial_d &p) |
Polynomial_traits_d < Polynomial_d > ::Integral_division_up_to_constant_factor::result_type | integral_division_up_to_constant_factor (const Polynomial_d &p, const Polynomial_d &q) |
Polynomial_traits_d < Polynomial_d > ::Invert::result_type | invert (const Polynomial_d &p, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
Polynomial_traits_d < Polynomial_d > ::Is_square_free::result_type | is_square_free (const Polynomial_d &p) |
Polynomial_traits_d < Polynomial_d > ::Is_zero_at_homogeneous::result_type | is_zero_at_homogeneous (const Polynomial_d &p, InputIterator begin, InputIterator end) |
Polynomial_traits_d < Polynomial_d > ::Is_zero_at::result_type | is_zero_at (const Polynomial_d &p, InputIterator begin, InputIterator end) |
Polynomial_traits_d < Polynomial_d > ::Leading_coefficient::result_type | leading_coefficient (const Polynomial_d &p) |
Polynomial_traits_d < Polynomial_d > ::Make_square_free::result_type | make_square_free (const Polynomial_d &p) |
Polynomial_traits_d < Polynomial_d > ::Move::result_type | move (const Polynomial_d &p, int i, int j) |
Polynomial_traits_d < Polynomial_d > ::Multivariate_content::result_type | multivariate_content (const Polynomial_d &p) |
Polynomial_traits_d < Polynomial_d > ::Negate::result_type | negate (const Polynomial_d &p, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
int | number_of_real_roots (Polynomial_d f) |
int | number_of_real_roots (InputIterator start, InputIterator end) |
Polynomial_traits_d < Polynomial_d > ::Permute::result_type | permute (const Polynomial_d &p, InputIterator begin, InputIterator end) |
OutputIterator | polynomial_subresultants (Polynomial_d p, Polynomial_d q, OutputIterator out) |
OutputIterator1 | polynomial_subresultants_with_cofactors (Polynomial_d p, Polynomial_d q, OutputIterator1 sres_out, OutputIterator2 coP_out, OutputIterator3 coQ_out) |
OutputIterator | principal_sturm_habicht_sequence (typename Polynomial_d f, OutputIterator out) |
OutputIterator | principal_subresultants (Polynomial_d p, Polynomial_d q, OutputIterator out) |
void | pseudo_division (const Polynomial_d &f, const Polynomial_d &g, Polynomial_d &q, Polynomial_d &r, Polynomial_traits_d< Polynomial_d >::Coefficient_type &D) |
Polynomial_traits_d < Polynomial_d > ::Pseudo_division_quotient::result_type | pseudo_division_quotient (const Polynomial_d &p, const Polynomial_d &q) |
Polynomial_traits_d < Polynomial_d > ::Pseudo_division_remainder::result_type | pseudo_division_remainder (const Polynomial_d &p, const Polynomial_d &q) |
Polynomial_traits_d < Polynomial_d > ::Resultant::result_type | resultant (const Polynomial_d &p, const Polynomial_d &q) |
Polynomial_traits_d < Polynomial_d > ::Scale_homogeneous::result_type | scale_homogeneous (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &u, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &v, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
Polynomial_traits_d < Polynomial_d > ::Scale::result_type | scale (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &a, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
Polynomial_traits_d < Polynomial_d > ::Shift::result_type | shift (const Polynomial_d &p, int i, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
Polynomial_traits_d < Polynomial_d > ::Sign_at_homogeneous::result_type | sign_at_homogeneous (const Polynomial_d &p, InputIterator begin, InputIterator end) |
Polynomial_traits_d < Polynomial_d > ::Sign_at::result_type | sign_at (const Polynomial_d &p, InputIterator begin, InputIterator end) |
OutputIterator | square_free_factorize (const Polynomial_d &p, OutputIterator it, Polynomial_traits_d< Polynomial >::Innermost_coefficient &a) |
OutputIterator | square_free_factorize (const Polynomial_d &p, OutputIterator it) |
OutputIterator | square_free_factorize_up_to_constant_factor (const Polynomial_d &p, OutputIterator it) |
OutputIterator | sturm_habicht_sequence (Polynomial_d f, OutputIterator out) |
OutputIterator1 | sturm_habicht_sequence_with_cofactors (Polynomial_d f, OutputIterator1 stha_out, OutputIterator2 cof_out, OutputIterator3 cofx_out) |
CGAL::Coercion_traits < Polynomial_traits_d < Polynomial_d > ::Innermost_coefficient, std::iterator_traits < Input_iterator >::value_type > ::Type | substitute_homogeneous (const Polynomial_d &p, InputIterator begin, InputIterator end) |
CGAL::Coercion_traits < Polynomial_traits_d < Polynomial_d > ::Innermost_coefficient, std::iterator_traits < Input_iterator >::value_type > ::Type | substitute (const Polynomial_d &p, InputIterator begin, InputIterator end) |
Polynomial_traits_d < Polynomial_d > ::Swap::result_type | swap (const Polynomial_d &p, int i, int j) |
Polynomial_traits_d < Polynomial_d > ::Total_degree::result_type | total_degree (const Polynomial_d &p) |
Polynomial_traits_d < Polynomial_d > ::Translate_homogeneous::result_type | translate_homogeneous (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &u, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &v, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
Polynomial_traits_d < Polynomial_d > ::Translate::result_type | translate (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &a, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
Polynomial_traits_d < Polynomial_d > ::Univariate_content::result_type | univariate_content (const Polynomial_d &p) |
Polynomial_traits_d < Polynomial_d > ::Univariate_content_up_to_constant_factor::result_type | univariate_content_up_to_constant_factor (const Polynomial_d &p) |
bool | has_in_x_range (const Circular_arc_2< CircularKernel > &ca, const Circular_arc_point_2< CircularKernel > &p) |
bool | has_in_x_range (const Line_arc_2< CircularKernel > &ca, const Circular_arc_point_2< CircularKernel > &p) |
bool | has_on (const Circle_2< CircularKernel > &c, const Circular_arc_point_2< CircularKernel > &p) |
OutputIterator | make_x_monotone (const Circular_arc_2< CircularKernel > &ca, OutputIterator res) |
OutputIterator | make_xy_monotone (const Circular_arc_2< CircularKernel > &ca, OutputIterator res) |
Circular_arc_point_2 < CircularKernel > | x_extremal_point (const Circle_2< CircularKernel > &c, bool b) |
OutputIterator | x_extremal_points (const Circle_2< CircularKernel > &c, OutputIterator res) |
Circular_arc_point_2 < CircularKernel > | y_extremal_point (const Circle_2< CircularKernel > &c, bool b) |
OutputIterator | y_extremal_points (const Circle_2< CircularKernel > &c, OutputIterator res) |
CGAL::Comparison_result | compare_y_to_right (const Circular_arc_2< CircularKernel > &ca1, const Circular_arc_2< CircularKernel > &ca2, Circular_arc_point_2< CircularKernel > &p) |
bool | is_finite (double x) |
bool | is_finite (float x) |
bool | is_finite (long double x) |
OutputIterator | compute_roots_of_2 (const RT &a, const RT &b, const RT &c, OutputIterator oit) |
Root_of_traits< RT >::Root_of_2 | make_root_of_2 (const RT &a, const RT &b, const RT &c, bool s) |
Root_of_traits< RT >::Root_of_2 | make_root_of_2 (RT alpha, RT beta, RT gamma) |
Root_of_traits< RT >::Root_of_2 | make_sqrt (const RT &x) |
Rational | simplest_rational_in_interval (double d1, double d2) |
Rational | to_rational (double d) |
bool | is_valid (const T &x) |
T | max (const T &x, const T &y) |
T | min (const T &x, const T &y) |
void | complement (const Polygon_2< Kernel, Container > &pgn, Polygon_with_holes_2< Kernel, Container > &res) |
void | complement (const General_polygon_2< Traits > &pgn, General_polygon_with_holes_2< Traits > &res) |
OutputIterator | complement (const Polygon_with_holes_2< Kernel, Container > &pgn, OutputIterator oi) |
OutputIterator | complement (const General_polygon_with_holes_2< General_polygon_2< Traits > > &pgn, OutputIterator oi) |
OutputIterator | difference (const Polygon_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2, OutputIterator oi) |
OutputIterator | difference (const Polygon_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2, OutputIterator oi) |
OutputIterator | difference (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2, OutputIterator oi) |
OutputIterator | difference (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2, OutputIterator oi) |
OutputIterator | difference (const General_polygon_2< Traits > &p1, const General_polygon_2< Traits > &p2, OutputIterator oi) |
OutputIterator | difference (const General_polygon_with_holes_2< General_polygon_2< Traits > > &p1, const General_polygon_2< Traits > &p2, OutputIterator oi) |
OutputIterator | difference (const General_polygon_2< Traits > &p1, const General_polygon_with_holes_2< General_polygon_2< Traits > > &p2, OutputIterator oi) |
OutputIterator | difference (const General_polygon_with_holes_2< Polygon > &p1, const General_polygon_with_holes_2< Polygon > &p2, OutputIterator oi) |
bool | do_intersect (const Polygon_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2) |
bool | do_intersect (const Polygon_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2) |
bool | do_intersect (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2) |
bool | do_intersect (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2) |
bool | do_intersect (const General_polygon_2< Traits > &p1, const General_polygon_2< Traits > &p2) |
bool | do_intersect (const General_polygon_2< Traits > &p1, const General_polygon_with_holes_2< General_polygon_2< Traits > > &p2) |
bool | do_intersect (const General_polygon_with_holes_2< General_polygon_2< Traits > > &p1, const General_polygon_2< Traits > &p2) |
bool | do_intersect (const General_polygon_with_holes_2< Polygon > &p1, const General_polygon_with_holes_2< Polygon > &p2) |
bool | do_intersect (InputIterator begin, InputIterator end) |
bool | do_intersect (InputIterator1 pgn_begin1, InputIterator1 pgn_end1, InputIterator2 pgn_begin2, InputIterator2 pgn_end2) |
OutputIterator | intersection (const Type1 &p1, const Type2 &p2, OutputIterator oi) |
OutputIterator | intersection (const Polygon_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2, OutputIterator oi) |
OutputIterator | intersection (const Polygon_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2, OutputIterator oi) |
OutputIterator | intersection (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2, OutputIterator oi) |
OutputIterator | intersection (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2, OutputIterator oi) |
OutputIterator | intersection (const General_polygon_2< Traits > &p1, const General_polygon_2< Traits > &p2, OutputIterator oi) |
OutputIterator | intersection (const General_polygon_with_holes_2< General_polygon_2< Traits > > &p1, const General_polygon_2< Traits > &p2, OutputIterator oi) |
OutputIterator | intersection (const General_polygon_2< Traits > &p1, const General_polygon_with_holes_2< General_polygon_2< Traits > > &p2, OutputIterator oi) |
OutputIterator | intersection (const General_polygon_with_holes_2< Polygon > &p1, const General_polygon_with_holes_2< Polygon > &p2, OutputIterator oi) |
OutputIterator | intersection (InputIterator begin, InputIterator end, OutputIterator oi) |
OutputIterator | intersection (InputIterator1 pgn_begin1, InputIterator1 pgn_end1, InputIterator2 pgn_begin2, InputIterator2 pgn_end2, OutputIterator oi) |
bool | join (const Polygon_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2, General_polygon_with_holes_2< Polygon_2< Kernel, Container > > &res) |
bool | join (const Polygon_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2, General_polygon_with_holes_2< Polygon_2< Kernel, Container > > &res) |
bool | join (const Polygon_with_holes_2< Kernel, Container > &p2, const Polygon_2< Kernel, Container > &p1, General_polygon_with_holes_2< Polygon_2< Kernel, Container > > &res) |
bool | join (const Polygon_with_holes_2< Kernel, Container > &p2, const Polygon_with_holes_2< Kernel, Container > &p1, General_polygon_with_holes_2< Polygon_2< Kernel, Container > > &res) |
bool | join (const General_polygon_2< Traits > &p1, const General_polygon_2< Traits > &p2, General_polygon_with_holes_2< General_polygon_2< Traits > > &res) |
bool | join (const General_polygon_2< Traits > &p1, const General_polygon_with_holes_2< General_polygon_2< Traits > > &p2, General_polygon_with_holes_2< General_polygon_2< Traits > > &res) |
bool | join (const General_polygon_with_holes_2< General_polygon_2< Traits > > &p2, const General_polygon_2< Traits > &p1, General_polygon_with_holes_2< General_polygon_2< Traits > > &res) |
bool | join (const General_polygon_with_holes_2< Polygon > &p1, const General_polygon_with_holes_2< Polygon > &p2, Traits::Polygon_with_holes_2 &res) |
OutputIterator | join (InputIterator begin, InputIterator end, OutputIterator oi) |
OutputIterator | join (InputIterator1 pgn_begin1, InputIterator1 pgn_end1, InputIterator2 pgn_begin2, InputIterator2 pgn_end2, OutputIterator oi) |
Oriented_side | oriented_side (const Polygon_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2) |
Oriented_side | oriented_side (const Polygon_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2) |
Oriented_side | oriented_side (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2) |
Oriented_side | oriented_side (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2) |
Oriented_side | oriented_side (const General_polygon_2< Traits > &p1, const General_polygon_2< Traits > &p2) |
Oriented_side | oriented_side (const General_polygon_2< Traits > &p1, const General_polygon_with_holes_2< General_polygon_2< Traits > > &p2) |
Oriented_side | oriented_side (const General_polygon_with_holes_2< General_polygon_2< Traits > > &p1, const General_polygon_2< Traits > &p2) |
Oriented_side | oriented_side (const General_polygon_with_holes_2< Polygon > &p1, const General_polygon_with_holes_2< Polygon > &p2) |
OutputIterator | symmetric_difference (const Type1 &p1, const Type2 &p2, OutputIterator oi) |
OutputIterator | symmetric_difference (const Polygon_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2, OutputIterator oi) |
OutputIterator | symmetric_difference (const Polygon_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2, OutputIterator oi) |
OutputIterator | symmetric_difference (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2, OutputIterator oi) |
OutputIterator | symmetric_difference (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2, OutputIterator oi) |
OutputIterator | symmetric_difference (const General_polygon_2< Traits > &p1, const General_polygon_2< Traits > &p2, OutputIterator oi) |
OutputIterator | symmetric_difference (const General_polygon_with_holes_2< General_polygon_2< Traits > > &p1, const General_polygon_2< Traits > &p2, OutputIterator oi) |
OutputIterator | symmetric_difference (const General_polygon_2< Traits > &p1, const General_polygon_with_holes_2< General_polygon_2< Traits > > &p2, OutputIterator oi) |
OutputIterator | symmetric_difference (const General_polygon_with_holes_2< Polygon > &p1, const General_polygon_with_holes_2< Polygon > &p2, OutputIterator oi) |
OutputIterator | symmetric_difference (InputIterator begin, InputIterator end, OutputIterator oi) |
OutputIterator | symmetric_difference (InputIterator1 pgn_begin1, InputIterator1 pgn_end1, InputIterator2 pgn_begin2, InputIterator2 pgn_end2, OutputIterator oi) |
OutputIterator | connect_holes (const Polygon_with_holes_2< Kernel, Container > &pwh, OutputIterator oi) |
OutputIterator | locate (const Arrangement_2< Traits, Dcel > &arr, InputIterator points_begin, InputIterator points_end, OutputIterator oi) |
std::istream & | read (Arrangement_2< Traits, Dcel > &arr, std::istream &is, Formatter &formatter) |
std::ostream & | write (const Arrangement_2< Traits, Dcel > &arr, std::ostream &os, Formatter &formatter) |
std::ostream & | operator<< (std::ostream &os, const Arrangement_2< Traits, Dcel > &arr) |
std::istream & | operator>> (std::istream &is, Arrangement_2< Traits, Dcel > &arr) |
void | overlay (const Arrangement_2< GeomTraitsA, TopTraitsA > &arr1, const Arrangement_2< GeomTraitsB, TopTraitsB > &arr2, Arrangement_2< GeomTraitsRes, TopTraitsRes > &arr_res, OverlayTraits &ovl_tr) |
void | overlay (const Arrangement_with_history_2< Traits, Dcel1 > &arr1, const Arrangement_with_history_2< Traits, Dcel2 > &arr2, Arrangement_with_history_2< Traits, ResDcel > &res, OverlayTraits &ovl_tr) |
OutputIterator | decompose (const Arrangement_2< Traits, Dcel > &arr, OutputIterator oi) |
std::istream & | read (Arrangement_with_history_2< Traits, Dcel > &arr, std::istream &is, WithHistoryFormatter &formatter) |
std::ostream & | write (const Arrangement_with_history_2< Traits, Dcel > &arr, std::ostream &os, WithHistoryFormatter &formatter) |
std::ostream & | operator<< (std::ostream &os, const Arrangement_with_history_2< Traits, Dcel > &arr) |
std::istream & | operator>> (std::istream &is, Arrangement_with_history_2< Traits, Dcel > &arr) |
bool | do_intersect (Arrangement_on_surface_2< GeomTraits, TopTraits > &arr, const Curve &c, const PointLocation &pl) |
Arrangement_2< Traits, Dcel > ::Halfedge_handle | insert_non_intersecting_curve (Arrangement_2< Traits, Dcel > &arr, const typename Traits::X_monotone_curve_2 &xc, const PointLocation &pl=walk_pl) |
void | insert_non_intersecting_curves (Arrangement_2< Traits, Dcel > &arr, InputIterator first, InputIterator last) |
Arrangement_2< Traits, Dcel > ::Vertex_handle | insert_point (Arrangement_2< Traits, Dcel > &arr, const typename Traits::Point_2 &p, const PointLocation &pl=walk_pl) |
bool | is_valid (const Arrangement_2< Traits, Dcel > &arr) |
Arrangement_2< Traits, Dcel > ::Face_handle | remove_edge (Arrangement_2< Traits, Dcel > &arr, typename Arrangement_2< Traits, Dcel >::Halfedge_handle e) |
bool | remove_vertex (Arrangement_2< Traits, Dcel > &arr, typename Arrangement_2< Traits, Dcel >::Vertex_handle v) |
OutputIterator | zone (Arrangement_on_surface_2< GeomTraits, TopTraits > &arr, const typename GeomTraits::X_monotone_curve_2 &c, OutputIterator oi, const PointLocation &pl) |
Arrangement_with_history_2 < Traits, Dcel >::Curve_handle | insert (Arrangement_with_history_2< Traits, Dcel > &arr, const typename Traits::Curve_2 &c, const PointLocation &pl=walk_pl) |
void | insert (Arrangement_with_history_2< Traits, Dcel > &arr, InputIterator first, InputIterator last) |
Size | remove_curve (Arrangement_with_history_2< Traits, Dcel > &arr, typename Arrangement_with_history_2< Traits, Dcel >::Curve_handle ch) |
void | overlay (const Arrangement_with_history_2< Traits, Dcel1 > &arr1, const Arrangement_with_history_2< Traits, Dcel2 > &arr2, Arrangement_with_history_2< Traits, ResDcel > &res) |
Qt_widget & | operator<< (std::ostream &os, const Polyline_2< SegmentTraits > &polyline) |
template<class InputIterator , class Traits > | |
void | lower_envelope_3 (InputIterator begin, InputIterator end, Envelope_diagram_2< Traits > &diag) |
Computes the lower envelope of a set of surfaces in \( \mathbb{R}^3\), as given by the range [begin, end) . More... | |
template<class InputIterator , class Traits > | |
void | lower_envelope_xy_monotone_3 (InputIterator begin, InputIterator end, Envelope_diagram_2< Traits > &diag) |
Computes the lower envelope of a set of \( xy\)-monotone surfaces in \( \mathbb{R}^3\), as given by the range [begin, end) . More... | |
template<class InputIterator , class Traits > | |
void | upper_envelope_3 (InputIterator begin, InputIterator end, Envelope_diagram_2< Traits > &diag) |
Computes the upper envelope of a set of surfaces in \( \mathbb{R}^3\), as given by the range [begin, end) . More... | |
template<class InputIterator , class Traits > | |
void | upper_envelope_xy_monotone_3 (InputIterator begin, InputIterator end, Envelope_diagram_2< Traits > &diag) |
Computes the upper envelope of a set of \( xy\)-monotone surfaces in \( \mathbb{R}^3\), as given by the range [begin, end) . More... | |
Variables | |
ARR_MIN_END | |
ARR_MAX_END | |
ARR_LEFT_TO_RIGHT | |
ARR_RIGHT_TO_LEFT | |
ARR_LEFT_BOUNDARY | |
ARR_RIGHT_BOUNDARY | |
ARR_BOTTOM_BOUNDARY | |
ARR_TOP_BOUNDARY | |
ARR_INTERIOR | |