git.rot13.org Git - simavr/blob - examples/shared/libc3/src/c3geometry.c

   1 /*
   2         c3geometry.c
   3
   4         Copyright 2008-2012 Michel Pollet <buserror@gmail.com>
   5
   6         This file is part of libc3.
   7
   8         libc3 is free software: you can redistribute it and/or modify
   9         it under the terms of the GNU General Public License as published by
  10         the Free Software Foundation, either version 3 of the License, or
  11         (at your option) any later version.
  12
  13         libc3 is distributed in the hope that it will be useful,
  14         but WITHOUT ANY WARRANTY; without even the implied warranty of
  15         MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16         GNU General Public License for more details.
  17
  18         You should have received a copy of the GNU General Public License
  19         along with libc3.  If not, see <http://www.gnu.org/licenses/>.
  20  */
  21
  22
  23 #include <stdio.h>
  24 #include <math.h>
  25 #include "c3object.h"
  26 #include "c3context.h"
  27 #include "c3driver_geometry.h"
  28 #include "c3driver_context.h"
  29
  30 static void
  31 _c3geometry_dispose(
  32                 c3geometry_p  g,
  33                 const struct c3driver_geometry_t *d)
  34 {
  35         /*
  36          * If we're still attached to an object, detach
  37          */
  38         if (g->object) {
  39                 for (int oi = 0; oi < g->object->geometry.count; oi++)
  40                         if (g->object->geometry.e[oi] == g) {
  41                                 c3geometry_array_delete(&g->object->geometry, oi, 1);
  42                                 c3object_set_dirty(g->object, true);
  43                                 break;
  44                         }
  45                 g->object = NULL;
  46         }
  47         /* let the context driver have a chance to clear it's own stuff */
  48         if (g->object && g->object->context)
  49                 C3_DRIVER(g->object->context, geometry_dispose, g);
  50         str_free(g->name);
  51         c3vertex_array_free(&g->vertice);
  52         c3tex_array_free(&g->textures);
  53         c3colorf_array_free(&g->colorf);
  54         free(g);
  55 //      C3_DRIVER_INHERITED(g, d, dispose);
  56 }
  57
  58 static void
  59 _c3geometry_project(
  60                 c3geometry_p g,
  61                 const struct c3driver_geometry_t *d,
  62                 c3mat4p m)
  63 {
  64         if (g->vertice.count) {
  65                 for (int vi = 0; vi < g->vertice.count; vi++) {
  66                         c3vec3 v = c3mat4_mulv3(m, g->vertice.e[vi]);
  67                         if (vi == 0)
  68                                 g->bbox.min = g->bbox.max = v;
  69                         else {
  70                                 g->bbox.max = c3vec3_min(g->bbox.min, v);
  71                                 g->bbox.max = c3vec3_max(g->bbox.max, v);
  72                         }
  73                 }
  74         } else
  75                 g->bbox.min = g->bbox.max = c3vec3f(0,0,0);
  76
  77         if (g->object && g->object->context)
  78                 C3_DRIVER(g->object->context, geometry_project, g, m);
  79         g->dirty = 0;
  80 //      C3_DRIVER_INHERITED(g, d, project);
  81 }
  82
  83 static void
  84 _c3geometry_draw(
  85                 c3geometry_p g,
  86                 const struct c3driver_geometry_t *d)
  87 {
  88         if (g->object && g->object->context)
  89                 C3_DRIVER(g->object->context, geometry_draw, g);
  90 //      C3_DRIVER_INHERITED(g, d, draw);
  91 }
  92
  93 const  c3driver_geometry_t c3geometry_driver = {
  94         .dispose = _c3geometry_dispose,
  95         .project = _c3geometry_project,
  96         .draw = _c3geometry_draw,
  97 };
  98
  99 c3geometry_p
 100 c3geometry_new(
 101                 c3geometry_type_t type,
 102                 c3object_p o /* = NULL */)
 103 {
 104         c3geometry_p res = malloc(sizeof(c3geometry_t));
 105         return c3geometry_init(res, type, o);
 106 }
 107
 108 c3geometry_p
 109 c3geometry_init(
 110                 c3geometry_p g,
 111                 c3geometry_type_t type,
 112                 struct c3object_t * o /* = NULL */)
 113 {
 114         memset(g, 0, sizeof(*g));
 115         static const c3driver_geometry_t * list[] = {
 116                         &c3geometry_driver, NULL,
 117         };
 118         g->driver = list;
 119         g->type = type;
 120         g->dirty = 1;
 121         if (o)
 122                 c3object_add_geometry(o, g);
 123         return g;
 124 }
 125
 126 c3driver_geometry_p
 127 c3geometry_get_custom(
 128                 c3geometry_p g )
 129 {
 130         if (g->custom)
 131                 return (c3driver_geometry_p)g->driver[0];
 132         int cnt = 0;
 133         for (int di = 0; g->driver[di]; di++)
 134                 cnt++;
 135         c3driver_geometry_p * newd = malloc(sizeof(c3driver_geometry_p) * (cnt + 2));
 136         memcpy(&newd[1], g->driver, (cnt + 1) * sizeof(c3driver_geometry_p));
 137         newd[0] = malloc(sizeof(c3driver_geometry_t));
 138         memset(newd[0], 0, sizeof(c3driver_geometry_t));
 139         g->custom = 1;
 140         g->driver = (typeof(g->driver))newd;
 141         return newd[0];
 142 }
 143
 144 void
 145 c3geometry_dispose(
 146                 c3geometry_p g)
 147 {
 148         C3_DRIVER(g, dispose);
 149 }
 150
 151 void
 152 c3geometry_project(
 153                 c3geometry_p g,
 154                 c3mat4p m)
 155 {
 156         if (!g->dirty)
 157                 return;
 158         C3_DRIVER(g, project, m);
 159 }
 160
 161 void
 162 c3geometry_draw(
 163                 c3geometry_p g )
 164 {
 165         C3_DRIVER(g, draw);
 166 }
 167
 168 void
 169 c3geometry_factor(
 170                 c3geometry_p g,
 171                 c3f tolerance,
 172                 c3f normaltolerance)
 173 {
 174         printf("%s Start geometry has %d vertices and %d indexes\n", __func__,
 175                         g->vertice.count, g->indices.count);
 176         printf("%s Start geometry has %d normals and %d tex\n", __func__,
 177                         g->normals.count, g->textures.count);
 178
 179         c3f tolerance2 = tolerance * tolerance;
 180
 181         int in_index = g->indices.count;
 182         int vcount = in_index ? in_index : g->vertice.count;
 183         int input = 0;
 184         int output = 0;
 185         g->indices.count = 0;
 186         while (input < vcount) {
 187                 int current = in_index ? g->indices.e[input] : input;
 188                 c3vec3 v = g->vertice.e[current];
 189                 c3vec3 n = g->normals.count ? g->normals.e[current] : c3vec3f(0,0,0);
 190                 c3vec3 np = c3vec3_polar(n);    // normal in polar coord
 191
 192                 int oi = -1;
 193                 for (int ci = 0; ci < output && oi == -1; ci++)
 194                         if (c3vec3_length2(c3vec3_sub(g->vertice.e[ci], v)) < tolerance2) {
 195                                 if (g->normals.count) {
 196                                         c3vec3 nc = g->normals.e[ci];
 197                                         c3vec3 pc = c3vec3_polar(nc);
 198
 199                                         c3vec3 d = c3vec3_sub(np, pc);
 200                                         while (d.n[0] <= -M_PI) d.n[0] += (2*M_PI);
 201                                         while (d.n[1] <= -M_PI) d.n[1] += (2*M_PI);
 202
 203                                         if (fabs(d.n[0]) < normaltolerance &&
 204                                                         fabs(d.n[1]) < normaltolerance) {
 205                                                 oi = ci;
 206                                                 // replace the compared normal with the 'merged' one
 207                                                 // that should hopefully trim it to the right direction
 208                                                 // somehow. Not perfect obviously
 209                                                 g->normals.e[ci] = c3vec3_add(n, nc);
 210                                         }
 211                                 } else
 212                                         oi = ci;
 213                         }
 214                 if (oi == -1) {
 215                         oi = output;
 216                         g->vertice.e[output] = g->vertice.e[current];
 217                         if (g->textures.count)
 218                                 g->textures.e[output] = g->textures.e[current];
 219                         if (g->normals.count)
 220                                 g->normals.e[output] = n;
 221                         if (g->colorf.count)
 222                                 g->colorf.e[output] = g->colorf.e[current];
 223                         output++;
 224                 }
 225                 c3indices_array_add(&g->indices, oi);
 226                 input++;
 227         }
 228         g->vertice.count = output;
 229         c3vertex_array_realloc(&g->vertice, output);
 230         if (g->textures.count) {
 231                 g->textures.count = output;
 232                 c3tex_array_realloc(&g->textures, output);
 233         }
 234         if (g->normals.count) {
 235                 g->normals.count = output;
 236                 c3vertex_array_realloc(&g->normals, output);
 237                 for (int ni = 0; ni < output; ni++)
 238                         g->normals.e[ni] = c3vec3_normalize(g->normals.e[ni]);
 239         }
 240         if (g->colorf.count) {
 241                 g->colorf.count = output;
 242                 c3colorf_array_realloc(&g->colorf, output);
 243         }
 244         g->dirty = 1;
 245
 246         printf("%s end geometry has %d vertices and %d indexes\n",  __func__,
 247                         g->vertice.count, g->indices.count);
 248 }