2013-06-24 17:35:49 +00:00
|
|
|
#include "TriangleMesh.hpp"
|
|
|
|
|
|
|
|
TriangleMesh::TriangleMesh() {}
|
|
|
|
TriangleMesh::~TriangleMesh() {
|
|
|
|
stl_close(&stl);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
TriangleMesh::ReadSTLFile(char* input_file) {
|
|
|
|
stl_open(&stl, input_file);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
TriangleMesh::Repair() {
|
|
|
|
int i;
|
|
|
|
|
|
|
|
// checking exact
|
|
|
|
stl_check_facets_exact(&stl);
|
|
|
|
stl.stats.facets_w_1_bad_edge = (stl.stats.connected_facets_2_edge - stl.stats.connected_facets_3_edge);
|
|
|
|
stl.stats.facets_w_2_bad_edge = (stl.stats.connected_facets_1_edge - stl.stats.connected_facets_2_edge);
|
|
|
|
stl.stats.facets_w_3_bad_edge = (stl.stats.number_of_facets - stl.stats.connected_facets_1_edge);
|
|
|
|
|
|
|
|
// checking nearby
|
|
|
|
int last_edges_fixed = 0;
|
|
|
|
float tolerance = stl.stats.shortest_edge;
|
|
|
|
float increment = stl.stats.bounding_diameter / 10000.0;
|
|
|
|
int iterations = 2;
|
|
|
|
if (stl.stats.connected_facets_3_edge < stl.stats.number_of_facets) {
|
|
|
|
for (i = 0; i < iterations; i++) {
|
|
|
|
if (stl.stats.connected_facets_3_edge < stl.stats.number_of_facets) {
|
|
|
|
printf("Checking nearby. Tolerance= %f Iteration=%d of %d...", tolerance, i + 1, iterations);
|
|
|
|
stl_check_facets_nearby(&stl, tolerance);
|
|
|
|
printf(" Fixed %d edges.\n", stl.stats.edges_fixed - last_edges_fixed);
|
|
|
|
last_edges_fixed = stl.stats.edges_fixed;
|
|
|
|
tolerance += increment;
|
|
|
|
} else {
|
|
|
|
printf("All facets connected. No further nearby check necessary.\n");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
printf("All facets connected. No nearby check necessary.\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
// remove_unconnected
|
|
|
|
if (stl.stats.connected_facets_3_edge < stl.stats.number_of_facets) {
|
|
|
|
printf("Removing unconnected facets...\n");
|
|
|
|
stl_remove_unconnected_facets(&stl);
|
|
|
|
} else
|
|
|
|
printf("No unconnected need to be removed.\n");
|
|
|
|
|
|
|
|
// fill_holes
|
|
|
|
if (stl.stats.connected_facets_3_edge < stl.stats.number_of_facets) {
|
|
|
|
printf("Filling holes...\n");
|
|
|
|
stl_fill_holes(&stl);
|
|
|
|
} else
|
|
|
|
printf("No holes need to be filled.\n");
|
|
|
|
|
|
|
|
// normal_directions
|
|
|
|
printf("Checking normal directions...\n");
|
|
|
|
stl_fix_normal_directions(&stl);
|
|
|
|
|
|
|
|
// normal_values
|
|
|
|
printf("Checking normal values...\n");
|
|
|
|
stl_fix_normal_values(&stl);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
TriangleMesh::WriteOBJFile(char* output_file) {
|
|
|
|
stl_generate_shared_vertices(&stl);
|
|
|
|
stl_write_obj(&stl, output_file);
|
|
|
|
}
|
2013-06-24 18:11:56 +00:00
|
|
|
|
|
|
|
AV*
|
|
|
|
TriangleMesh::ToPerl() {
|
|
|
|
int i;
|
|
|
|
|
|
|
|
stl_generate_shared_vertices(&stl);
|
|
|
|
|
|
|
|
// vertices
|
|
|
|
AV* vertices = newAV();
|
|
|
|
av_extend(vertices, stl.stats.shared_vertices);
|
|
|
|
for (i = 0; i < stl.stats.shared_vertices; i++) {
|
|
|
|
AV* vertex = newAV();
|
|
|
|
av_store(vertices, i, newRV_noinc((SV*)vertex));
|
|
|
|
av_extend(vertex, 2);
|
|
|
|
av_store(vertex, 0, newSVnv(stl.v_shared[i].x));
|
|
|
|
av_store(vertex, 1, newSVnv(stl.v_shared[i].y));
|
|
|
|
av_store(vertex, 2, newSVnv(stl.v_shared[i].z));
|
|
|
|
}
|
|
|
|
|
|
|
|
// facets
|
|
|
|
AV* facets = newAV();
|
|
|
|
av_extend(facets, stl.stats.number_of_facets);
|
|
|
|
for (i = 0; i < stl.stats.number_of_facets; i++) {
|
|
|
|
AV* facet = newAV();
|
|
|
|
av_store(facets, i, newRV_noinc((SV*)facet));
|
|
|
|
av_extend(facet, 2);
|
|
|
|
av_store(facet, 0, newSVnv(stl.v_indices[i].vertex[0]));
|
|
|
|
av_store(facet, 1, newSVnv(stl.v_indices[i].vertex[1]));
|
|
|
|
av_store(facet, 2, newSVnv(stl.v_indices[i].vertex[2]));
|
|
|
|
}
|
|
|
|
|
|
|
|
AV* result = newAV();
|
|
|
|
av_extend(result, 1);
|
|
|
|
av_store(result, 0, newRV_noinc((SV*)vertices));
|
|
|
|
av_store(result, 1, newRV_noinc((SV*)facets));
|
|
|
|
return result;
|
|
|
|
}
|