2015-02-14 23:32:58 +01:00
|
|
|
/** \file
|
|
|
|
* STL file format.
|
|
|
|
*
|
|
|
|
* Parse an STL file into an easily traversed structure.
|
|
|
|
*/
|
|
|
|
#ifndef _stl3d_h_
|
|
|
|
#define _stl3d_h_
|
|
|
|
|
|
|
|
#include "v3.h"
|
|
|
|
|
|
|
|
typedef struct stl_vertex stl_vertex_t;
|
|
|
|
typedef struct stl_face stl_face_t;
|
|
|
|
|
|
|
|
#define STL_MAX_FACES 64
|
|
|
|
|
|
|
|
struct stl_vertex {
|
|
|
|
v3_t p;
|
|
|
|
int num_face;
|
|
|
|
stl_face_t *face[STL_MAX_FACES];
|
2015-02-14 23:59:08 +01:00
|
|
|
int face_num[STL_MAX_FACES]; // which vertex on the face
|
2015-02-14 23:32:58 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
struct stl_face
|
|
|
|
{
|
|
|
|
stl_vertex_t * vertex[3];
|
2015-02-15 01:01:12 +01:00
|
|
|
stl_face_t * face[3];
|
|
|
|
double angle[3];
|
2015-02-14 23:32:58 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
typedef struct
|
|
|
|
{
|
|
|
|
int num_vertex;
|
|
|
|
stl_vertex_t * vertex;
|
|
|
|
|
|
|
|
int num_face;
|
|
|
|
stl_face_t * face;
|
|
|
|
} stl_3d_t;
|
|
|
|
|
|
|
|
|
|
|
|
stl_3d_t *
|
|
|
|
stl_3d_parse(
|
|
|
|
int fd
|
|
|
|
);
|
|
|
|
|
2015-02-15 20:35:42 +01:00
|
|
|
|
|
|
|
/** Generate the list of vertices that are coplanar given a starting
|
|
|
|
* vertex in the stl file.
|
|
|
|
*
|
|
|
|
* vertex_list should have enough space to contain at least as many
|
|
|
|
* vertices as in the stl file.
|
|
|
|
*
|
|
|
|
* if face_used is not null it will be populated with which faces
|
|
|
|
* have been traversed during the search. it should have enough size
|
|
|
|
* to contain all of the faces in the file.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
stl_trace_face(
|
|
|
|
const stl_3d_t * const stl,
|
|
|
|
const stl_face_t * const f_start,
|
|
|
|
const stl_vertex_t ** vertex_list,
|
|
|
|
int * const face_used
|
|
|
|
);
|
|
|
|
|
|
|
|
|
2015-02-14 23:32:58 +01:00
|
|
|
#endif
|