digitalPolyhedronBuilder3D.cpp File Reference

#include <iostream>
#include <queue>
#include "DGtal/base/Common.h"
#include "DGtal/helpers/StdDefs.h"
#include "DGtal/io/viewers/PolyscopeViewer.h"
#include "DGtal/shapes/Shapes.h"
#include "DGtal/shapes/SurfaceMesh.h"
#include "DGtal/io/readers/SurfaceMeshReader.h"
#include "DGtal/geometry/volumes/DigitalConvexity.h"
#include "ConfigExamples.h"

Include dependency graph for digitalPolyhedronBuilder3D.cpp:

Go to the source code of this file.

Namespaces
namespace	DGtal
	DGtal is the top-level namespace which contains all DGtal functions and types.

Typedefs
typedef Z3i::Integer	Integer
typedef Z3i::Domain	Domain
typedef Z3i::SCell	SCell
typedef std::vector< Point >	PointRange

Functions
int	main (int argc, char **argv)

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

2022/06/20

An example file named digitalPolyhedronBuilder3D

This file is part of the DGtal library.

Definition in file digitalPolyhedronBuilder3D.cpp.

Typedef Documentation

Domain

typedef Z3i::Domain Domain

Definition at line 78 of file digitalPolyhedronBuilder3D.cpp.

Integer

typedef Z3i::Integer Integer

Definition at line 76 of file digitalPolyhedronBuilder3D.cpp.

PointRange

typedef std::vector<Point> PointRange

Examples

geometry/tools/exampleAlphaShape.cpp, geometry/volumes/digitalPolyhedronBuilder3D.cpp, and geometry/volumes/standardDigitalPolyhedronBuilder3D.cpp.

Definition at line 84 of file digitalPolyhedronBuilder3D.cpp.

SCell

typedef Z3i::SCell SCell

Examples

geometry/curves/estimation/exampleCurvature.cpp, geometry/curves/exampleGridCurve2d.cpp, geometry/volumes/digitalPolyhedronBuilder3D.cpp, geometry/volumes/fullConvexityAnalysis3D.cpp, geometry/volumes/fullConvexityShortestPaths3D.cpp, geometry/volumes/fullConvexitySphereGeodesics.cpp, geometry/volumes/standardDigitalPolyhedronBuilder3D.cpp, graph/volDistanceTraversal.cpp, io/viewers/viewer3D-10-interaction.cpp, topology/ctopo-1s-3d.cpp, topology/ctopo-fillContours.cpp, topology/frontierAndBoundary.cpp, topology/volBreadthFirstTraversal.cpp, and topology/volTrackBoundary.cpp.

Definition at line 79 of file digitalPolyhedronBuilder3D.cpp.

Function Documentation

main()

int main	(	int	argc,
		char **	argv )

Definition at line 86 of file digitalPolyhedronBuilder3D.cpp.

{
  trace.info() << "Usage: " << argv[ 0 ] << " <input.obj> <h> <view>" << std::endl;
  trace.info() << "\tComputes a digital polyhedron from an OBJ file" << std::endl;
  trace.info() << "\t- input.obj: choose your favorite mesh" << std::endl;
  trace.info() << "\t- h [==1]: the digitization gridstep" << std::endl;
  trace.info() << "\t- view [==7]: display vertices(1), edges(2), faces(4)" << std::endl;
  string filename = examplesPath + "samples/lion.obj";
  std::string  fn = argc > 1 ? argv[ 1 ]         : filename; //< vol filename
  double        h = argc > 2 ? atof( argv[ 2 ] ) : 1.0;
  int        view = argc > 3 ? atoi( argv[ 3 ] ) : 7;
  // Read OBJ file
  std::ifstream input( fn.c_str() );
  DGtal::SurfaceMesh< RealPoint, RealVector > surfmesh;
  bool ok = SurfaceMeshReader< RealPoint, RealVector >::readOBJ( input, surfmesh );
  if ( ! ok )
    {
      trace.error() << "Unable to read obj file : " << fn << std::endl;
      return 1;
    }
 
  typedef PolyscopeViewer<Space,KSpace> MViewer;
  MViewer viewer;
 
  Point lo(-500,-500,-500);
  Point up(500,500,500);
  DigitalConvexity< KSpace > dconv( lo, up );
  typedef DigitalConvexity< KSpace >::EnvelopeAlgorithm Algorithm;
  
  auto vertices = std::vector<Point>( surfmesh.nbVertices() );
  for ( auto v : surfmesh )
    {
      RealPoint p = (1.0 / h) * surfmesh.position( v );
      Point q ( (Integer) round( p[ 0 ] ),
                (Integer) round( p[ 1 ] ),
                (Integer) round( p[ 2 ] ) );
      vertices[ v ] = q;
    }
  std::set< Point > faces_set, edges_set;
  auto faceVertices = surfmesh.allIncidentVertices();
  auto edgeVertices = surfmesh.allEdgeVertices();
 
  trace.beginBlock( "Computing polyhedron" );
  for ( int f = 0; f < surfmesh.nbFaces(); ++f )
    {
      PointRange X;
      for ( auto v : faceVertices[ f ] )
        X.push_back( vertices[ v ] );
      auto F = dconv.envelope( X, Algorithm::DIRECT );
      faces_set.insert( F.cbegin(), F.cend() );
    }
  for ( int e = 0; e < surfmesh.nbEdges(); ++e )
    {
      PointRange X =
        { vertices[ edgeVertices[ e ].first  ],
          vertices[ edgeVertices[ e ].second ] };
      auto E = dconv.envelope( X, Algorithm::DIRECT );
      edges_set.insert( E.cbegin(), E.cend() );
    }
  trace.endBlock();
  std::vector< Point > face_points, edge_points;
  std::vector< Point > vertex_points = vertices;
  std::sort( vertex_points.begin(), vertex_points.end() );
  std::set_difference( faces_set.cbegin(), faces_set.cend(),
                       edges_set.cbegin(), edges_set.cend(),
                       std::back_inserter( face_points ) );
  std::set_difference( edges_set.cbegin(), edges_set.cend(),
                       vertex_points.cbegin(), vertex_points.cend(),
                       std::back_inserter( edge_points ) );
  auto total = vertex_points.size() + edge_points.size() + face_points.size();
  trace.info() << "#vertex points=" << vertex_points.size() << std::endl;
  trace.info() << "#edge   points=" << edge_points.size() << std::endl;
  trace.info() << "#face   points=" << face_points.size() << std::endl;
  trace.info() << "#total  points=" << total << std::endl;
 
  // display everything
  Color colors[] = { Color::Black, Color( 100, 100, 100 ), Color( 200, 200, 200 ) };
  if ( view & 0x1 )
    {
      viewer.drawColor( colors[ 0 ] );
      viewer.drawColor( colors[ 0 ] );
      for ( auto p : vertices ) viewer << p;
    }
  if ( view & 0x2 )
    {
      viewer.drawColor( colors[ 1 ] );
      viewer.drawColor( colors[ 1 ] );
      for ( auto p : edge_points ) viewer << p;
    }
  if ( view & 0x4 )
    {
      viewer.drawColor( colors[ 2 ] );
      viewer.drawColor( colors[ 2 ] );
      for ( auto p : face_points ) viewer << p;
    }
 
  viewer.show();  
  return 0;
 
}

References DGtal::Color::Black, DGtal::SurfaceMeshReader< TRealPoint, TRealVector >::readOBJ(), surfmesh, and DGtal::trace.