Todo List

Member Active_objects_vector< Value_t >::set (Key key, const Data &new_value)

check continuity.

Member Arr_geodesic_arc_on_sphere_traits_2< T_Kernel >::Are_mergeable_2::operator() (const X_monotone_curve_2 &xc1, const X_monotone_curve_2 &xc2) const

temporary:

Member Arr_geodesic_arc_on_sphere_traits_2< T_Kernel >::Parameter_space_in_x_2::operator() (const Point_2 p) const

For now the precondition is not applied. Instead, and as a convention, if the point lies on the vertical identification curve it is assumed to be smaller than anything else. Thus, ARR_LEFT_BOUNDARY is returned.

Member Arr_spherical_topology_traits_2< GeomTraits, T_Dcel >::is_in_face (const Face *f, const Point_2 &p, const Vertex *v) const

a temporary test if (((v != NULL) && (v->parameter_space_in_y() == ARR_BOTTOM_BOUNDARY)) || (p.is_min_boundary())) return false;

Member Arr_spherical_topology_traits_2< GeomTraits, T_Dcel >::is_valid_vertex (const Vertex *) const

why is this needed, and where used?

Class Arr_x_monotone_geodesic_arc_on_sphere_3< T_Kernel >

At this point such an arc cannot have an angle of 180 degrees.

It is always directed from its source to its target.

File basic.h

cgal documentation

Member CGAL::Mesh_2::Refine_faces_base< Tr, Criteria, Previous >::before_conflicts_impl (const Face_handle &, const Point &)

??

modularize

modularize

Member CGAL::Mesh_2::Refine_faces_base< Tr, Criteria, Previous >::before_insertion_impl (const Face_handle &, const Point &, Zone &zone)

Perhaps this function is useless.

Member CGAL::Mesh_2::Refine_faces_base< Tr, Criteria, Previous >::compute_new_bad_faces (Vertex_handle v)

The visitor should be made friend, instead of this function to be public.

Member CGAL::Mesher_level< Tr, Derived, Element, Previous, Triangulation_traits >::process_one_element (Mesh_visitor visitor)

Merge with try_to_refine_element().

Namespace CGAL::POLYNOMIAL

put specialized templates first in header

wrapper support for boost::interval

Member Delaunay_triangulation_base_3< TraitsT, Visitor >::insert (Point_key k, Cell_handle h)

replace by insert_in_hole

File Env_tracing_traits_3.h

Revise this file.

Member Envelope_divide_and_conquer_2< Traits_, Diagram_ >::compare_y_at_end (const X_monotone_curve_2 &xcv1, const X_monotone_curve_2 &xcv2, Arr_curve_end curve_end) const

Move it to Arr_traits_adaptor ?

Move it to Arr_traits_adaptor ?

Move it to Arr_traits_adaptor ?

Member Filtered_function< Traits >::is_constant () const

check if the exact is know and use it if it is

Member Filtered_function< Traits >::is_zero () const

check if the exact is know and use it if it is

Member Filtered_function< Traits >::VFP

should be hidden

Member Filtered_kernel< CK >::Root_container

make sure that the iterator has all the right types.

Class Fixed_border_parameterizer_3< ParameterizationMesh_3, BorderParameterizer_3, SparseLinearAlgebraTraits_d >

Fixed_border_parameterizer_3 should remove border vertices from the linear systems in order to have a symmetric positive definite matrix for Tutte Barycentric Mapping and Discrete Conformal Map algorithms.

File interval_arithmetic.h

wrapper support for boost::interval

Member Kernel< Polynomial_t, Root_stack_t, NT_t >::Kernel (const Root_stack_traits &tr=Root_stack_traits())

do something with tr

Member Kernel< Polynomial_t, Root_stack_t, NT_t >::Multiplicity

fix the functor to make it work on roots

Member Kernel< Polynomial_t, Root_stack_t, NT_t >::Root_container

make sure that the iterator has all the right types.

Member Kernel< Polynomial_t, Root_stack_t, NT_t >::root_stack_object (const Function &f, const Root &lb, const Root &ub) const

make sure that the iterator has all the right types.

Member Pseudo_remainder< Polynomial >::operator() (const Polynomial &t, const Polynomial &v) const

Why do we need the !STRIP_ZEROS line?

Why did we need this? Negation should be safe.

Member Qt_widget_2< Simulator_t >::simulator_handle () const

check if these methods are needed.

Class Simple_interval_root< Traits >

cache sturm sequence

Member Trapezoidal_decomposition_2< Td_traits >::Trapezoidal_decomposition_2 (const_Self_ref td)

allocate hash_map size according to content.

change vector<> to in_place_list and pointer hash to trapezoidal hash..

Reduce the 3 iterations to 1 (or 2) iterator.

Member Two_list_pointer_event_queue< FK, INF, TARGET >::erase (const Key &item)

Add check that item is actually in the list