1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
|
/*
* Copyright 2011 Vincent Sanders <vince@kyllikki.org>
*
* Licenced under the MIT License,
* http://www.opensource.org/licenses/mit-license.php
*
* This file is part of png23d.
*
* mesh routines header.
*/
#ifndef PNG23D_MESH_H
#define PNG23D_MESH_H 1
/* Debug dump figure width */
#define DUMP_SVG_SIZE 500
#define SVGPX(loc) ( (loc) ) * (DUMP_SVG_SIZE / mesh->width)
#define SVGPY(loc) (mesh->height - SVGPX(loc))
/** A 3d point */
typedef struct pnt {
float x;
float y;
float z;
} pnt;
/** A indexed vertex */
typedef unsigned int idxvtx;
/** facet
*
* A facet is a triangle with its normal
*/
struct facet {
pnt n; /**< surface normal */
pnt v[3]; /**< triangle vertices */
idxvtx i[3]; /** triangle indexed vertices */
};
/** An indexed vertex within the mesh. */
struct vertex {
struct pnt pnt; /**< the location of this vertex */
unsigned int fcount; /**< the number of facets that use this vertex */
struct facet *facets[]; /**< facets that use this vertex */
};
/** A 3d triangle mesh. */
struct mesh {
/* facets */
struct facet *f; /**< array of facets */
uint32_t fcount; /**< number of valid facets in the array */
uint32_t falloc; /**< numer of facets currently allocated */
/* indexed vertices */
struct vertex *v; /**< array of vertices */
idxvtx vcount; /**< number of valid vertices in the array */
idxvtx valloc; /**< numer of vertices currently allocated */
/* mesh parameters */
uint32_t width; /**< conversion source width */
uint32_t height; /**< conversion source height */
/* indexing parameters */
unsigned int vertex_fcount; /* number of facets a vertex can belong to */
/* bloom filter */
uint8_t *bloom_table; /**< table for bloom filter */
unsigned int bloom_table_entries; /**< Number of entries (bits) it bloom */
/** number of times the hash is applied with a differnt salt value
* (sometimes referred to as the number of functions)
*/
unsigned int bloom_iterations;
/* stats and meta info */
uint32_t cubes; /**< number of cubes with at least one face */
unsigned int bloom_miss; /**< number of times the bloom filter missed */
unsigned int find_count; /**< number of vertex lookups */
int64_t find_cost; /**< number of comparisons in vertex lookups */
/* debug */
int dumpno;
FILE *dumpfile;
};
/* create new empty mesh */
struct mesh *new_mesh(void);
/** free mesh and all resources it holds */
void free_mesh(struct mesh *mesh);
/** initialise debugging on mesh */
void debug_mesh_init(struct mesh *mesh, const char* filename);
/** calculate vertex location from its index */
static inline struct vertex *
vertex_from_index(struct mesh *mesh, idxvtx ivtx)
{
uint8_t *vtx = (uint8_t *)mesh->v +
(ivtx *
(sizeof(struct vertex) +
(sizeof(struct facet*) * mesh->vertex_fcount)));
return (struct vertex *)vtx;
};
#endif
|
