CGAL 6.2 - Shape Detection

Loading...
Searching...
No Matches
Shape_detection/region_growing_planes_on_polygon_mesh.cpp
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#ifdef USE_POLYHEDRON
#include <CGAL/Polyhedron_3.h>
#else
#include <CGAL/Surface_mesh.h>
#endif
#include <CGAL/Shape_detection/Region_growing/Region_growing.h>
#include <CGAL/Shape_detection/Region_growing/Polygon_mesh.h>
#include <CGAL/IO/polygon_mesh_io.h>
#include "include/utils.h"
// Typedefs.
using Kernel = CGAL::Exact_predicates_inexact_constructions_kernel;
using FT = typename Kernel::FT;
using Point_3 = typename Kernel::Point_3;
#ifdef USE_POLYHEDRON
using Polygon_mesh = CGAL::Polyhedron_3<Kernel>;
#else
using Polygon_mesh = CGAL::Surface_mesh<Point_3>;
#endif
using Neighbor_query = CGAL::Shape_detection::Polygon_mesh::One_ring_neighbor_query<Polygon_mesh>;
using LS_region_type = CGAL::Shape_detection::Polygon_mesh::Least_squares_plane_fit_region<Kernel, Polygon_mesh>;
using LS_sorting = CGAL::Shape_detection::Polygon_mesh::Least_squares_plane_fit_sorting<Kernel, Polygon_mesh, Neighbor_query>;
using Face_region_type = CGAL::Shape_detection::Polygon_mesh::Plane_face_region<Kernel, Polygon_mesh>;
using Face_area_Sorting = CGAL::Shape_detection::Polygon_mesh::Face_area_sorting<Kernel, Polygon_mesh>;
template<class RegionType, class Sorting_type>
void detect(Polygon_mesh &mesh, FT max_distance, FT max_angle, std::size_t min_region_size, const std::string &out_filename) {
// Create instances of the classes Neighbor_query and Region_type.
Neighbor_query neighbor_query(mesh);
RegionType region_type(
mesh,
CGAL::parameters::
maximum_distance(max_distance).
maximum_angle(max_angle).
minimum_region_size(min_region_size));
// Sort face indices.
Sorting_type sorting(
mesh, neighbor_query);
sorting.sort();
using Region_growing = CGAL::Shape_detection::Region_growing<Neighbor_query, RegionType>;
// Create an instance of the region growing class.
Region_growing region_growing(
faces(mesh), sorting.ordered(), neighbor_query, region_type);
// Run the algorithm.
std::vector<typename Region_growing::Primitive_and_region> regions;
region_growing.detect(std::back_inserter(regions));
std::vector<typename Region_growing::Item> unassigned;
region_growing.unassigned_items(faces(mesh), std::back_inserter(unassigned));
std::cout << regions.size() << " regions found with " << unassigned.size() << " unassigned faces" << std::endl;
const typename Region_growing::Region_map& map = region_growing.region_map();
for (std::size_t i = 0; i < regions.size(); i++)
for (auto& item : regions[i].second) {
if (i != get(map, item)) {
std::cout << "Region map incorrect" << std::endl;
}
}
for (auto& item : unassigned) {
if (std::size_t(-1) != get(map, item)) {
std::cout << "Region map for unassigned incorrect" << std::endl;
}
}
// Save regions to a file.
utils::save_polygon_mesh_regions(mesh, regions, out_filename);
}
int main(int argc, char *argv[]) {
// Load data either from a local folder or a user-provided file.
const std::string filename = argc == 1 ? CGAL::data_file_path("meshes/step.off") : argv[1];
std::cout << filename << std::endl;
std::ifstream in(filename);
CGAL::IO::set_ascii_mode(in);
Polygon_mesh polygon_mesh;
if (!CGAL::IO::read_polygon_mesh(filename, polygon_mesh)) {
std::cerr << "ERROR: cannot read the input file!" << std::endl;
return EXIT_FAILURE;
}
const auto& face_range = faces(polygon_mesh);
std::cout << "* number of input faces: " << face_range.size() << std::endl;
// Default parameter values for the data file building.off.
const FT max_distance = FT(10);
const FT max_angle = FT(90);
const std::size_t min_region_size = 1;
std::cout << "Region growing with Least_squares_plane_fit_region: ";
detect<LS_region_type, LS_sorting>(polygon_mesh, max_distance, max_angle, min_region_size, "least_squares_planes_polygon_mesh.ply");
std::cout << "Region growing with Plane_face_region: ";
detect<Face_region_type, Face_area_Sorting>(polygon_mesh, max_distance, max_angle, min_region_size, "face_planes_polygon_mesh.ply");
return EXIT_SUCCESS;
}
Polygon_mesh.h
A convenience header that includes all classes related to the region growing algorithm on a polygon m...
CGAL::Exact_predicates_inexact_constructions_kernel
CGAL::Polyhedron_3
CGAL::Shape_detection::Polygon_mesh::Face_area_sorting
Sorting of polygon mesh faces with respect to their area.
Definition: Face_area_sorting.h:46
CGAL::Shape_detection::Polygon_mesh::Least_squares_plane_fit_region
Region type based on the quality of the least squares plane fit applied to faces of a polygon mesh.
Definition: Least_squares_plane_fit_region.h:55
CGAL::Shape_detection::Polygon_mesh::Least_squares_plane_fit_sorting
Sorting of polygon mesh faces with respect to the local plane fit quality.
Definition: Least_squares_plane_fit_sorting.h:51
CGAL::Shape_detection::Polygon_mesh::One_ring_neighbor_query
Edge-adjacent faces connectivity in a polygon mesh.
Definition: One_ring_neighbor_query.h:43
CGAL::Shape_detection::Polygon_mesh::Plane_face_region
Region type based on the plane of the first face selected.
Definition: Plane_face_region.h:54
CGAL::Shape_detection::Region_growing
Main class/entry point for running the region growing algorithm.
Definition: Region_growing.h:72
CGAL::Surface_mesh
Kernel::Point_3
RegionType
A concept that describes the set of methods used by the CGAL::Shape_detection::Region_growing to main...
Definition: RegionType.h:20
CGAL::IO::read_polygon_mesh
bool read_polygon_mesh(const std::string &fname, Graph &g, const NamedParameters &np=parameters::default_values())
CGAL::IO::set_ascii_mode
Mode set_ascii_mode(std::ios &s)
CGAL::parameters
Kernel