92 lines
2.4 KiB
C
92 lines
2.4 KiB
C
|
// Copyright (c) 1999 INRIA Sophia-Antipolis (France).
|
||
|
|
// All rights reserved.
|
||
|
|
//
|
||
|
|
// This file is part of CGAL (www.cgal.org).
|
||
|
|
// You can redistribute it and/or modify it under the terms of the GNU
|
||
|
|
// General Public License as published by the Free Software Foundation,
|
||
|
|
// either version 3 of the License, or (at your option) any later version.
|
||
|
|
//
|
||
|
|
// Licensees holding a valid commercial license may use this file in
|
||
|
|
// accordance with the commercial license agreement provided with the software.
|
||
|
|
//
|
||
|
|
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
||
|
|
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
||
|
|
//
|
||
|
|
// $URL$
|
||
|
|
// $Id$
|
||
|
|
// SPDX-License-Identifier: GPL-3.0+
|
||
|
|
//
|
||
|
|
// Author(s) : Monique Teillaud <Monique.Teillaud@sophia.inria.fr>
|
||
|
|
|
||
|
|
#ifndef CGAL_TRIANGULATION_VERTEX_BASE_3_H
|
||
|
|
#define CGAL_TRIANGULATION_VERTEX_BASE_3_H
|
||
|
|
|
||
|
|
#include <CGAL/license/Triangulation_3.h>
|
||
|
|
|
||
|
|
|
||
|
|
#include <CGAL/basic.h>
|
||
|
|
#include <CGAL/Triangulation_ds_vertex_base_3.h>
|
||
|
|
|
||
|
|
namespace CGAL {
|
||
|
|
|
||
|
|
template < typename GT, typename DSVb = Triangulation_ds_vertex_base_3<> >
|
||
|
|
class Triangulation_vertex_base_3
|
||
|
|
: public DSVb
|
||
|
|
{
|
||
|
|
public:
|
||
|
|
|
||
|
|
typedef typename DSVb::Cell_handle Cell_handle;
|
||
|
|
typedef GT Geom_traits;
|
||
|
|
typedef typename GT::Point_3 Point;
|
||
|
|
|
||
|
|
template < typename TDS2 >
|
||
|
|
struct Rebind_TDS {
|
||
|
|
typedef typename DSVb::template Rebind_TDS<TDS2>::Other DSVb2;
|
||
|
|
typedef Triangulation_vertex_base_3<GT, DSVb2> Other;
|
||
|
|
};
|
||
|
|
|
||
|
|
Triangulation_vertex_base_3()
|
||
|
|
: DSVb() {}
|
||
|
|
|
||
|
|
Triangulation_vertex_base_3(const Point & p)
|
||
|
|
: DSVb(), _p(p) {}
|
||
|
|
|
||
|
|
Triangulation_vertex_base_3(const Point & p, Cell_handle c)
|
||
|
|
: DSVb(c), _p(p) {}
|
||
|
|
|
||
|
|
Triangulation_vertex_base_3(Cell_handle c)
|
||
|
|
: DSVb(c), _p() {}
|
||
|
|
|
||
|
|
const Point & point() const
|
||
|
|
{ return _p; }
|
||
|
|
|
||
|
|
Point & point()
|
||
|
|
{ return _p; }
|
||
|
|
|
||
|
|
void set_point(const Point & p)
|
||
|
|
{ _p = p; }
|
||
|
|
|
||
|
|
private:
|
||
|
|
Point _p;
|
||
|
|
};
|
||
|
|
|
||
|
|
template < class GT, class DSVb >
|
||
|
|
std::istream&
|
||
|
|
operator>>(std::istream &is, Triangulation_vertex_base_3<GT, DSVb> &v)
|
||
|
|
// non combinatorial information. Default = point
|
||
|
|
{
|
||
|
|
return is >> static_cast<DSVb&>(v) >> v.point();
|
||
|
|
}
|
||
|
|
|
||
|
|
template < class GT, class DSVb >
|
||
|
|
std::ostream&
|
||
|
|
operator<<(std::ostream &os, const Triangulation_vertex_base_3<GT, DSVb> &v)
|
||
|
|
// non combinatorial information. Default = point
|
||
|
|
{
|
||
|
|
return os << static_cast<const DSVb&>(v) << v.point();
|
||
|
|
}
|
||
|
|
|
||
|
|
} //namespace CGAL
|
||
|
|
|
||
|
|
#endif // CGAL_TRIANGULATION_VERTEX_BASE_3_H
|