mirror of
https://github.com/FULU-Foundation/OrcaSlicer-bambulab.git
synced 2026-05-31 18:09:33 -07:00
2085a482c7
Visual Studio 2013. Added multiple compile time checks for data sizes and alignment. The library STL import is not big endian safe, so added a test for endianity, modified STL export to a faster little endian only.
421 lines
13 KiB
C
421 lines
13 KiB
C
/* ADMesh -- process triangulated solid meshes
|
|
* Copyright (C) 1995, 1996 Anthony D. Martin <amartin@engr.csulb.edu>
|
|
* Copyright (C) 2013, 2014 several contributors, see AUTHORS
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 2 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, write to the Free Software Foundation, Inc.,
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*
|
|
* Questions, comments, suggestions, etc to
|
|
* https://github.com/admesh/admesh/issues
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include "stl.h"
|
|
#include "config.h"
|
|
|
|
#if !defined(SEEK_SET)
|
|
#define SEEK_SET 0
|
|
#define SEEK_CUR 1
|
|
#define SEEK_END 2
|
|
#endif
|
|
|
|
void
|
|
stl_print_edges(stl_file *stl, FILE *file) {
|
|
int i;
|
|
int edges_allocated;
|
|
|
|
if (stl->error) return;
|
|
|
|
edges_allocated = stl->stats.number_of_facets * 3;
|
|
for(i = 0; i < edges_allocated; i++) {
|
|
fprintf(file, "%d, %f, %f, %f, %f, %f, %f\n",
|
|
stl->edge_start[i].facet_number,
|
|
stl->edge_start[i].p1.x, stl->edge_start[i].p1.y,
|
|
stl->edge_start[i].p1.z, stl->edge_start[i].p2.x,
|
|
stl->edge_start[i].p2.y, stl->edge_start[i].p2.z);
|
|
}
|
|
}
|
|
|
|
|
|
void
|
|
stl_stats_out(stl_file *stl, FILE *file, char *input_file) {
|
|
if (stl->error) return;
|
|
|
|
/* this is here for Slic3r, without our config.h
|
|
it won't use this part of the code anyway */
|
|
#ifndef VERSION
|
|
#define VERSION "unknown"
|
|
#endif
|
|
fprintf(file, "\n\
|
|
================= Results produced by ADMesh version " VERSION " ================\n");
|
|
fprintf(file, "\
|
|
Input file : %s\n", input_file);
|
|
if(stl->stats.type == binary) {
|
|
fprintf(file, "\
|
|
File type : Binary STL file\n");
|
|
} else {
|
|
fprintf(file, "\
|
|
File type : ASCII STL file\n");
|
|
}
|
|
fprintf(file, "\
|
|
Header : %s\n", stl->stats.header);
|
|
fprintf(file, "============== Size ==============\n");
|
|
fprintf(file, "Min X = % f, Max X = % f\n",
|
|
stl->stats.min.x, stl->stats.max.x);
|
|
fprintf(file, "Min Y = % f, Max Y = % f\n",
|
|
stl->stats.min.y, stl->stats.max.y);
|
|
fprintf(file, "Min Z = % f, Max Z = % f\n",
|
|
stl->stats.min.z, stl->stats.max.z);
|
|
|
|
fprintf(file, "\
|
|
========= Facet Status ========== Original ============ Final ====\n");
|
|
fprintf(file, "\
|
|
Number of facets : %5d %5d\n",
|
|
stl->stats.original_num_facets, stl->stats.number_of_facets);
|
|
fprintf(file, "\
|
|
Facets with 1 disconnected edge : %5d %5d\n",
|
|
stl->stats.facets_w_1_bad_edge, stl->stats.connected_facets_2_edge -
|
|
stl->stats.connected_facets_3_edge);
|
|
fprintf(file, "\
|
|
Facets with 2 disconnected edges : %5d %5d\n",
|
|
stl->stats.facets_w_2_bad_edge, stl->stats.connected_facets_1_edge -
|
|
stl->stats.connected_facets_2_edge);
|
|
fprintf(file, "\
|
|
Facets with 3 disconnected edges : %5d %5d\n",
|
|
stl->stats.facets_w_3_bad_edge, stl->stats.number_of_facets -
|
|
stl->stats.connected_facets_1_edge);
|
|
fprintf(file, "\
|
|
Total disconnected facets : %5d %5d\n",
|
|
stl->stats.facets_w_1_bad_edge + stl->stats.facets_w_2_bad_edge +
|
|
stl->stats.facets_w_3_bad_edge, stl->stats.number_of_facets -
|
|
stl->stats.connected_facets_3_edge);
|
|
|
|
fprintf(file,
|
|
"=== Processing Statistics === ===== Other Statistics =====\n");
|
|
fprintf(file, "\
|
|
Number of parts : %5d Volume : % f\n",
|
|
stl->stats.number_of_parts, stl->stats.volume);
|
|
fprintf(file, "\
|
|
Degenerate facets : %5d\n", stl->stats.degenerate_facets);
|
|
fprintf(file, "\
|
|
Edges fixed : %5d\n", stl->stats.edges_fixed);
|
|
fprintf(file, "\
|
|
Facets removed : %5d\n", stl->stats.facets_removed);
|
|
fprintf(file, "\
|
|
Facets added : %5d\n", stl->stats.facets_added);
|
|
fprintf(file, "\
|
|
Facets reversed : %5d\n", stl->stats.facets_reversed);
|
|
fprintf(file, "\
|
|
Backwards edges : %5d\n", stl->stats.backwards_edges);
|
|
fprintf(file, "\
|
|
Normals fixed : %5d\n", stl->stats.normals_fixed);
|
|
}
|
|
|
|
void
|
|
stl_write_ascii(stl_file *stl, const char *file, const char *label) {
|
|
int i;
|
|
FILE *fp;
|
|
char *error_msg;
|
|
|
|
if (stl->error) return;
|
|
|
|
/* Open the file */
|
|
fp = fopen(file, "w");
|
|
if(fp == NULL) {
|
|
error_msg = (char*)
|
|
malloc(81 + strlen(file)); /* Allow 80 chars+file size for message */
|
|
sprintf(error_msg, "stl_write_ascii: Couldn't open %s for writing",
|
|
file);
|
|
perror(error_msg);
|
|
free(error_msg);
|
|
stl->error = 1;
|
|
return;
|
|
}
|
|
|
|
fprintf(fp, "solid %s\n", label);
|
|
|
|
for(i = 0; i < stl->stats.number_of_facets; i++) {
|
|
fprintf(fp, " facet normal % .8E % .8E % .8E\n",
|
|
stl->facet_start[i].normal.x, stl->facet_start[i].normal.y,
|
|
stl->facet_start[i].normal.z);
|
|
fprintf(fp, " outer loop\n");
|
|
fprintf(fp, " vertex % .8E % .8E % .8E\n",
|
|
stl->facet_start[i].vertex[0].x, stl->facet_start[i].vertex[0].y,
|
|
stl->facet_start[i].vertex[0].z);
|
|
fprintf(fp, " vertex % .8E % .8E % .8E\n",
|
|
stl->facet_start[i].vertex[1].x, stl->facet_start[i].vertex[1].y,
|
|
stl->facet_start[i].vertex[1].z);
|
|
fprintf(fp, " vertex % .8E % .8E % .8E\n",
|
|
stl->facet_start[i].vertex[2].x, stl->facet_start[i].vertex[2].y,
|
|
stl->facet_start[i].vertex[2].z);
|
|
fprintf(fp, " endloop\n");
|
|
fprintf(fp, " endfacet\n");
|
|
}
|
|
|
|
fprintf(fp, "endsolid %s\n", label);
|
|
|
|
fclose(fp);
|
|
}
|
|
|
|
void
|
|
stl_print_neighbors(stl_file *stl, char *file) {
|
|
int i;
|
|
FILE *fp;
|
|
char *error_msg;
|
|
|
|
if (stl->error) return;
|
|
|
|
/* Open the file */
|
|
fp = fopen(file, "w");
|
|
if(fp == NULL) {
|
|
error_msg = (char*)
|
|
malloc(81 + strlen(file)); /* Allow 80 chars+file size for message */
|
|
sprintf(error_msg, "stl_print_neighbors: Couldn't open %s for writing",
|
|
file);
|
|
perror(error_msg);
|
|
free(error_msg);
|
|
stl->error = 1;
|
|
return;
|
|
}
|
|
|
|
for(i = 0; i < stl->stats.number_of_facets; i++) {
|
|
fprintf(fp, "%d, %d,%d, %d,%d, %d,%d\n",
|
|
i,
|
|
stl->neighbors_start[i].neighbor[0],
|
|
(int)stl->neighbors_start[i].which_vertex_not[0],
|
|
stl->neighbors_start[i].neighbor[1],
|
|
(int)stl->neighbors_start[i].which_vertex_not[1],
|
|
stl->neighbors_start[i].neighbor[2],
|
|
(int)stl->neighbors_start[i].which_vertex_not[2]);
|
|
}
|
|
fclose(fp);
|
|
}
|
|
|
|
void
|
|
stl_write_binary(stl_file *stl, const char *file, const char *label) {
|
|
FILE *fp;
|
|
int i;
|
|
char *error_msg;
|
|
|
|
if (stl->error) return;
|
|
|
|
/* Open the file */
|
|
fp = fopen(file, "wb");
|
|
if(fp == NULL) {
|
|
error_msg = (char*)
|
|
malloc(81 + strlen(file)); /* Allow 80 chars+file size for message */
|
|
sprintf(error_msg, "stl_write_binary: Couldn't open %s for writing",
|
|
file);
|
|
perror(error_msg);
|
|
free(error_msg);
|
|
stl->error = 1;
|
|
return;
|
|
}
|
|
|
|
fprintf(fp, "%s", label);
|
|
for(i = strlen(label); i < LABEL_SIZE; i++) putc(0, fp);
|
|
|
|
fseek(fp, LABEL_SIZE, SEEK_SET);
|
|
fwrite(&stl->stats.number_of_facets, 4, 1, fp);
|
|
for(i = 0; i < stl->stats.number_of_facets; i++)
|
|
fwrite(stl->facet_start + i, SIZEOF_STL_FACET, 1, fp);
|
|
fclose(fp);
|
|
}
|
|
|
|
void
|
|
stl_write_vertex(stl_file *stl, int facet, int vertex) {
|
|
if (stl->error) return;
|
|
printf(" vertex %d/%d % .8E % .8E % .8E\n", vertex, facet,
|
|
stl->facet_start[facet].vertex[vertex].x,
|
|
stl->facet_start[facet].vertex[vertex].y,
|
|
stl->facet_start[facet].vertex[vertex].z);
|
|
}
|
|
|
|
void
|
|
stl_write_facet(stl_file *stl, char *label, int facet) {
|
|
if (stl->error) return;
|
|
printf("facet (%d)/ %s\n", facet, label);
|
|
stl_write_vertex(stl, facet, 0);
|
|
stl_write_vertex(stl, facet, 1);
|
|
stl_write_vertex(stl, facet, 2);
|
|
}
|
|
|
|
void
|
|
stl_write_edge(stl_file *stl, char *label, stl_hash_edge edge) {
|
|
if (stl->error) return;
|
|
printf("edge (%d)/(%d) %s\n", edge.facet_number, edge.which_edge, label);
|
|
if(edge.which_edge < 3) {
|
|
stl_write_vertex(stl, edge.facet_number, edge.which_edge % 3);
|
|
stl_write_vertex(stl, edge.facet_number, (edge.which_edge + 1) % 3);
|
|
} else {
|
|
stl_write_vertex(stl, edge.facet_number, (edge.which_edge + 1) % 3);
|
|
stl_write_vertex(stl, edge.facet_number, edge.which_edge % 3);
|
|
}
|
|
}
|
|
|
|
void
|
|
stl_write_neighbor(stl_file *stl, int facet) {
|
|
if (stl->error) return;
|
|
printf("Neighbors %d: %d, %d, %d ; %d, %d, %d\n", facet,
|
|
stl->neighbors_start[facet].neighbor[0],
|
|
stl->neighbors_start[facet].neighbor[1],
|
|
stl->neighbors_start[facet].neighbor[2],
|
|
stl->neighbors_start[facet].which_vertex_not[0],
|
|
stl->neighbors_start[facet].which_vertex_not[1],
|
|
stl->neighbors_start[facet].which_vertex_not[2]);
|
|
}
|
|
|
|
void
|
|
stl_write_quad_object(stl_file *stl, char *file) {
|
|
FILE *fp;
|
|
int i;
|
|
int j;
|
|
char *error_msg;
|
|
stl_vertex connect_color;
|
|
stl_vertex uncon_1_color;
|
|
stl_vertex uncon_2_color;
|
|
stl_vertex uncon_3_color;
|
|
stl_vertex color;
|
|
|
|
if (stl->error) return;
|
|
|
|
/* Open the file */
|
|
fp = fopen(file, "w");
|
|
if(fp == NULL) {
|
|
error_msg = (char*)
|
|
malloc(81 + strlen(file)); /* Allow 80 chars+file size for message */
|
|
sprintf(error_msg, "stl_write_quad_object: Couldn't open %s for writing",
|
|
file);
|
|
perror(error_msg);
|
|
free(error_msg);
|
|
stl->error = 1;
|
|
return;
|
|
}
|
|
|
|
connect_color.x = 0.0;
|
|
connect_color.y = 0.0;
|
|
connect_color.z = 1.0;
|
|
uncon_1_color.x = 0.0;
|
|
uncon_1_color.y = 1.0;
|
|
uncon_1_color.z = 0.0;
|
|
uncon_2_color.x = 1.0;
|
|
uncon_2_color.y = 1.0;
|
|
uncon_2_color.z = 1.0;
|
|
uncon_3_color.x = 1.0;
|
|
uncon_3_color.y = 0.0;
|
|
uncon_3_color.z = 0.0;
|
|
|
|
fprintf(fp, "CQUAD\n");
|
|
for(i = 0; i < stl->stats.number_of_facets; i++) {
|
|
j = ((stl->neighbors_start[i].neighbor[0] == -1) +
|
|
(stl->neighbors_start[i].neighbor[1] == -1) +
|
|
(stl->neighbors_start[i].neighbor[2] == -1));
|
|
if(j == 0) {
|
|
color = connect_color;
|
|
} else if(j == 1) {
|
|
color = uncon_1_color;
|
|
} else if(j == 2) {
|
|
color = uncon_2_color;
|
|
} else {
|
|
color = uncon_3_color;
|
|
}
|
|
fprintf(fp, "%f %f %f %1.1f %1.1f %1.1f 1\n",
|
|
stl->facet_start[i].vertex[0].x,
|
|
stl->facet_start[i].vertex[0].y,
|
|
stl->facet_start[i].vertex[0].z, color.x, color.y, color.z);
|
|
fprintf(fp, "%f %f %f %1.1f %1.1f %1.1f 1\n",
|
|
stl->facet_start[i].vertex[1].x,
|
|
stl->facet_start[i].vertex[1].y,
|
|
stl->facet_start[i].vertex[1].z, color.x, color.y, color.z);
|
|
fprintf(fp, "%f %f %f %1.1f %1.1f %1.1f 1\n",
|
|
stl->facet_start[i].vertex[2].x,
|
|
stl->facet_start[i].vertex[2].y,
|
|
stl->facet_start[i].vertex[2].z, color.x, color.y, color.z);
|
|
fprintf(fp, "%f %f %f %1.1f %1.1f %1.1f 1\n",
|
|
stl->facet_start[i].vertex[2].x,
|
|
stl->facet_start[i].vertex[2].y,
|
|
stl->facet_start[i].vertex[2].z, color.x, color.y, color.z);
|
|
}
|
|
fclose(fp);
|
|
}
|
|
|
|
void
|
|
stl_write_dxf(stl_file *stl, char *file, char *label) {
|
|
int i;
|
|
FILE *fp;
|
|
char *error_msg;
|
|
|
|
if (stl->error) return;
|
|
|
|
/* Open the file */
|
|
fp = fopen(file, "w");
|
|
if(fp == NULL) {
|
|
error_msg = (char*)
|
|
malloc(81 + strlen(file)); /* Allow 80 chars+file size for message */
|
|
sprintf(error_msg, "stl_write_ascii: Couldn't open %s for writing",
|
|
file);
|
|
perror(error_msg);
|
|
free(error_msg);
|
|
stl->error = 1;
|
|
return;
|
|
}
|
|
|
|
fprintf(fp, "999\n%s\n", label);
|
|
fprintf(fp, "0\nSECTION\n2\nHEADER\n0\nENDSEC\n");
|
|
fprintf(fp, "0\nSECTION\n2\nTABLES\n0\nTABLE\n2\nLAYER\n70\n1\n\
|
|
0\nLAYER\n2\n0\n70\n0\n62\n7\n6\nCONTINUOUS\n0\nENDTAB\n0\nENDSEC\n");
|
|
fprintf(fp, "0\nSECTION\n2\nBLOCKS\n0\nENDSEC\n");
|
|
|
|
fprintf(fp, "0\nSECTION\n2\nENTITIES\n");
|
|
|
|
for(i = 0; i < stl->stats.number_of_facets; i++) {
|
|
fprintf(fp, "0\n3DFACE\n8\n0\n");
|
|
fprintf(fp, "10\n%f\n20\n%f\n30\n%f\n",
|
|
stl->facet_start[i].vertex[0].x, stl->facet_start[i].vertex[0].y,
|
|
stl->facet_start[i].vertex[0].z);
|
|
fprintf(fp, "11\n%f\n21\n%f\n31\n%f\n",
|
|
stl->facet_start[i].vertex[1].x, stl->facet_start[i].vertex[1].y,
|
|
stl->facet_start[i].vertex[1].z);
|
|
fprintf(fp, "12\n%f\n22\n%f\n32\n%f\n",
|
|
stl->facet_start[i].vertex[2].x, stl->facet_start[i].vertex[2].y,
|
|
stl->facet_start[i].vertex[2].z);
|
|
fprintf(fp, "13\n%f\n23\n%f\n33\n%f\n",
|
|
stl->facet_start[i].vertex[2].x, stl->facet_start[i].vertex[2].y,
|
|
stl->facet_start[i].vertex[2].z);
|
|
}
|
|
|
|
fprintf(fp, "0\nENDSEC\n0\nEOF\n");
|
|
|
|
fclose(fp);
|
|
}
|
|
|
|
void
|
|
stl_clear_error(stl_file *stl) {
|
|
stl->error = 0;
|
|
}
|
|
|
|
void
|
|
stl_exit_on_error(stl_file *stl) {
|
|
if (!stl->error) return;
|
|
stl->error = 0;
|
|
stl_close(stl);
|
|
exit(1);
|
|
}
|
|
|
|
int
|
|
stl_get_error(stl_file *stl) {
|
|
return stl->error;
|
|
}
|