mirror of https://github.com/CGAL/cgal
55 lines
1.9 KiB
C++
55 lines
1.9 KiB
C++
// Copyright (c) 2009 INRIA Sophia-Antipolis (France),
|
|
//
|
|
// This file is part of CGAL (www.cgal.org); you may redistribute it under
|
|
// the terms of the Q Public License version 1.0.
|
|
// See the file LICENSE.QPL distributed with CGAL.
|
|
//
|
|
// 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$
|
|
//
|
|
// Author(s) : Samuel Hornus
|
|
|
|
/* RANDOM DESIGN IDEAS:
|
|
- Use a policy tag to choose for incremental with inserts only or
|
|
incremental with removals and inserts.
|
|
In the first case: use Triangulation for storage.
|
|
In the second case: use Delaunay !
|
|
In this second case, we must keeps the points that are inserted in the hull,
|
|
as they may become part of the boundary later on, when some points are removed.
|
|
- Constructor with range argument uses quickhull.
|
|
*/
|
|
|
|
#ifndef CGAL_CONVEX_HULL_H
|
|
#define CGAL_CONVEX_HULL_H
|
|
|
|
namespace CGAL {
|
|
|
|
template < class CHTraits, class TDS_ = Default >
|
|
class Convex_hull
|
|
{
|
|
typedef typename Maximal_dimension<typename CHTraits::Point_d>::type
|
|
Maximal_dimension_;
|
|
typedef typename Default::Get<TDS_, Triangulation_data_structure
|
|
< Maximal_dimension_,
|
|
Triangulation_vertex<CHTraits>,
|
|
Triangulation_full_cell<CHTraits> >
|
|
>::type TDS;
|
|
typedef Convex_hull<CHTraits, TDS_> Self;
|
|
|
|
typedef typename CHTraits::Coaffine_orientation_d
|
|
Coaffine_orientation_d;
|
|
typedef typename CHTraits::Orientation_d Orientation_d;
|
|
|
|
public:
|
|
};
|
|
|
|
} //namespace CGAL
|
|
|
|
#endif // CGAL_CONVEX_HULL_H
|