exampleGenericLatticeConvexHull.cpp File Reference

#include <iostream>
#include <format>
#include <vector>
#include "DGtal/base/Common.h"
#include "DGtal/kernel/SpaceND.h"
#include "DGtal/geometry/tools/GenericLatticeConvexHull.h"

Include dependency graph for exampleGenericLatticeConvexHull.cpp:

Go to the source code of this file.

Functions
int	main ()
	[generic-qhull-example]

Detailed Description

This program is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.

Author

Jacques-Olivier Lachaud (jacqu.nosp@m.es-o.nosp@m.livie.nosp@m.r.la.nosp@m.chaud.nosp@m.@uni.nosp@m.v-sav.nosp@m.oie..nosp@m.fr ) Laboratory of Mathematics (CNRS, UMR 5127), University of Savoie, France

Date

2025/09/08

An example file named exampleGenericLatticeConvexHull

This file is part of the DGtal library.

Definition in file exampleGenericLatticeConvexHull.cpp.

Function Documentation

main()

int main

(

void

)

[generic-qhull-example]

Definition at line 53 of file exampleGenericLatticeConvexHull.cpp.

{
  using namespace DGtal;
  // point coordinates are int (32 bits), computation with int64_t
  typedef GenericLatticeConvexHull< 3, int, int64_t > QHull; 
  typedef SpaceND< 3, int >                           Space;
  typedef Space::Point                                Point;
 
  std::size_t nb_ok      [ 4 ] = { 0, 0, 0, 0 };
  std::size_t nb_per_dim [ 4 ] = { 0, 0, 0, 0 };
  std::size_t nb_vertices[ 4 ] = { 0, 0, 0, 0 };
  std::size_t nb_facets  [ 4 ] = { 0, 0, 0, 0 };
  const std::size_t nb = 100000;
  for ( std::size_t n = 0; n < nb; ++n )
    {
      // Create a random set of points
      std::vector< Point > X;
      int m = 2 + rand() % 9; //< number of points
      for ( int i = 0; i < m; i++ )
        X.push_back( Point{ rand() % 8, rand() % 8, rand() % 8 } );
      // Compute convex hull
      QHull hull;
      bool ok = hull.compute( X ); 
      auto  k  = hull.affine_dimension;    // affine dimension of X
      // Compute statistics
      nb_per_dim [ k ] += 1;
      nb_vertices[ k ] += hull.positions.size(); // positions of vertices
      nb_facets  [ k ] += hull.facets.size();    // facets
      nb_ok      [ k ] += ok ? 1 : 0;
    }
  for ( auto k = 0; k < 4; k++ )
    std::cout << std::setprecision(3) << ( 100.0 * nb_per_dim[ k ] ) / nb
              << "% are " << k << "-dimensional"
              << " #V=" << double( nb_vertices[ k ] ) / nb_per_dim[ k ] 
              << " #F=" << double( nb_facets[ k ] ) / nb_per_dim[ k ]
              << " (" << nb_ok[ k ] << "/" << nb_per_dim[ k ] << ")\n";
  return 0;
}