songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

fix vertical decomposition

This commit is contained in:
Shlomo Golubev 2007-08-21 16:02:57 +00:00
parent 7489227897
commit fc8394c360
1 changed files with 0 additions and 221 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

221
Arrangement_on_surface_2/include/CGAL/Arr_accessor.h
View File

@ -106,227 +106,6 @@ public:
/// \name Local operations and predicates for the arrangement.
//@{
/*!
* Get the bottom left vertex (const version).
*/
Vertex_const_handle bottom_left_fictitious_vertex() const
{
return bottom_left_fictitious_vertex_impl
(typename Arrangement_2::Geometry_traits_2::Has_boundary_category());
}
/*!
* Get the top left vertex (const version).
*/
Vertex_const_handle top_left_fictitious_vertex() const
{
return top_left_fictitious_vertex_impl
(typename Arrangement_2::Geometry_traits_2::Has_boundary_category());
}
/*!
* Get the bottom right vertex (const version).
*/
Vertex_const_handle bottom_right_fictitious_vertex() const
{
return bottom_right_fictitious_vertex_impl
(typename Arrangement_2::Geometry_traits_2::Has_boundary_category());
}
/*!
* Get the top right vertex (const version).
*/
Vertex_const_handle top_right_fictitious_vertex() const
{
return top_right_fictitious_vertex_impl
(typename Arrangement_2::Geometry_traits_2::Has_boundary_category());
}
/*!
* Get the bottom left vertex (non-const version).
*/
Vertex_handle bottom_left_fictitious_vertex()
{
return bottom_left_fictitious_vertex_impl
(typename Arrangement_2::Geometry_traits_2::Has_boundary_category());
}
/*!
* Get the top left vertex (non-const version).
*/
Vertex_handle top_left_fictitious_vertex()
{
return top_left_fictitious_vertex_impl
(typename Arrangement_2::Geometry_traits_2::Has_boundary_category());
}
/*!
* Get the bottom right vertex (non-const version).
*/
Vertex_handle bottom_right_fictitious_vertex()
{
return bottom_right_fictitious_vertex_impl
(typename Arrangement_2::Geometry_traits_2::Has_boundary_category());
}
/*!
* Get the top right vertex (non-const version).
*/
Vertex_handle top_right_fictitious_vertex()
{
return top_right_fictitious_vertex_impl
(typename Arrangement_2::Geometry_traits_2::Has_boundary_category());
}
/* unbounded case */
/*!
* Get the bottom left vertex (const version).
*/
Vertex_const_handle bottom_left_fictitious_vertex_impl(Tag_true) const
{
return (p_arr->_const_handle_for
(p_arr->topology_traits()->bottom_left_vertex()));
}
/*!
* Get the top left vertex (const version).
*/
Vertex_const_handle top_left_fictitious_vertex_impl(Tag_true) const
{
return (p_arr->_const_handle_for
(p_arr->topology_traits()->top_left_vertex()));
}
/*!
* Get the bottom right vertex (const version).
*/
Vertex_const_handle bottom_right_fictitious_vertex_impl(Tag_true) const
{
return (p_arr->_const_handle_for
(p_arr->topology_traits()->bottom_right_vertex()));
}
/*!
* Get the top right vertex (const version).
*/
Vertex_const_handle top_right_fictitious_vertex_impl(Tag_true) const
{
return (p_arr->_const_handle_for
(p_arr->topology_traits()->top_right_vertex()));
}
/*!
* Get the bottom left vertex (non-const version).
*/
Vertex_handle bottom_left_fictitious_vertex_impl(Tag_true)
{
return (p_arr->_handle_for
(p_arr->topology_traits()->bottom_left_vertex()));
}
/*!
* Get the top left vertex (non-const version).
*/
Vertex_handle top_left_fictitious_vertex_impl(Tag_true)
{
return (p_arr->_handle_for
(p_arr->topology_traits()->top_left_vertex()));
}
/*!
* Get the bottom right vertex (non-const version).
*/
Vertex_handle bottom_right_fictitious_vertex_impl(Tag_true)
{
return (p_arr->_handle_for
(p_arr->topology_traits()->bottom_right_vertex()));
}
/*!
* Get the top right vertex (non-const version).
*/
Vertex_handle top_right_fictitious_vertex_impl(Tag_true)
{
return (p_arr->_handle_for
(p_arr->topology_traits()->top_right_vertex()));
}
/* bounded case, currently unsupported */
/*!
* Get the bottom left vertex (const version).
*/
Vertex_const_handle bottom_left_fictitious_vertex_impl(Tag_false) const
{
CGAL_assertion(false);
return NULL;
}
/*!
* Get the top left vertex (const version).
*/
Vertex_const_handle top_left_fictitious_vertex_impl(Tag_false) const
{
CGAL_assertion(false);
return NULL;
}
/*!
* Get the bottom right vertex (const version).
*/
Vertex_const_handle bottom_right_fictitious_vertex_impl(Tag_false) const
{
CGAL_assertion(false);
return NULL;
}
/*!
* Get the top right vertex (const version).
*/
Vertex_const_handle top_right_fictitious_vertex_impl(Tag_false) const
{
CGAL_assertion(false);
return NULL;
}
/*!
* Get the bottom left vertex (non-const version).
*/
Vertex_handle bottom_left_fictitious_vertex_impl(Tag_false)
{
CGAL_assertion(false);
return NULL;
}
/*!
* Get the top left vertex (non-const version).
*/
Vertex_handle top_left_fictitious_vertex_impl(Tag_false)
{
CGAL_assertion(false);
return NULL;
}
/*!
* Get the bottom right vertex (non-const version).
*/
Vertex_handle bottom_right_fictitious_vertex_impl(Tag_false)
{
CGAL_assertion(false);
return NULL;
}
/*!
* Get the top right vertex (non-const version).
*/
Vertex_handle top_right_fictitious_vertex_impl(Tag_false)
{
CGAL_assertion(false);
return NULL;
}
/*!
* Locate the arrangement feature that contains the given unbounded curve
* end.