blob: a8f91bf8d32061ee21fed8fb6d2ad498e6212a9f (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
|
// Copyright (c) 2009-2014 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$
//
// 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
|
