DGtal 1.4.2
Loading...
Searching...
No Matches
ConvexityHelper.h
1
17#pragma once
18
31#if defined(ConvexityHelper_RECURSES)
32#error Recursive header files inclusion detected in ConvexityHelper.h
33#else // defined(ConvexityHelper_RECURSES)
35#define ConvexityHelper_RECURSES
36
37#if !defined ConvexityHelper_h
39#define ConvexityHelper_h
40
42// Inclusions
43#include <iostream>
44#include <string>
45#include <vector>
46#include "DGtal/base/Common.h"
47#include "DGtal/kernel/CInteger.h"
48#include "DGtal/kernel/SpaceND.h"
49#include "DGtal/geometry/tools/QuickHull.h"
50#include "DGtal/geometry/volumes/BoundedLatticePolytope.h"
51#include "DGtal/geometry/volumes/BoundedRationalPolytope.h"
52#include "DGtal/geometry/volumes/ConvexCellComplex.h"
53#include "DGtal/shapes/PolygonalSurface.h"
54
55namespace DGtal
56{
57
58 namespace detail {
59
69 template < typename TIntegerCoordinate, bool safe >
71 typedef TIntegerCoordinate Type;
72 };
73
79 template < >
81#ifdef WITH_BIGINTEGER
83#else
84 typedef DGtal::int64_t Type;
85#endif
86 };
87
93 template < >
97
103 template < >
105#ifdef WITH_BIGINTEGER
107#else
108 typedef DGtal::int64_t Type;
109#endif
110 };
111
117 template < >
121
122#ifdef WITH_BIGINTEGER
131 template < bool safe >
135#endif
136
137 } // namespace detail
138
140 // template class ConvexityHelper
161 template < int dim,
162 typename TInteger = DGtal::int32_t,
163 typename TInternalInteger = DGtal::int64_t >
166 // Integer must be a model of the concept CInteger.
168 // Integer must be a model of the concept CInteger.
170
171 static const Dimension dimension = dim;
172
173 typedef TInteger Integer;
174 typedef TInternalInteger InternalInteger;
176 typedef typename Space::Point Point;
177 typedef typename Space::Vector Vector;
178 typedef typename Space::RealPoint RealPoint;
180 typedef std::size_t Size;
181 typedef std::size_t Index;
182 typedef std::vector< Index > IndexRange;
183 typedef std::vector< Point > PointRange;
194
195 // ----------------- lattice convex hull services -------------------------
196 public:
199
217 static
219 computeLatticePolytope( const PointRange& input_points,
220 bool remove_duplicates = true,
221 bool make_minkowski_summable = false );
222
235 static
238 bool remove_duplicates = true );
239
240
262 template < typename TSurfaceMesh >
263 static
264 bool
265 computeConvexHullBoundary( TSurfaceMesh& mesh,
266 const PointRange& input_points,
267 bool remove_duplicates = true );
268
286 static
287 bool
289 const PointRange& input_points,
290 bool remove_duplicates = true );
291
307 static
308 bool
310 const PointRange& input_points,
311 bool remove_duplicates = true );
312
333 static
335 computeSimplex( const PointRange& input_points,
336 bool remove_duplicates = true );
337
357 static
360
379 static
382
398 static
400 compute3DTriangle( const Point& a, const Point& b, const Point& c,
401 bool make_minkowski_summable = false );
402
412 static
414 computeDegeneratedTriangle( const Point& a, const Point& b, const Point& c );
415
424 static
426 computeSegment( const Point& a, const Point& b );
427
429
430 // ----------------- lattice Delaunay services -------------------------
431 public:
434
451 static
452 bool
454 const PointRange& input_points,
455 bool remove_duplicates = true );
456
458
459 // ----------------- rational convex hull services -------------------------
460 public:
463
485 static
487 computeRationalPolytope( const std::vector< RealPoint >& input_points,
488 Integer denominator,
489 bool remove_duplicates = true,
490 bool make_minkowski_summable = false );
491
518 template < typename TSurfaceMesh >
519 static
520 bool
521 computeConvexHullBoundary( TSurfaceMesh& mesh,
522 const std::vector< RealPoint >& input_points,
523 double precision = 1024.0,
524 bool remove_duplicates = true );
525
546 static
547 bool
549 const std::vector< RealPoint >& input_points,
550 double precision = 1024.0,
551 bool remove_duplicates = true );
552
573 static
574 bool
576 const std::vector< RealPoint >& input_points,
577 double precision = 1024.0,
578 bool remove_duplicates = true );
579
581
582
583 // ----------------- real Delaunay services -------------------------
584 public:
587
609 static
610 bool
612 const std::vector< RealPoint >& input_points,
613 double precision = 1024.0,
614 bool remove_duplicates = true );
615
617
618 // ----------------- utility services -------------------------
619 public:
622
638 template < typename QHull >
639 static
640 void
642 std::vector< IndexRange >& cell_vertices,
643 std::map< typename QHull::Ridge, Index >& r2f,
644 std::vector< IndexRange >& face_vertices );
645
647
648 }; // class ConvexityHelper
649
650
651} // namespace DGtal
652
654// Includes inline functions.
655#include "ConvexityHelper.ih"
656
657// //
659
660#endif // !defined ConvexityHelper_h
661
662#undef ConvexityHelper_RECURSES
663#endif // else defined(ConvexityHelper_RECURSES)
Aim: Represents an nD lattice polytope, i.e. a convex polyhedron bounded with vertices with integer c...
Aim: Represents an nD rational polytope, i.e. a convex polyhedron bounded by vertices with rational c...
Aim: Represents a polygon mesh, i.e. a 2-dimensional combinatorial surface whose faces are (topologic...
DGtal is the top-level namespace which contains all DGtal functions and types.
boost::int64_t int64_t
signed 94-bit integer.
Definition BasicTypes.h:74
DGtal::uint32_t Dimension
Definition Common.h:136
boost::int32_t int32_t
signed 32-bit integer.
Definition BasicTypes.h:72
mpz_class BigInteger
Multi-precision integer with GMP implementation.
Definition BasicTypes.h:79
Aim: represents a d-dimensional complex in a d-dimensional space with the following properties and re...
Aim: a geometric kernel to compute the convex hull of digital points with integer-only arithmetic.
Aim: a geometric kernel to compute the convex hull of floating points with integer-only arithmetic....
Aim: Provides a set of functions to facilitate the computation of convex hulls and polytopes,...
static PointRange computeConvexHullVertices(const PointRange &input_points, bool remove_duplicates=true)
static bool computeDelaunayCellComplex(ConvexCellComplex< Point > &cell_complex, const PointRange &input_points, bool remove_duplicates=true)
static void computeFacetAndRidgeVertices(const QHull &hull, std::vector< IndexRange > &cell_vertices, std::map< typename QHull::Ridge, Index > &r2f, std::vector< IndexRange > &face_vertices)
static bool computeDelaunayCellComplex(ConvexCellComplex< RealPoint > &cell_complex, const std::vector< RealPoint > &input_points, double precision=1024.0, bool remove_duplicates=true)
ConvexHullIntegralKernel< dim, Integer, InternalInteger > LatticeConvexHullKernel
static bool computeConvexHullBoundary(PolygonalSurface< RealPoint > &polysurf, const std::vector< RealPoint > &input_points, double precision=1024.0, bool remove_duplicates=true)
static LatticePolytope computeSimplex(const PointRange &input_points, bool remove_duplicates=true)
TInternalInteger InternalInteger
static PointRange computeDegeneratedConvexHullVertices(PointRange &input_points)
BoundedLatticePolytope< Space > LatticePolytope
DelaunayIntegralKernel< dim, Integer, InternalInteger > LatticeDelaunayKernel
BOOST_CONCEPT_ASSERT((concepts::CInteger< TInteger >))
static const Dimension dimension
SpaceND< dim, Integer > Space
static LatticePolytope computeSegment(const Point &a, const Point &b)
DelaunayRationalKernel< dim, Integer, InternalInteger > RealDelaunayKernel
static LatticePolytope computeDegeneratedTriangle(const Point &a, const Point &b, const Point &c)
static RationalPolytope computeRationalPolytope(const std::vector< RealPoint > &input_points, Integer denominator, bool remove_duplicates=true, bool make_minkowski_summable=false)
static bool computeConvexHullCellComplex(ConvexCellComplex< Point > &cell_complex, const PointRange &input_points, bool remove_duplicates=true)
static LatticePolytope computeDegeneratedLatticePolytope(PointRange &input_points)
ConvexHullRationalKernel< dim, Integer, InternalInteger > RealConvexHullKernel
static bool computeConvexHullBoundary(PolygonalSurface< Point > &polysurf, const PointRange &input_points, bool remove_duplicates=true)
static bool computeConvexHullBoundary(TSurfaceMesh &mesh, const std::vector< RealPoint > &input_points, double precision=1024.0, bool remove_duplicates=true)
Space::RealVector RealVector
BOOST_CONCEPT_ASSERT((concepts::CInteger< TInternalInteger >))
static LatticePolytope compute3DTriangle(const Point &a, const Point &b, const Point &c, bool make_minkowski_summable=false)
std::vector< Index > IndexRange
std::vector< Point > PointRange
Space::RealPoint RealPoint
static bool computeConvexHullBoundary(TSurfaceMesh &mesh, const PointRange &input_points, bool remove_duplicates=true)
BoundedRationalPolytope< Space > RationalPolytope
static LatticePolytope computeLatticePolytope(const PointRange &input_points, bool remove_duplicates=true, bool make_minkowski_summable=false)
static bool computeConvexHullCellComplex(ConvexCellComplex< RealPoint > &cell_complex, const std::vector< RealPoint > &input_points, double precision=1024.0, bool remove_duplicates=true)
Aim: a geometric kernel to compute the Delaunay triangulation of digital points with integer-only ari...
Aim: a geometric kernel to compute the Delaunay triangulation of a range of floating points with inte...
Aim: Concept checking for Integer Numbers. More precisely, this concept is a refinement of both CEucl...
Definition CInteger.h:88