mirror of https://github.com/CGAL/cgal
Improve subdivision tests
This commit is contained in:
Mael Rouxel-Labbé
parent
25f5f5a548
commit
3efb6f05c6
|
|
@ -1,44 +1,18 @@
|
||||||
// ============================================================================
|
|
||||||
//
|
|
||||||
// Copyright (c) 2005-2006, 2017 Le-Jeng Shiue
|
|
||||||
//
|
|
||||||
// This software and related documentation is part of an INTERNAL release
|
|
||||||
// of the Computational Geometry Algorithms Library (CGAL). It is not
|
|
||||||
// intended for general use.
|
|
||||||
//
|
|
||||||
// ----------------------------------------------------------------------------
|
|
||||||
//
|
|
||||||
// release : $CGAL_Revision: $
|
|
||||||
// release_date : $CGAL_Date: $
|
|
||||||
//
|
|
||||||
// file : test/Subdivision_method_3/test_Subdivision_method_3.cpp
|
|
||||||
// package : Subdivision_method_3
|
|
||||||
// chapter : Subdivision Method
|
|
||||||
//
|
|
||||||
// revision : $Id$
|
|
||||||
// revision_date : $Date$
|
|
||||||
//
|
|
||||||
// author(s) : Le-Jeng Shiue <Andy.Shiue@gmail.com>
|
|
||||||
//
|
|
||||||
// Test subdivision methods
|
|
||||||
// ============================================================================
|
|
||||||
|
|
||||||
#include <CGAL/subdivision_method_3.h>
|
#include <CGAL/subdivision_method_3.h>
|
||||||
|
|
||||||
#include <CGAL/Simple_cartesian.h>
|
#include <CGAL/Simple_cartesian.h>
|
||||||
#include <CGAL/Polyhedron_3.h>
|
#include <CGAL/Polyhedron_3.h>
|
||||||
#include <CGAL/Surface_mesh.h>
|
#include <CGAL/Surface_mesh.h>
|
||||||
|
#include <CGAL/Polygon_mesh_processing/measure.h>
|
||||||
|
#include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
|
||||||
|
|
||||||
#include <iostream>
|
#include <iostream>
|
||||||
#include <fstream>
|
#include <fstream>
|
||||||
#include <cassert>
|
#include <cassert>
|
||||||
|
|
||||||
using namespace std;
|
namespace PMP = ::CGAL::Polygon_mesh_processing;
|
||||||
using namespace CGAL;
|
namespace SM = ::CGAL::Subdivision_method_3;
|
||||||
|
namespace params = SM::parameters;
|
||||||
#define TEST_DEPTH (3)
|
|
||||||
|
|
||||||
//#define TESTMESH_GENERAL "data/??.off"
|
|
||||||
|
|
||||||
#define TESTMESH_QUAD CGAL::data_file_path("meshes/corner.off")
|
#define TESTMESH_QUAD CGAL::data_file_path("meshes/corner.off")
|
||||||
#define TESTMESH_QUAD_OPEN CGAL::data_file_path("meshes/corner_with_hole.off")
|
#define TESTMESH_QUAD_OPEN CGAL::data_file_path("meshes/corner_with_hole.off")
|
||||||
|
|
@ -46,340 +20,217 @@ using namespace CGAL;
|
||||||
#define TESTMESH_TRI CGAL::data_file_path("meshes/quint_tris.off")
|
#define TESTMESH_TRI CGAL::data_file_path("meshes/quint_tris.off")
|
||||||
#define TESTMESH_TRI_OPEN CGAL::data_file_path("meshes/nefertiti.off")
|
#define TESTMESH_TRI_OPEN CGAL::data_file_path("meshes/nefertiti.off")
|
||||||
|
|
||||||
void test_Subdivision_surface_3() {
|
template <typename Mesh>
|
||||||
typedef CGAL::Simple_cartesian<double> Kernel;
|
void test_Subdivision_surface(const int depth = 3,
|
||||||
typedef CGAL::Polyhedron_3<Kernel> Polyhedron;
|
const bool do_not_modify_geometry = false)
|
||||||
|
{
|
||||||
// test Catmull-Clark subdivision on quad mesh
|
auto check_volume_unchanged = [](Mesh& P)
|
||||||
{
|
{
|
||||||
ifstream mesh(TESTMESH_QUAD);
|
if (!is_triangle_mesh(P))
|
||||||
|
PMP::triangulate_faces(P);
|
||||||
|
|
||||||
Polyhedron P;
|
double area_before = PMP::area(P);
|
||||||
mesh >> P;
|
double area_after = PMP::area(P);
|
||||||
|
assert(std::abs(area_before - area_after) < 1e-6);
|
||||||
|
|
||||||
Subdivision_method_3::CatmullClark_subdivision(P);
|
if (is_closed(P)) {
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
double volume_before = PMP::volume(P);
|
||||||
}
|
double volume_after = PMP::volume(P);
|
||||||
|
assert(std::abs(volume_before - volume_after) < 1e-6);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
// test Catmull-Clark subdivision on 'opened' quad mesh
|
auto write_output = [](const Mesh& P, const std::string& test_name, int depth, bool do_not_modify_geometry) {
|
||||||
|
std::string filename = "out_" + test_name + "_" + std::to_string(depth)
|
||||||
|
+ (do_not_modify_geometry ? "_fixed." : ".") + "off";
|
||||||
|
if (!CGAL::IO::write_polygon_mesh(filename, P, CGAL::parameters::stream_precision(17))) {
|
||||||
|
std::cerr << "Error: Could not write to file " << filename << std::endl;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
// Test Catmull-Clark subdivision on quad mesh
|
||||||
{
|
{
|
||||||
ifstream mesh(TESTMESH_QUAD_OPEN);
|
Mesh P;
|
||||||
|
if (!CGAL::IO::read_polygon_mesh(TESTMESH_QUAD, P) || is_empty(P)) {
|
||||||
Polyhedron P;
|
std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_QUAD << std::endl;
|
||||||
mesh >> P;
|
return;
|
||||||
|
|
||||||
Subdivision_method_3::CatmullClark_subdivision(P);
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
// test Loop subdivision on tri mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::Loop_subdivision(P);
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Loop subdivision on 'opened' tri mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI_OPEN);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::Loop_subdivision(P);
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Doo-Sabin subdivision on general mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI_OPEN);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::DooSabin_subdivision(P);
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Sqrt-3 subdivision on tri mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::Sqrt3_subdivision(P);
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void test_Subdivision_surface_3_SM() {
|
|
||||||
typedef CGAL::Simple_cartesian<double> Kernel;
|
|
||||||
typedef CGAL::Surface_mesh<Kernel::Point_3> Polyhedron;
|
|
||||||
|
|
||||||
// test Catmull-Clark subdivision on quad mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_QUAD);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::CatmullClark_subdivision(P);
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Catmull-Clark subdivision on 'opened' quad mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_QUAD_OPEN);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::CatmullClark_subdivision(P);
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
// test Loop subdivision on tri mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::Loop_subdivision(P);
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Loop subdivision on 'opened' tri mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI_OPEN);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::Loop_subdivision(P);
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Doo-Sabin subdivision on general mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI_OPEN);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::DooSabin_subdivision(P);
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P, true));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Doo-Sabin subdivision on 'opened' quad mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_QUAD_OPEN);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::DooSabin_subdivision(P);
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Sqrt-3 subdivision on tri mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::Sqrt3_subdivision(P);
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Sqrt-3 subdivision on 'opened' tri mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI_OPEN);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::Sqrt3_subdivision(P);
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void test_Subdivision_surface_3_SM_NP() {
|
|
||||||
typedef CGAL::Simple_cartesian<double> Kernel;
|
|
||||||
typedef CGAL::Surface_mesh<Kernel::Point_3> Polyhedron;
|
|
||||||
|
|
||||||
// test Catmull-Clark subdivision on quad mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_QUAD);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::CatmullClark_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
|
|
||||||
.number_of_iterations(TEST_DEPTH));
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Catmull-Clark subdivision on 'opened' quad mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_QUAD_OPEN);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::CatmullClark_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
|
|
||||||
.number_of_iterations(TEST_DEPTH));
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
// test Loop subdivision on tri mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::Loop_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
|
|
||||||
.number_of_iterations(TEST_DEPTH));
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Loop subdivision on 'opened' tri mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI_OPEN);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::Loop_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
|
|
||||||
.number_of_iterations(TEST_DEPTH));
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test linear subdivision on tri mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::linear_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
|
|
||||||
.number_of_iterations(TEST_DEPTH));
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test linear subdivision on 'opened' tri mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI_OPEN);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::linear_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
|
|
||||||
.number_of_iterations(TEST_DEPTH));
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Doo-Sabin subdivision on 'opened' tri mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI_OPEN);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::DooSabin_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
|
|
||||||
.number_of_iterations(TEST_DEPTH));
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Doo-Sabin subdivision on 'opened' quad mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_QUAD_OPEN);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::DooSabin_subdivision(P,Subdivision_method_3::parameters::number_of_iterations(TEST_DEPTH));
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Sqrt-3 subdivision on tri mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::Sqrt3_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
|
|
||||||
.number_of_iterations(TEST_DEPTH));
|
|
||||||
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Sqrt-3 subdivision on 'opened' tri mesh
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI_OPEN);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
Subdivision_method_3::Sqrt3_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
|
|
||||||
.number_of_iterations(TEST_DEPTH));
|
|
||||||
|
|
||||||
std::ofstream out("out_0.off");
|
|
||||||
out << P;
|
|
||||||
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
|
||||||
}
|
|
||||||
|
|
||||||
// test Sqrt-3 subdivision on 'opened' tri mesh & with external property map
|
|
||||||
{
|
|
||||||
ifstream mesh(TESTMESH_TRI_OPEN);
|
|
||||||
|
|
||||||
Polyhedron P;
|
|
||||||
mesh >> P;
|
|
||||||
|
|
||||||
typedef Kernel::Point_3 Point;
|
|
||||||
typedef Kernel::Vector_3 Vector;
|
|
||||||
|
|
||||||
typedef boost::graph_traits<Polyhedron>::vertex_descriptor vertex_descriptor;
|
|
||||||
typedef std::unordered_map<vertex_descriptor, Kernel::Point_3> Point_pmap;
|
|
||||||
typedef boost::associative_property_map<Point_pmap> APM;
|
|
||||||
typedef boost::property_map<Polyhedron, CGAL::vertex_point_t>::type VPM;
|
|
||||||
|
|
||||||
Point_pmap um;
|
|
||||||
APM apm(um);
|
|
||||||
VPM vpm = get(vertex_point, P);
|
|
||||||
|
|
||||||
// some arbitrary new coordinates (different from the internal vpm)
|
|
||||||
for(vertex_descriptor vd : vertices(P)) {
|
|
||||||
boost::property_traits<VPM>::reference pt = get(vpm, vd);
|
|
||||||
Vector v = pt - Point(0., 0., -3.);
|
|
||||||
put(apm, vd, pt + 0.5*v);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
Subdivision_method_3::Sqrt3_subdivision(P,
|
SM::CatmullClark_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
|
||||||
Subdivision_method_3::parameters::vertex_point_map(apm)
|
.number_of_iterations(depth));
|
||||||
.number_of_iterations(TEST_DEPTH));
|
|
||||||
|
|
||||||
assert(CGAL::is_valid_polygon_mesh(P));
|
assert(CGAL::is_valid_polygon_mesh(P));
|
||||||
|
|
||||||
|
write_output(P, "CatmullClark_quad", depth, false /*do not modify*/);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Test Catmull-Clark subdivision on 'opened' quad mesh
|
||||||
|
{
|
||||||
|
Mesh P;
|
||||||
|
if (!CGAL::IO::read_polygon_mesh(TESTMESH_QUAD_OPEN, P) || is_empty(P)) {
|
||||||
|
std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_QUAD_OPEN << std::endl;
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
SM::CatmullClark_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
|
||||||
|
.number_of_iterations(depth)
|
||||||
|
.do_not_modify_geometry(do_not_modify_geometry));
|
||||||
|
assert(CGAL::is_valid_polygon_mesh(P));
|
||||||
|
if (do_not_modify_geometry) {
|
||||||
|
check_volume_unchanged(P);
|
||||||
|
}
|
||||||
|
|
||||||
|
write_output(P, "CatmullClark_quad_open", depth, do_not_modify_geometry);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Test Catmull-Clark subdivision on 'opened' tri mesh
|
||||||
|
{
|
||||||
|
Mesh P;
|
||||||
|
if (!CGAL::IO::read_polygon_mesh(TESTMESH_TRI_OPEN, P) || is_empty(P)) {
|
||||||
|
std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_TRI_OPEN << std::endl;
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
SM::CatmullClark_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
|
||||||
|
.number_of_iterations(depth)
|
||||||
|
.do_not_modify_geometry(do_not_modify_geometry));
|
||||||
|
assert(CGAL::is_valid_polygon_mesh(P));
|
||||||
|
if (do_not_modify_geometry) {
|
||||||
|
check_volume_unchanged(P);
|
||||||
|
}
|
||||||
|
|
||||||
|
write_output(P, "CatmullClark_tri_open", depth, do_not_modify_geometry);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Test Loop subdivision on tri mesh
|
||||||
|
{
|
||||||
|
Mesh P;
|
||||||
|
if (!CGAL::IO::read_polygon_mesh(TESTMESH_TRI, P) || is_empty(P)) {
|
||||||
|
std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_TRI << std::endl;
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
SM::Loop_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
|
||||||
|
.number_of_iterations(depth)
|
||||||
|
.do_not_modify_geometry(do_not_modify_geometry));
|
||||||
|
assert(CGAL::is_valid_polygon_mesh(P));
|
||||||
|
if (do_not_modify_geometry) {
|
||||||
|
check_volume_unchanged(P);
|
||||||
|
}
|
||||||
|
|
||||||
|
write_output(P, "Loop_tri", depth, do_not_modify_geometry);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Test Loop subdivision on 'opened' tri mesh
|
||||||
|
{
|
||||||
|
Mesh P;
|
||||||
|
if (!CGAL::IO::read_polygon_mesh(TESTMESH_TRI_OPEN, P) || is_empty(P)) {
|
||||||
|
std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_TRI_OPEN << std::endl;
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
SM::Loop_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
|
||||||
|
.number_of_iterations(depth)
|
||||||
|
.do_not_modify_geometry(do_not_modify_geometry));
|
||||||
|
assert(CGAL::is_valid_polygon_mesh(P));
|
||||||
|
if (do_not_modify_geometry) {
|
||||||
|
check_volume_unchanged(P);
|
||||||
|
}
|
||||||
|
|
||||||
|
write_output(P, "Loop_tri_open", depth, do_not_modify_geometry);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Test Doo-Sabin subdivision on general mesh
|
||||||
|
{
|
||||||
|
Mesh P;
|
||||||
|
if (!CGAL::IO::read_polygon_mesh(TESTMESH_TRI_OPEN, P) || is_empty(P)) {
|
||||||
|
std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_TRI_OPEN << std::endl;
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
SM::DooSabin_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
|
||||||
|
.number_of_iterations(depth));
|
||||||
|
assert(CGAL::is_valid_polygon_mesh(P));
|
||||||
|
|
||||||
|
write_output(P, "DooSabin_general", depth, false);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Test Sqrt-3 subdivision on tri mesh
|
||||||
|
{
|
||||||
|
Mesh P;
|
||||||
|
if (!CGAL::IO::read_polygon_mesh(TESTMESH_TRI, P) || is_empty(P)) {
|
||||||
|
std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_TRI << std::endl;
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
SM::Sqrt3_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
|
||||||
|
.number_of_iterations(depth));
|
||||||
|
assert(CGAL::is_valid_polygon_mesh(P));
|
||||||
|
check_volume_unchanged(P);
|
||||||
|
|
||||||
|
write_output(P, "Sqrt3_tri", depth, false);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Test Sqrt-3 subdivision on 'opened' tri mesh
|
||||||
|
{
|
||||||
|
Mesh P;
|
||||||
|
if (!CGAL::IO::read_polygon_mesh(TESTMESH_TRI_OPEN, P) || is_empty(P)) {
|
||||||
|
std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_TRI_OPEN << std::endl;
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
SM::Sqrt3_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
|
||||||
|
.number_of_iterations(depth));
|
||||||
|
assert(CGAL::is_valid_polygon_mesh(P));
|
||||||
|
|
||||||
|
write_output(P, "Sqrt3_tri_open", depth, false);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Test Sqrt-3 subdivision on 'opened' tri mesh with external property map
|
||||||
|
{
|
||||||
|
Mesh P;
|
||||||
|
if (!CGAL::IO::read_polygon_mesh(TESTMESH_TRI_OPEN, P) || is_empty(P)) {
|
||||||
|
std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_TRI_OPEN << std::endl;
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
typedef typename boost::property_map<Mesh, CGAL::vertex_point_t>::type VPM;
|
||||||
|
typedef typename boost::property_traits<VPM>::value_type Point;
|
||||||
|
typedef typename boost::property_traits<VPM>::reference PointRef;
|
||||||
|
typedef typename CGAL::Kernel_traits<Point>::type::Vector_3 Vector;
|
||||||
|
|
||||||
|
std::unordered_map<typename boost::graph_traits<Mesh>::vertex_descriptor, Point> um;
|
||||||
|
boost::associative_property_map<std::unordered_map<typename boost::graph_traits<Mesh>::vertex_descriptor, Point>> apm(um);
|
||||||
|
|
||||||
|
VPM vpm = get(CGAL::vertex_point, P);
|
||||||
|
|
||||||
|
// Assign arbitrary new coordinates
|
||||||
|
for (auto vd : vertices(P)) {
|
||||||
|
PointRef pt = get(vpm, vd);
|
||||||
|
Vector v = pt - Point(0., 0., -3.);
|
||||||
|
put(apm, vd, pt + 0.5 * v);
|
||||||
|
}
|
||||||
|
|
||||||
|
SM::Sqrt3_subdivision(P, params::vertex_point_map(apm)
|
||||||
|
.number_of_iterations(depth));
|
||||||
|
assert(CGAL::is_valid_polygon_mesh(P));
|
||||||
|
|
||||||
|
write_output(P, "Sqrt3_tri_open_external_map", depth, false);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
int main() {
|
int main(int argc, char* argv[])
|
||||||
test_Subdivision_surface_3();
|
{
|
||||||
test_Subdivision_surface_3_SM();
|
const int depth = (argc > 1) ? std::stoi(argv[1]) : 3;
|
||||||
test_Subdivision_surface_3_SM_NP();
|
|
||||||
std::cerr << "Done" << std::endl;
|
typedef CGAL::Simple_cartesian<double> Kernel;
|
||||||
return 0;
|
typedef CGAL::Polyhedron_3<Kernel> Polyhedron;
|
||||||
|
typedef CGAL::Surface_mesh<Kernel::Point_3> SurfaceMesh;
|
||||||
|
|
||||||
|
test_Subdivision_surface<Polyhedron>(depth);
|
||||||
|
test_Subdivision_surface<SurfaceMesh>(depth);
|
||||||
|
test_Subdivision_surface<SurfaceMesh>(depth, true /*do_not_modify_geometry*/);
|
||||||
|
|
||||||
|
std::cerr << "Done" << std::endl;
|
||||||
|
|
||||||
|
return 0;
|
||||||
}
|
}
|
||||||
// EOF //
|
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue