4 A GNU/Linux-first Source1 Hammer replacement
5 built with Blender, for mapmakers
7 Copyright (C) 2022 Harry Godden (hgn)
10 - Brush decomposition into convex pieces for well defined geometry
11 - Freely form displacements without limits
12 - Build your entire map in Blender
13 - Compile models and model groups easily
14 - It runs at an ok speed!
15 - Light patch BSP files; remove unwanted realtime effects
16 - Fastest VTF compressor (thanks to Richgel999 and stb)
20 File/folder Lang Purpose
22 __init__.py Python Blender plugin interface
25 cxr.h C Heavy lifting; brush decomp, mesh processing
26 cxr_math.h C Vector maths and other handy things
27 cxr_mem.h C Automatic resizing buffers
28 libcxr.c C Compile as SO
31 nbvtf.h C VTF processing interface
32 librgcx.h C++ Rich Geldreich's DXT1/DXT5 compressors
33 stb/ C Sean Barrets image I/O
49 #define CXR_EPSILON 0.001
50 #define CXR_PLANE_SIMILARITY_MAX 0.998
51 #define CXR_BIG_NUMBER 1e300
52 #define CXR_INTERIOR_ANGLE_MAX 0.998
55 #define CXR_IMPLEMENTATION
74 typedef unsigned int uint
;
76 typedef double v2f
[2];
77 typedef double v3f
[3];
78 typedef double v4f
[4];
86 typedef struct cxr_world cxr_world
;
87 typedef struct cxr_solid cxr_solid
;
89 typedef struct cxr_mesh cxr_mesh
;
90 typedef struct cxr_edge cxr_edge
;
91 typedef struct cxr_polygon cxr_polygon
;
92 typedef struct cxr_static_mesh cxr_static_mesh
;
93 typedef struct cxr_loop cxr_loop
;
94 typedef struct cxr_static_loop cxr_static_loop
;
95 typedef struct cxr_material cxr_material
;
96 typedef struct cxr_tri_mesh cxr_tri_mesh
;
98 #ifdef CXR_VALVE_MAP_FILE
99 typedef struct cxr_vdf cxr_vdf
;
100 typedef struct cxr_texinfo cxr_texinfo
;
101 typedef struct cxr_vmf_context cxr_vmf_context
;
102 #endif /* CXR_VALVE_MAP_FILE */
108 /* Main convexer algorithms */
109 /* Convex decomp from mesh */
110 CXR_API cxr_world
*cxr_decompose( cxr_static_mesh
*src
);
111 CXR_API
void cxr_free_world( cxr_world
*world
);
112 CXR_API cxr_tri_mesh
*cxr_world_preview( cxr_world
*world
);
113 CXR_API
void cxr_free_tri_mesh( cxr_tri_mesh
*mesh
);
115 #ifdef CXR_VALVE_MAP_FILE
117 CXR_API
void cxr_begin_vmf( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
);
118 CXR_API
void cxr_vmf_begin_entities( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
);
119 CXR_API
void cxr_push_world_vmf(
120 cxr_world
*world
, cxr_vmf_context
*ctx
, cxr_vdf
*vdf
);
121 CXR_API
void cxr_end_vmf( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
);
124 CXR_API cxr_vdf
*cxr_vdf_open( const char *path
);
125 CXR_API
void cxr_vdf_close( cxr_vdf
*vdf
);
126 CXR_API
void cxr_vdf_put( cxr_vdf
*vdf
, const char *str
);
127 CXR_API
void cxr_vdf_node( cxr_vdf
*vdf
, const char *str
);
128 CXR_API
void cxr_vdf_edon( cxr_vdf
*vdf
);
129 CXR_API
void cxr_vdf_kv( cxr_vdf
*vdf
, const char *strk
, const char *strv
);
132 CXR_API
int cxr_lightpatch_bsp( const char *path
);
133 #endif /* CXR_VALVE_MAP_FILE */
137 CXR_API
void cxr_set_log_function( void (*func
)(const char *str
) );
138 CXR_API
void cxr_set_line_function( void (*func
)(v3f p0
, v3f p1
, v4f colour
) );
139 CXR_API
void cxr_write_test_data( cxr_static_mesh
*src
);
140 #endif /* CXR_DEBUG */
142 struct cxr_static_mesh
153 struct cxr_static_loop
163 i32 loop_start
, loop_total
;
166 i32 material_id
; /* -1: interior material (nodraw) */
205 cxr_material
*materials
;
216 *p_abverts
; /* This data is stored externally because the data is often
217 shared between solids. */
219 /* Valid when update() is called on this mesh,
220 * Invalid when data is appended to them */
221 struct cxr_edge
*edges
;
222 struct cxr_polygon
*polys
;
223 struct cxr_loop
*loops
;
226 /* Simple mesh type mainly for debugging */
236 #ifdef CXR_VALVE_MAP_FILE
245 * Simplified VDF writing interface. No allocations or nodes, just write to file
253 struct cxr_vmf_context
261 /* Transform settings */
271 #endif /* CXR_VALVE_MAP_FILE */
276 k_soliderr_non_manifold
,
277 k_soliderr_bad_manifold
,
278 k_soliderr_no_solids
,
279 k_soliderr_degenerate_implicit
284 * -----------------------------------------------------------------------------
286 #ifdef CXR_IMPLEMENTATION
288 const char *cxr_build_time
= __DATE__
" @" __TIME__
;
291 static void (*cxr_log_func
)(const char *str
);
292 static void (*cxr_line_func
)( v3f p0
, v3f p1
, v4f colour
);
294 static int cxr_range(int x
, int bound
)
297 x
+= bound
* (x
/bound
+ 1);
303 * This should be called after appending any data to those buffers
305 static void cxr_mesh_update( cxr_mesh
*mesh
)
307 mesh
->edges
= cxr_ab_ptr(&mesh
->abedges
, 0);
308 mesh
->polys
= cxr_ab_ptr(&mesh
->abpolys
, 0);
309 mesh
->loops
= cxr_ab_ptr(&mesh
->abloops
, 0);
312 static v4f colours_random
[] =
314 { 0.863, 0.078, 0.235, 0.4 },
315 { 0.000, 0.980, 0.604, 0.4 },
316 { 0.118, 0.565, 1.000, 0.4 },
317 { 0.855, 0.439, 0.839, 0.4 },
318 { 0.824, 0.412, 0.118, 0.4 },
319 { 0.125, 0.698, 0.667, 0.4 },
320 { 0.541, 0.169, 0.886, 0.4 },
321 { 1.000, 0.843, 0.000, 0.4 }
324 static v4f colours_solids
[] =
326 { 100, 143, 255, 200 },
327 { 120, 94, 240, 200 },
328 { 220, 38, 127, 200 },
333 static v4f colour_entity
= { 37, 241, 122, 255 };
334 static v4f colour_displacement_solid
= { 146, 146, 146, 120 };
335 static v4f colour_error
= { 1.0f
, 0.0f
, 0.0f
, 1.0f
};
336 static v4f colour_face_graph
= { 1.0f
, 1.0f
, 1.0f
, 0.03f
};
337 static v4f colour_success
= { 0.0f
, 1.0f
, 0.0f
, 1.0f
};
339 static void value_random(int n
, v4f colour
)
341 double val
= cxr_range(n
,8);
345 v3_muls( colour
, val
, colour
);
348 static void colour_random_brush(int n
, v4f colour
)
352 int colour_n
= cxr_range( n
, 5 );
353 v4_muls( colours_solids
[ colour_n
], 1.0/255.0, colour
);
354 value_random( value_n
, colour
);
356 int colour_n
= cxr_range( n
, 8 );
357 v4_copy( colours_random
[ colour_n
], colour
);
362 * Debugging and diagnostic utilities
363 * -----------------------------------------------------------------------------
368 static void cxr_log( const char *fmt
, ... )
373 va_start( args
, fmt
);
374 vsnprintf( buf
, sizeof(buf
)-1, fmt
, args
);
383 static void cxr_debug_line( v3f p0
, v3f p1
, v4f colour
)
386 cxr_line_func( p0
, p1
, colour
);
389 static void cxr_debug_box( v3f p0
, double sz
, v4f colour
)
393 v3_add(p0
, (v3f
){-sz
,-sz
,-sz
}, a
);
394 v3_add(p0
, (v3f
){-sz
, sz
,-sz
}, b
);
395 v3_add(p0
, (v3f
){ sz
, sz
,-sz
}, c
);
396 v3_add(p0
, (v3f
){ sz
,-sz
,-sz
}, d
);
397 v3_add(p0
, (v3f
){-sz
,-sz
,sz
}, a1
);
398 v3_add(p0
, (v3f
){-sz
, sz
,sz
}, b1
);
399 v3_add(p0
, (v3f
){ sz
, sz
,sz
}, c1
);
400 v3_add(p0
, (v3f
){ sz
,-sz
,sz
}, d1
);
402 cxr_debug_line( a
,b
, colour
);
403 cxr_debug_line( b
,c
, colour
);
404 cxr_debug_line( c
,d
, colour
);
405 cxr_debug_line( d
,a
, colour
);
406 cxr_debug_line( a1
,b1
, colour
);
407 cxr_debug_line( b1
,c1
, colour
);
408 cxr_debug_line( c1
,d1
, colour
);
409 cxr_debug_line( d1
,a1
, colour
);
410 cxr_debug_line( a
,a1
, colour
);
411 cxr_debug_line( b
,b1
, colour
);
412 cxr_debug_line( c
,c1
, colour
);
413 cxr_debug_line( d
,d1
, colour
);
417 * Draw arrow with the tips oriented along normal
419 static void cxr_debug_arrow( v3f p0
, v3f p1
, v3f normal
, double sz
, v4f colour
)
421 v3f dir
, tan
, p2
, p3
;
425 v3_cross(dir
,normal
,tan
);
426 v3_muladds( p1
,dir
, -sz
, p2
);
427 v3_muladds( p2
,tan
,sz
,p3
);
428 cxr_debug_line( p1
, p3
, colour
);
429 v3_muladds( p2
,tan
,-sz
,p3
);
430 cxr_debug_line( p1
, p3
, colour
);
431 cxr_debug_line( p0
, p1
, colour
);
435 * Draw arrows CCW around polygon, draw normal vector from center
437 static void cxr_debug_poly( cxr_mesh
*mesh
, cxr_polygon
*poly
, v4f colour
)
439 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
441 for( int i
=0; i
<poly
->loop_total
; i
++ )
443 int lp0
= poly
->loop_start
+i
,
444 lp1
= poly
->loop_start
+cxr_range(i
+1,poly
->loop_total
);
446 int i0
= mesh
->loops
[ lp0
].index
,
447 i1
= mesh
->loops
[ lp1
].index
;
451 v3_lerp( verts
[i0
], poly
->center
, 0.0075, p0
);
452 v3_lerp( verts
[i1
], poly
->center
, 0.0075, p1
);
453 v3_muladds( p0
, poly
->normal
, 0.01, p0
);
454 v3_muladds( p1
, poly
->normal
, 0.01, p1
);
456 cxr_debug_arrow( p0
, p1
, poly
->normal
, 0.05, colour
);
460 v3_muladds( poly
->center
, poly
->normal
, 0.3, nrm0
);
462 cxr_debug_line( poly
->center
, nrm0
, colour
);
465 static void cxr_debug_mesh(cxr_mesh
*mesh
, v4f colour
)
467 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
469 cxr_polygon
*poly
= &mesh
->polys
[i
];
470 cxr_debug_poly( mesh
, poly
, colour
);
474 CXR_API
void cxr_write_test_data( cxr_static_mesh
*src
)
477 "/home/harry/Documents/blender_addons_remote/addons/convexer/cxr/solid.h",
480 fprintf( fp
, "v3f test_verts[] = {\n" );
481 for( int i
=0; i
<src
->vertex_count
; i
++ )
483 fprintf( fp
, " { %f, %f, %f },\n",
486 src
->vertices
[i
][2] );
488 fprintf( fp
, "};\n" );
490 fprintf( fp
, "struct cxr_static_loop test_loops[] = {\n" );
491 for( int i
=0; i
<src
->loop_count
; i
++ )
493 fprintf( fp
, " {%d, %d},\n",
495 src
->loops
[i
].edge_index
);
497 fprintf( fp
, "};\n" );
499 fprintf( fp
, "struct cxr_polygon test_polys[] = {\n" );
500 for( int i
=0; i
<src
->poly_count
; i
++ )
502 fprintf( fp
, " {%d, %d, {%f, %f, %f}, {%f, %f, %f}},\n",
503 src
->polys
[i
].loop_start
,
504 src
->polys
[i
].loop_total
,
505 src
->polys
[i
].normal
[0],
506 src
->polys
[i
].normal
[1],
507 src
->polys
[i
].normal
[2],
508 src
->polys
[i
].center
[0],
509 src
->polys
[i
].center
[1],
510 src
->polys
[i
].center
[2] );
512 fprintf( fp
, "};\n" );
514 fprintf( fp
, "struct cxr_edge test_edges[] = {\n" );
515 for( int i
=0; i
<src
->edge_count
; i
++ )
517 fprintf( fp
, " {%d, %d, %d},\n",
520 src
->edges
[i
].freestyle
523 fprintf( fp
, "};\n" );
525 fprintf( fp
, "struct cxr_static_mesh test_mesh = {\n" );
526 fprintf( fp
, " .vertices = test_verts,\n" );
527 fprintf( fp
, " .loops = test_loops,\n" );
528 fprintf( fp
, " .edges = test_edges,\n" );
529 fprintf( fp
, " .polys = test_polys,\n" );
530 fprintf( fp
, " .poly_count=%d,\n", src
->poly_count
);
531 fprintf( fp
, " .vertex_count=%d,\n", src
->vertex_count
);
532 fprintf( fp
, " .edge_count=%d,\n",src
->edge_count
);
533 fprintf( fp
, " .loop_count=%d\n", src
->loop_count
);
534 fprintf( fp
, "};\n" );
539 CXR_API
void cxr_set_log_function( void (*func
)(const char *str
) )
544 CXR_API
void cxr_set_line_function( void (*func
)(v3f p0
, v3f p1
, v4f colour
) )
546 cxr_line_func
= func
;
549 #endif /* CXR_DEBUG */
553 * abverts is a pointer to an existing vertex buffer
555 static cxr_mesh
*cxr_alloc_mesh( int edge_count
, int loop_count
, int poly_count
,
558 cxr_mesh
*mesh
= malloc(sizeof(cxr_mesh
));
559 cxr_ab_init(&mesh
->abedges
, sizeof(cxr_edge
), edge_count
);
560 cxr_ab_init(&mesh
->abloops
, sizeof(cxr_loop
), loop_count
);
561 cxr_ab_init(&mesh
->abpolys
, sizeof(cxr_polygon
), poly_count
);
562 mesh
->p_abverts
= abverts
;
564 cxr_mesh_update( mesh
);
569 static void cxr_free_mesh( cxr_mesh
*mesh
)
571 cxr_ab_free(&mesh
->abedges
);
572 cxr_ab_free(&mesh
->abloops
);
573 cxr_ab_free(&mesh
->abpolys
);
578 * Rebuilds edge data for mesh (useful to get rid of orphaned edges)
580 static void cxr_mesh_clean_edges( cxr_mesh
*mesh
)
582 cxr_abuffer new_edges
;
583 cxr_ab_init( &new_edges
, sizeof(cxr_edge
), mesh
->abedges
.count
);
585 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
587 cxr_polygon
*poly
= &mesh
->polys
[i
];
588 for( int j
=0; j
<poly
->loop_total
; j
++ )
591 *lp0
= &mesh
->loops
[poly
->loop_start
+j
],
592 *lp1
= &mesh
->loops
[poly
->loop_start
+cxr_range(j
+1,poly
->loop_total
)];
594 int i0
= cxr_min(lp0
->index
, lp1
->index
),
595 i1
= cxr_max(lp0
->index
, lp1
->index
);
597 /* Check if edge exists before adding */
598 for( int k
=0; k
<new_edges
.count
; k
++ )
600 cxr_edge
*edge
= cxr_ab_ptr(&new_edges
,k
);
602 if( edge
->i0
== i0
&& edge
->i1
== i1
)
605 goto IL_EDGE_CREATED
;
609 int orig_edge_id
= lp0
->edge_index
;
610 lp0
->edge_index
= new_edges
.count
;
612 cxr_edge edge
= { i0
, i1
};
615 * Copy extra information from original edges
618 if( orig_edge_id
< mesh
->abedges
.count
)
620 cxr_edge
*orig_edge
= &mesh
->edges
[ orig_edge_id
];
621 edge
.freestyle
= orig_edge
->freestyle
;
628 cxr_ab_push( &new_edges
, &edge
);
634 cxr_ab_free( &mesh
->abedges
);
635 mesh
->abedges
= new_edges
;
637 cxr_mesh_update( mesh
);
641 * Remove 0-length faces from mesh (we mark them light that for deletion
642 * Remove all unused loops as a result of removing those faces
644 static void cxr_mesh_clean_faces( cxr_mesh
*mesh
)
646 cxr_abuffer loops_new
;
647 cxr_ab_init( &loops_new
, sizeof(cxr_loop
), mesh
->abloops
.count
);
650 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
652 cxr_polygon
*src
= &mesh
->polys
[i
],
653 *dst
= &mesh
->polys
[new_length
];
655 if( src
->loop_total
> 0 )
657 int src_start
= src
->loop_start
,
658 src_total
= src
->loop_total
;
661 dst
->loop_start
= loops_new
.count
;
663 for( int j
=0; j
<src_total
; j
++ )
665 cxr_loop
*loop
= &mesh
->loops
[src_start
+j
],
666 *ldst
= cxr_ab_ptr(&loops_new
,dst
->loop_start
+j
);
668 ldst
->poly_left
= new_length
;
671 loops_new
.count
+= src_total
;
676 cxr_ab_free( &mesh
->abloops
);
677 mesh
->abloops
= loops_new
;
678 mesh
->abpolys
.count
= new_length
;
680 cxr_mesh_update( mesh
);
684 * Links loop's poly_left and poly_right
685 * Does not support more than 2 polys to one edge
687 * Returns 0 if there is non-manifold geomtry (aka: not watertight)
689 static int cxr_mesh_link_loops( cxr_mesh
*mesh
)
691 i32
*polygon_edge_map
= malloc(mesh
->abedges
.count
*2 *sizeof(i32
));
693 for( int i
= 0; i
< mesh
->abedges
.count
*2; i
++ )
694 polygon_edge_map
[i
] = -1;
696 for( int i
= 0; i
< mesh
->abpolys
.count
; i
++ )
698 cxr_polygon
*poly
= &mesh
->polys
[i
];
700 for( int j
= 0; j
< poly
->loop_total
; j
++ )
702 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
705 for( int k
= 0; k
< 2; k
++ )
707 i32
*edge
= &polygon_edge_map
[loop
->edge_index
*2+k
];
717 for( int i
= 0; i
< mesh
->abpolys
.count
; i
++ )
719 cxr_polygon
*poly
= &mesh
->polys
[i
];
721 for( int j
= 0; j
< poly
->loop_total
; j
++ )
723 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
725 i32
*face_map
= &polygon_edge_map
[ loop
->edge_index
*2 ];
727 if( face_map
[0] == loop
->poly_left
) loop
->poly_right
= face_map
[1];
728 else loop
->poly_right
= face_map
[0];
733 for( int i
=0; i
<mesh
->abedges
.count
*2; i
++ )
735 if( polygon_edge_map
[i
] == -1 )
737 free( polygon_edge_map
);
742 free( polygon_edge_map
);
747 * Create new empty polygon with known loop count
748 * Must be filled and completed by the following functions!
750 static int cxr_create_poly( cxr_mesh
*mesh
, int loop_count
)
752 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
757 cxr_log( "tried to add new poly with length %d!\n", loop_count
);
762 cxr_ab_reserve( &mesh
->abpolys
, 1 );
763 cxr_ab_reserve( &mesh
->abloops
, loop_count
);
764 cxr_mesh_update( mesh
);
766 cxr_polygon
*poly
= &mesh
->polys
[ mesh
->abpolys
.count
];
768 poly
->loop_start
= mesh
->abloops
.count
;
769 poly
->loop_total
= 0;
770 poly
->material_id
= -1;
771 v3_zero( poly
->center
);
777 * Add one index to the polygon created by the above function
779 static void cxr_poly_push_index( cxr_mesh
*mesh
, int id
)
781 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
783 int nface_id
= mesh
->abpolys
.count
;
784 cxr_polygon
*poly
= &mesh
->polys
[ nface_id
];
786 cxr_loop
*new_loop
= &mesh
->loops
[ poly
->loop_start
+ poly
->loop_total
];
788 new_loop
->poly_left
= nface_id
;
789 new_loop
->poly_right
= -1;
790 new_loop
->index
= id
;
791 new_loop
->edge_index
= 0;
792 v2_zero(new_loop
->uv
);
794 v3_add( poly
->center
, verts
[new_loop
->index
], poly
->center
);
797 mesh
->abloops
.count
++;
801 * Finalize and commit polygon into mesh
803 static void cxr_poly_finish( cxr_mesh
*mesh
)
805 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
807 int nface_id
= mesh
->abpolys
.count
;
808 cxr_polygon
*poly
= &mesh
->polys
[nface_id
];
810 /* Average center and calc normal */
812 v3_divs( poly
->center
, poly
->loop_total
, poly
->center
);
813 cxr_loop
*lp0
= &mesh
->loops
[ poly
->loop_start
],
814 *lp1
= &mesh
->loops
[ poly
->loop_start
+1 ],
815 *lp2
= &mesh
->loops
[ poly
->loop_start
+2 ];
818 verts
[lp0
->index
], verts
[lp1
->index
], verts
[lp2
->index
], poly
->normal
);
820 mesh
->abpolys
.count
++;
824 * Extract the next island from mesh
826 * Returns NULL if mesh is one contigous object
828 static cxr_mesh
*cxr_pull_island( cxr_mesh
*mesh
)
830 cxr_mesh_link_loops(mesh
);
832 int *island_current
= malloc(mesh
->abpolys
.count
*sizeof(int)),
837 island_current
[0] = 0;
840 last_count
= island_len
;
842 for( int i
=0; i
<island_len
; i
++ )
844 cxr_polygon
*poly
= &mesh
->polys
[ island_current
[i
] ];
846 for( int j
=0; j
<poly
->loop_total
; j
++ )
848 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
850 if( loop
->poly_right
!= -1 )
852 int face_present
= 0;
854 for( int k
=0; k
<island_len
; k
++ )
856 if( island_current
[k
] == loop
->poly_right
)
864 island_current
[ island_len
++ ] = loop
->poly_right
;
869 if( island_len
> last_count
)
872 /* Check for complete object */
873 if( island_len
== mesh
->abpolys
.count
)
875 free( island_current
);
879 for( int i
=0; i
<island_len
; i
++ )
881 cxr_polygon
*poly
= &mesh
->polys
[ island_current
[i
] ];
882 loop_count
+= poly
->loop_total
;
885 /* Create and update meshes */
886 cxr_mesh
*newmesh
= cxr_alloc_mesh( mesh
->abedges
.count
,
891 for( int i
=0; i
<island_len
; i
++ )
893 cxr_polygon
*src
= &mesh
->polys
[ island_current
[i
] ];
894 cxr_polygon
*dst
= cxr_ab_ptr(&newmesh
->abpolys
, i
);
897 dst
->loop_start
= newmesh
->abloops
.count
;
899 for( int j
=0; j
<src
->loop_total
; j
++ )
902 *lsrc
= &mesh
->loops
[ src
->loop_start
+j
],
903 *ldst
= cxr_ab_ptr(&newmesh
->abloops
, dst
->loop_start
+j
);
907 ldst
->poly_right
= -1;
910 newmesh
->abloops
.count
+= src
->loop_total
;
911 src
->loop_total
= -1;
914 newmesh
->abpolys
.count
= island_len
;
915 newmesh
->abedges
.count
= mesh
->abedges
.count
;
916 memcpy( cxr_ab_ptr(&newmesh
->abedges
,0),
918 mesh
->abedges
.count
* sizeof(cxr_edge
));
920 cxr_mesh_clean_faces(mesh
);
921 cxr_mesh_clean_edges(mesh
);
922 cxr_mesh_clean_edges(newmesh
);
924 free( island_current
);
929 * Invalid solid is when there are vertices that are coplanar to a face, but are
930 * outside the polygons edges.
932 static int cxr_valid_solid( cxr_mesh
*mesh
, int *solid
, int len
)
934 v3f
*verts
= cxr_ab_ptr(mesh
->p_abverts
, 0);
936 for( int i
=0; i
<len
; i
++ )
938 cxr_polygon
*polyi
= &mesh
->polys
[ solid
[i
] ];
941 normal_to_plane(polyi
->normal
, polyi
->center
, plane
);
943 for( int j
=0; j
<len
; j
++ )
947 cxr_polygon
*polyj
= &mesh
->polys
[ solid
[j
] ];
949 for( int k
=0; k
<polyj
->loop_total
; k
++ )
951 cxr_loop
*lpj
= &mesh
->loops
[ polyj
->loop_start
+k
];
953 /* Test if the vertex is not referenced by the polygon */
954 for( int l
=0; l
<polyi
->loop_total
; l
++ )
956 cxr_loop
*lpi
= &mesh
->loops
[ polyi
->loop_start
+l
];
958 if( lpi
->index
== lpj
->index
)
962 if( fabs(plane_polarity(plane
, verts
[lpj
->index
])) < 0.001 )
974 * Use when iterating the loops array, to get a unique set of edges
975 * Better than using the edges array and doing many more checks
977 static int cxr_loop_unique_edge( cxr_loop
*lp
)
979 if( lp
->poly_left
> lp
->poly_right
)
986 * Identify edges in the mesh where the two connected face's normals
987 * are opposing eachother (or close to identical)
989 static int *cxr_mesh_reflex_edges( cxr_mesh
*mesh
)
991 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
992 int *edge_tagged
= malloc( mesh
->abedges
.count
* sizeof(int) );
994 for( int i
=0; i
<mesh
->abloops
.count
; i
++ )
996 cxr_loop
*lp
= &mesh
->loops
[i
];
997 if( !cxr_loop_unique_edge( lp
) ) continue;
999 edge_tagged
[lp
->edge_index
] = 0;
1001 cxr_polygon
*polya
= &mesh
->polys
[ lp
->poly_left
],
1002 *polyb
= &mesh
->polys
[ lp
->poly_right
];
1005 normal_to_plane(polyb
->normal
, polyb
->center
, planeb
);
1007 for( int j
=0; j
<polya
->loop_total
; j
++ )
1009 cxr_loop
*lp1
= &mesh
->loops
[ polya
->loop_start
+j
];
1011 if(( plane_polarity( planeb
, verts
[lp1
->index
] ) > 0.001 ) ||
1012 ( v3_dot(polya
->normal
,polyb
->normal
) > CXR_PLANE_SIMILARITY_MAX
))
1014 edge_tagged
[lp
->edge_index
] = 1;
1024 * Same logic as above function except it will apply it to each vertex
1026 static int *cxr_mesh_reflex_vertices( cxr_mesh
*mesh
)
1028 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
1030 int *vertex_tagged
= malloc( mesh
->p_abverts
->count
*sizeof(int) );
1031 int *connected_planes
= malloc( mesh
->abpolys
.count
*sizeof(int) );
1033 for( int i
=0; i
<mesh
->p_abverts
->count
; i
++ )
1036 int num_connected
= 0;
1038 /* Create a list of polygons that refer to this vertex */
1039 for( int j
=0; j
<mesh
->abpolys
.count
; j
++ )
1041 cxr_polygon
*poly
= &mesh
->polys
[j
];
1042 for( int k
=0; k
<poly
->loop_total
; k
++ )
1044 cxr_loop
*loop
= &mesh
->loops
[poly
->loop_start
+k
];
1045 if( loop
->index
== i
)
1047 connected_planes
[num_connected
++] = j
;
1053 /* Check all combinations for a similar normal */
1054 for( int j
=0; j
<num_connected
-1; j
++ )
1056 for( int k
=j
+1; k
<num_connected
; k
++ )
1058 cxr_polygon
*polyj
= &mesh
->polys
[connected_planes
[j
]],
1059 *polyk
= &mesh
->polys
[connected_planes
[k
]];
1061 if( v3_dot(polyj
->normal
,polyk
->normal
) > CXR_PLANE_SIMILARITY_MAX
)
1067 * Check if all connected planes either:
1069 * - Coplanar with it
1071 for( int j
=0; j
<num_connected
; j
++ )
1073 for( int k
=j
+1; k
<num_connected
; k
++ )
1075 cxr_polygon
*jpoly
= &mesh
->polys
[ connected_planes
[j
] ],
1076 *kpoly
= &mesh
->polys
[ connected_planes
[k
] ];
1079 normal_to_plane( kpoly
->normal
, kpoly
->center
, plane
);
1080 for( int l
=0; l
<jpoly
->loop_total
; l
++ )
1082 cxr_loop
*lp
= &mesh
->loops
[ jpoly
->loop_start
+l
];
1084 if( plane_polarity( plane
, verts
[lp
->index
] ) > 0.001 )
1092 vertex_tagged
[i
] = 1;
1095 free( connected_planes
);
1096 return vertex_tagged
;
1100 * Detect if potential future edges create a collision with any of the
1101 * existing edges in the mesh
1103 static int cxr_solid_overlap( cxr_mesh
*mesh
,
1106 int common_edge_index
1108 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
1109 cxr_edge
*common_edge
= &mesh
->edges
[common_edge_index
];
1111 int unique_a
= pa
->loop_total
-2,
1112 unique_b
= pb
->loop_total
-2;
1114 int *unique_verts
= malloc( (unique_a
+unique_b
)*sizeof(int) );
1115 int unique_total
= 0;
1117 for( int j
=0; j
<2; j
++ )
1119 cxr_polygon
*poly
= (cxr_polygon
*[2]){pa
,pb
}[j
];
1121 for( int i
=0; i
<poly
->loop_total
; i
++ )
1123 cxr_loop
*lp
= &mesh
->loops
[poly
->loop_start
+i
];
1125 if( lp
->index
== common_edge
->i0
|| lp
->index
== common_edge
->i1
)
1128 unique_verts
[ unique_total
++ ] = lp
->index
;
1134 for( int i
=0; i
<unique_a
; i
++ )
1136 for( int j
=unique_a
; j
<unique_total
; j
++ )
1138 int i0
= unique_verts
[i
],
1139 i1
= unique_verts
[j
];
1141 for( int k
=0; k
<mesh
->abedges
.count
; k
++ )
1143 cxr_edge
*edge
= &mesh
->edges
[k
];
1145 if( edge
->i0
== i0
|| edge
->i0
== i1
||
1146 edge
->i1
== i0
|| edge
->i1
== i1
) continue;
1148 double *a0
= verts
[i0
],
1150 *b0
= verts
[edge
->i0
],
1151 *b1
= verts
[edge
->i1
];
1153 double dist
= segment_segment_dist( a0
, a1
, b0
, b1
, ca
, cb
);
1157 free( unique_verts
);
1164 free( unique_verts
);
1169 * Creates the 'maximal' solid that originates from this faceid
1171 * Returns the number of faces used
1173 static int cxr_buildsolid(
1180 faces_tagged
[faceid
] = faceid
;
1183 solid
[solid_len
++] = faceid
;
1185 int search_start
= 0;
1190 for( int j
=search_start
; j
<solid_len
; j
++ )
1192 cxr_polygon
*poly
= &mesh
->polys
[ solid
[j
] ];
1194 for( int k
=0; k
<poly
->loop_total
; k
++ )
1196 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+k
];
1197 cxr_edge
*edge
= &mesh
->edges
[ loop
->edge_index
];
1199 if( faces_tagged
[ loop
->poly_right
] == -1 )
1201 if( !reflex_edges
[loop
->edge_index
] )
1203 /* Check for dodgy edges */
1204 cxr_polygon
*newpoly
= &mesh
->polys
[loop
->poly_right
];
1206 if( cxr_solid_overlap(mesh
,poly
,newpoly
,loop
->edge_index
))
1209 /* Looking ahead by one step gives us an early out for invalid
1210 * configurations. This might just all be handled by the new
1211 * edge overlap detector, though.
1213 for( int l
=0; l
< newpoly
->loop_total
; l
++ )
1215 cxr_loop
*lp1
= &mesh
->loops
[ newpoly
->loop_start
+l
];
1216 cxr_polygon
*future_face
= &mesh
->polys
[ lp1
->poly_right
];
1218 if( reflex_edges
[ lp1
->edge_index
]
1219 || lp1
->poly_right
== loop
->poly_right
)
1222 for( int m
=0; m
<solid_len
; m
++ )
1223 if( solid
[m
] == lp1
->poly_right
)
1226 for( int m
=0; m
<solid_len
; m
++ )
1228 cxr_polygon
*polym
= &mesh
->polys
[solid
[m
]];
1229 double pdist
= v3_dot( polym
->normal
,future_face
->normal
);
1231 if( pdist
> CXR_PLANE_SIMILARITY_MAX
)
1238 /* Check for vertices in the new polygon that exist on a current
1239 * plane. This condition is invalid */
1240 solid
[ solid_len
] = loop
->poly_right
;
1242 if( cxr_valid_solid(mesh
,solid
,solid_len
+1 ) )
1244 faces_tagged
[ loop
->poly_right
] = faceid
;
1254 search_start
= solid_len
;
1256 goto search_iterate
;
1263 int start
, count
, edge_count
;
1267 struct temp_manifold
1269 struct manifold_loop
1279 enum manifold_status
1283 k_manifold_fragmented
,
1284 k_manifold_complete
,
1290 * Create polygon from entire manifold structure.
1292 * Must be completely co-planar
1294 static void cxr_create_poly_full( cxr_mesh
*mesh
, struct temp_manifold
*src
)
1296 if( cxr_create_poly( mesh
, src
->loop_count
) )
1298 for( int l
=0; l
<src
->loop_count
; l
++ )
1299 cxr_poly_push_index( mesh
, src
->loops
[ l
].loop
.index
);
1301 cxr_poly_finish( mesh
);
1306 * Links up all edges into a potential new manifold
1308 * The return status can be:
1309 * (err): Critical programming error
1310 * none: No manifold to create
1311 * fragmented: Multiple sections exist, not just one
1312 * complete: Optimial manifold was created
1314 static void cxr_link_manifold(
1316 struct csolid
*solid
,
1318 struct temp_manifold
*manifold
1320 cxr_loop
**edge_list
= malloc( sizeof(*edge_list
) * solid
->edge_count
);
1322 int init_reverse
= 0;
1323 int unique_edge_count
= 0;
1325 /* Gather list of unique edges */
1327 for( int j
=0; j
<solid
->count
; j
++ )
1329 cxr_polygon
*poly
= &mesh
->polys
[ solid_buffer
[solid
->start
+j
] ];
1331 for( int k
=0; k
<poly
->loop_total
; k
++ )
1333 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+k
];
1335 for( int l
=0; l
<unique_edge_count
; l
++ )
1336 if( edge_list
[l
]->edge_index
== loop
->edge_index
)
1339 for( int l
=0; l
<solid
->count
; l
++ )
1340 if( loop
->poly_right
== solid_buffer
[solid
->start
+l
] )
1343 edge_list
[ unique_edge_count
] = loop
;
1345 if( unique_edge_count
== 0 )
1347 cxr_edge
*edgeptr
= &mesh
->edges
[ loop
->edge_index
];
1348 if( edgeptr
->i1
== loop
->index
)
1352 unique_edge_count
++;
1357 if( unique_edge_count
== 0 )
1360 manifold
->status
= k_manifold_none
;
1364 /* Link edges together to form manifold */
1365 manifold
->loops
= malloc( solid
->edge_count
*sizeof(struct manifold_loop
));
1366 manifold
->split_count
= 0;
1367 manifold
->loop_count
= 0;
1369 cxr_edge
*current
= &mesh
->edges
[ edge_list
[0]->edge_index
];
1371 int endpt
= (!init_reverse
)? current
->i0
: current
->i1
,
1373 curface
= edge_list
[0]->poly_left
;
1376 for( int j
=0; j
<unique_edge_count
; j
++ )
1378 cxr_edge
*other
= &mesh
->edges
[ edge_list
[j
]->edge_index
];
1379 if( other
== current
)
1382 if( other
->i0
== endpt
|| other
->i1
== endpt
)
1387 if( other
->i0
== endpt
) endpt
= current
->i1
;
1388 else endpt
= current
->i0
;
1390 struct manifold_loop
*ml
= &manifold
->loops
[ manifold
->loop_count
++ ];
1392 if( curface
==edge_list
[j
]->poly_left
)
1395 manifold
->split_count
++;
1400 ml
->loop
.edge_index
= edge_list
[j
]->edge_index
;
1401 ml
->loop
.poly_left
= edge_list
[j
]->poly_left
;
1402 ml
->loop
.index
= lastpt
;
1403 ml
->loop
.poly_right
= edge_list
[j
]->poly_right
;
1405 curface
= edge_list
[j
]->poly_left
;
1409 if( manifold
->loop_count
< unique_edge_count
)
1410 manifold
->status
= k_manifold_fragmented
;
1412 manifold
->status
= k_manifold_complete
;
1414 goto manifold_complete
;
1417 goto manifold_continue
;
1421 /* Incomplete links */
1422 manifold
->status
= k_manifold_err
;
1431 * Reconstruct implied internal geometry where the manifold doesn't have
1432 * enough information (vertices) to create a full result.
1434 static int cxr_build_implicit_geo( cxr_mesh
*mesh
, int new_polys
, int start
)
1436 for( int i
=0; i
<new_polys
-2; i
++ )
1438 for( int j
=i
+1; j
<new_polys
-1; j
++ )
1440 for( int k
=j
+1; k
<new_polys
; k
++ )
1442 cxr_polygon
*ptri
= &mesh
->polys
[ start
+i
],
1443 *ptrj
= &mesh
->polys
[ start
+j
],
1444 *ptrk
= &mesh
->polys
[ start
+k
];
1446 v4f planei
, planej
, planek
;
1447 normal_to_plane(ptri
->normal
,ptri
->center
,planei
);
1448 normal_to_plane(ptrj
->normal
,ptrj
->center
,planej
);
1449 normal_to_plane(ptrk
->normal
,ptrk
->center
,planek
);
1453 if( plane_intersect(planei
,planej
,planek
,intersect
) )
1455 /* Make sure the point is inside the convex region */
1457 int point_valid
= 1;
1458 for( int l
=0; l
<mesh
->abpolys
.count
; l
++ )
1460 cxr_polygon
*ptrl
= &mesh
->polys
[l
];
1463 normal_to_plane(ptrl
->normal
, ptrl
->center
, planel
);
1465 if( plane_polarity( planel
, intersect
) > 0.01 )
1468 cxr_log( "degen vert, planes %d, %d, %d [max:%d]\n",
1471 cxr_debug_poly( mesh
, ptri
, colours_random
[3] );
1472 cxr_debug_poly( mesh
, ptrj
, colours_random
[1] );
1473 cxr_debug_poly( mesh
, ptrk
, colours_random
[2] );
1480 /* Extend faces to include this vert */
1482 int nvertid
= mesh
->p_abverts
->count
;
1483 cxr_ab_push( mesh
->p_abverts
, intersect
);
1485 ptrj
->loop_start
+= 1;
1486 ptrk
->loop_start
+= 2;
1488 cxr_ab_reserve( &mesh
->abloops
, 3);
1490 int newi
= ptri
->loop_start
+ptri
->loop_total
,
1491 newj
= ptrj
->loop_start
+ptrj
->loop_total
,
1492 newk
= ptrk
->loop_start
+ptrk
->loop_total
;
1495 *lloopi
= cxr_ab_empty_at(&mesh
->abloops
, newi
),
1496 *lloopj
= cxr_ab_empty_at(&mesh
->abloops
, newj
),
1497 *lloopk
= cxr_ab_empty_at(&mesh
->abloops
, newk
);
1499 lloopi
->index
= nvertid
;
1500 lloopi
->edge_index
= 0;
1501 lloopi
->poly_left
= start
+ i
;
1502 lloopi
->poly_right
= -1;
1504 lloopj
->index
= nvertid
;
1505 lloopj
->poly_left
= start
+ j
;
1506 lloopj
->edge_index
= 0;
1507 lloopj
->poly_right
= -1;
1509 lloopk
->index
= nvertid
;
1510 lloopk
->edge_index
= 0;
1511 lloopk
->poly_left
= start
+ k
;
1512 lloopk
->poly_right
= -1;
1514 v2_zero(lloopi
->uv
);
1515 v2_zero(lloopj
->uv
);
1516 v2_zero(lloopk
->uv
);
1518 ptri
->loop_total
++;
1519 ptrj
->loop_total
++;
1520 ptrk
->loop_total
++;
1522 double qi
= 1.0/(double)ptri
->loop_total
,
1523 qj
= 1.0/(double)ptrj
->loop_total
,
1524 qk
= 1.0/(double)ptrk
->loop_total
;
1526 /* Adjust centers of faces */
1527 v3_lerp( ptri
->center
, intersect
, qi
, ptri
->center
);
1528 v3_lerp( ptrj
->center
, intersect
, qj
, ptrj
->center
);
1529 v3_lerp( ptrk
->center
, intersect
, qk
, ptrk
->center
);
1539 * Convexer's main algorithm
1541 * Return the best availible convex solid from mesh, and patch the existing mesh
1542 * to fill the gap where the new mesh left it.
1544 * Returns NULL if shape is already convex or empty.
1545 * This function will not preserve edge data such as freestyle, sharp etc.
1547 static cxr_mesh
*cxr_pull_best_solid(
1549 int preserve_more_edges
,
1550 enum cxr_soliderr
*err
)
1552 *err
= k_soliderr_none
;
1554 if( !cxr_mesh_link_loops(mesh
) )
1557 cxr_log( "non-manifold edges are in the mesh: "
1558 "implicit internal geometry does not have full support\n" );
1560 *err
= k_soliderr_non_manifold
;
1564 int *edge_tagged
= cxr_mesh_reflex_edges( mesh
);
1565 int *vertex_tagged
= cxr_mesh_reflex_vertices( mesh
);
1568 * Connect all marked vertices that share an edge
1571 int *edge_important
= malloc(mesh
->abedges
.count
*sizeof(int));
1572 for( int i
=0; i
< mesh
->abedges
.count
; i
++ )
1573 edge_important
[i
] = 0;
1575 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
1577 cxr_polygon
*poly
= &mesh
->polys
[i
];
1578 int not_tagged
= -1,
1581 for( int j
=0; j
<poly
->loop_total
; j
++ )
1583 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
1585 if( !edge_tagged
[ loop
->edge_index
] )
1587 if( not_tagged
== -1 )
1588 not_tagged
= loop
->edge_index
;
1590 goto edge_unimportant
;
1594 if( not_tagged
!= -1 )
1595 edge_important
[not_tagged
]=1;
1601 * Connect edges where both vertices are reflex, only if we are not
1604 for( int i
=0; i
<mesh
->abedges
.count
; i
++ )
1606 if( edge_important
[i
] && preserve_more_edges
) continue;
1608 cxr_edge
*edge
= &mesh
->edges
[i
];
1609 if( vertex_tagged
[edge
->i0
] && vertex_tagged
[edge
->i1
] )
1613 free( edge_important
);
1615 int *faces_tagged
= malloc(mesh
->abpolys
.count
*sizeof(int));
1616 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
1617 faces_tagged
[i
] = -1;
1619 struct csolid
*candidates
;
1620 int *solid_buffer
= malloc( mesh
->abpolys
.count
*sizeof(int) ),
1621 solid_buffer_len
= 0,
1622 candidate_count
= 0;
1624 candidates
= malloc( mesh
->abpolys
.count
*sizeof(struct csolid
) );
1627 * Create a valid, non-overlapping solid for every face present in the mesh
1629 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
1631 if( faces_tagged
[i
] != -1 ) continue;
1632 faces_tagged
[i
] = i
;
1634 int *solid
= &solid_buffer
[ solid_buffer_len
];
1635 int len
= cxr_buildsolid( mesh
, i
, solid
, edge_tagged
, faces_tagged
);
1638 struct csolid
*csolid
= &candidates
[candidate_count
++];
1639 csolid
->start
= solid_buffer_len
;
1640 csolid
->count
= len
;
1641 csolid
->edge_count
= 0;
1643 v3_zero( csolid
->center
);
1644 for( int j
=0; j
<len
; j
++ )
1646 cxr_polygon
*polyj
= &mesh
->polys
[ solid
[j
] ];
1647 v3_add( polyj
->center
, csolid
->center
, csolid
->center
);
1648 csolid
->edge_count
+= polyj
->loop_total
;
1650 v3_divs( csolid
->center
, len
, csolid
->center
);
1651 solid_buffer_len
+= len
;
1654 free( edge_tagged
);
1655 free( vertex_tagged
);
1656 free( faces_tagged
);
1659 * Choosing the best solid: most defined manifold
1661 struct csolid
*best_solid
= NULL
;
1662 int fewest_manifold_splits
= INT32_MAX
;
1664 struct temp_manifold best_manifold
= { .loops
= NULL
, .loop_count
= 0 };
1665 int max_solid_faces
= 0;
1667 for( int i
=0; i
<candidate_count
; i
++ )
1669 struct csolid
*solid
= &candidates
[i
];
1670 max_solid_faces
= cxr_max(max_solid_faces
,solid
->count
);
1672 if( solid
->count
<= 2 )
1675 struct temp_manifold manifold
;
1676 cxr_link_manifold( mesh
, solid
, solid_buffer
, &manifold
);
1678 if( manifold
.status
== k_manifold_err
)
1680 *err
= k_soliderr_bad_manifold
;
1684 free(manifold
.loops
);
1685 free(best_manifold
.loops
);
1689 if( manifold
.status
== k_manifold_complete
)
1691 if( manifold
.split_count
< fewest_manifold_splits
)
1693 fewest_manifold_splits
= manifold
.split_count
;
1696 free( best_manifold
.loops
);
1697 best_manifold
= manifold
;
1702 if( manifold
.status
!= k_manifold_none
)
1703 free( manifold
.loops
);
1706 if( max_solid_faces
< 2 )
1708 *err
= k_soliderr_no_solids
;
1711 free(best_manifold
.loops
);
1715 if( best_solid
!= NULL
)
1717 cxr_mesh
*pullmesh
= cxr_alloc_mesh( best_solid
->edge_count
,
1718 best_solid
->edge_count
,
1722 for( int i
=0; i
<best_solid
->count
; i
++ )
1724 int nface_id
= pullmesh
->abpolys
.count
;
1725 int exist_plane_id
= solid_buffer
[best_solid
->start
+i
];
1727 cxr_polygon
*exist_face
= &mesh
->polys
[ exist_plane_id
],
1728 *new_face
= cxr_ab_empty( &pullmesh
->abpolys
);
1730 *new_face
= *exist_face
;
1731 new_face
->loop_start
= pullmesh
->abloops
.count
;
1733 for( int j
=0; j
<exist_face
->loop_total
; j
++ )
1735 cxr_loop
*exist_loop
= &mesh
->loops
[ exist_face
->loop_start
+j
],
1736 *new_loop
= cxr_ab_empty(&pullmesh
->abloops
);
1738 new_loop
->index
= exist_loop
->index
;
1739 new_loop
->poly_left
= nface_id
;
1740 new_loop
->poly_right
= -1;
1741 new_loop
->edge_index
= 0;
1742 v2_copy( exist_loop
->uv
, new_loop
->uv
);
1745 exist_face
->loop_total
= -1;
1749 int pullmesh_new_start
= pullmesh
->abpolys
.count
;
1751 if( fewest_manifold_splits
!= 0 )
1753 /* Unusual observation:
1754 * If the split count is odd, the manifold can be created easily
1756 * If it is even, implicit internal geometry is needed to be
1757 * constructed. So the manifold gets folded as we create it segment
1760 * I'm not sure if this is a well defined rule of geometry, but seems
1761 * to apply to the data we care about.
1763 int collapse_used_segments
= (u32
)fewest_manifold_splits
& 0x1? 0: 1;
1767 for( int j
=0; j
< best_manifold
.loop_count
; j
++ )
1769 if( !best_manifold
.loops
[j
].split
) continue;
1771 cxr_loop
*loop
= &best_manifold
.loops
[j
].loop
;
1773 for( int k
=1; k
< best_manifold
.loop_count
; k
++ )
1775 int index1
= cxr_range(j
+k
, best_manifold
.loop_count
);
1776 cxr_loop
*loop1
= &best_manifold
.loops
[index1
].loop
;
1778 if( best_manifold
.loops
[index1
].split
)
1785 if( new_polys
> best_manifold
.loop_count
)
1788 cxr_log( "Programming error: Too many new polys!\n" );
1793 if( cxr_create_poly( pullmesh
, k
+1 ) )
1795 for( int l
=0; l
<k
+1; l
++ )
1797 int i0
= cxr_range(j
+l
, best_manifold
.loop_count
),
1798 index
= best_manifold
.loops
[ i0
].loop
.index
;
1800 cxr_poly_push_index( pullmesh
, index
);
1802 cxr_poly_finish( pullmesh
);
1805 /* Collapse down manifold */
1806 if( collapse_used_segments
)
1808 best_manifold
.loops
[j
].split
= 0;
1809 best_manifold
.loops
[index1
].split
= 0;
1811 int new_length
= (best_manifold
.loop_count
-(k
-1));
1813 struct temp_manifold new_manifold
= {
1814 .loop_count
= new_length
1816 new_manifold
.loops
=
1817 malloc( new_length
*sizeof(*new_manifold
.loops
) );
1819 for( int l
=0; l
<new_length
; l
++ )
1821 int i_src
= cxr_range( j
+k
+l
, best_manifold
.loop_count
);
1822 new_manifold
.loops
[l
] = best_manifold
.loops
[i_src
];
1825 free( best_manifold
.loops
);
1826 best_manifold
= new_manifold
;
1828 goto manifold_repeat
;
1837 if( best_manifold
.loop_count
&& collapse_used_segments
)
1839 cxr_create_poly_full( pullmesh
, &best_manifold
);
1845 cxr_create_poly_full( pullmesh
, &best_manifold
);
1849 if( new_polys
>= 3 )
1851 if( !cxr_build_implicit_geo( pullmesh
, new_polys
, pullmesh_new_start
))
1855 free(best_manifold
.loops
);
1857 cxr_free_mesh( pullmesh
);
1858 *err
= k_soliderr_degenerate_implicit
;
1864 * Copy faces from the pullmesh into original, to patch up where there
1865 * would be gaps created
1867 for( int i
=0; i
<new_polys
; i
++ )
1869 int rface_id
= mesh
->abpolys
.count
;
1870 cxr_polygon
*pface
= &pullmesh
->polys
[pullmesh_new_start
+i
],
1871 *rip_face
= cxr_ab_empty(&mesh
->abpolys
);
1873 rip_face
->loop_start
= mesh
->abloops
.count
;
1874 rip_face
->loop_total
= pface
->loop_total
;
1875 rip_face
->material_id
= -1;
1877 for( int j
=0; j
<rip_face
->loop_total
; j
++ )
1880 &pullmesh
->loops
[ pface
->loop_start
+pface
->loop_total
-j
-1 ],
1881 *rloop
= cxr_ab_empty(&mesh
->abloops
);
1883 rloop
->index
= ploop
->index
;
1884 rloop
->poly_left
= rface_id
;
1885 rloop
->poly_right
= -1;
1886 rloop
->edge_index
= 0;
1887 v2_copy( ploop
->uv
, rloop
->uv
);
1890 v3_copy( pface
->center
, rip_face
->center
);
1891 v3_negate( pface
->normal
, rip_face
->normal
);
1894 cxr_mesh_update( mesh
);
1895 cxr_mesh_update( pullmesh
);
1897 cxr_mesh_clean_faces( mesh
);
1898 cxr_mesh_clean_edges( mesh
);
1899 cxr_mesh_clean_faces( pullmesh
);
1900 cxr_mesh_clean_edges( pullmesh
);
1904 free(best_manifold
.loops
);
1911 free(best_manifold
.loops
);
1917 * Convert from the format we recieve from blender into our internal format
1918 * with auto buffers.
1920 static cxr_mesh
*cxr_to_internal_format(
1921 cxr_static_mesh
*src
,
1922 cxr_abuffer
*abverts
1924 cxr_mesh
*mesh
= cxr_alloc_mesh( src
->edge_count
, src
->loop_count
,
1925 src
->poly_count
, abverts
);
1927 cxr_ab_init( abverts
, sizeof(v3f
), src
->vertex_count
);
1929 memcpy( mesh
->abedges
.arr
, src
->edges
, src
->edge_count
*sizeof(cxr_edge
));
1930 memcpy( mesh
->abpolys
.arr
, src
->polys
, src
->poly_count
*sizeof(cxr_polygon
));
1931 memcpy( abverts
->arr
, src
->vertices
, src
->vertex_count
*sizeof(v3f
));
1932 mesh
->abedges
.count
= src
->edge_count
;
1933 mesh
->abloops
.count
= src
->loop_count
;
1934 mesh
->abpolys
.count
= src
->poly_count
;
1936 cxr_mesh_update( mesh
);
1938 for( int i
=0; i
<src
->loop_count
; i
++ )
1940 cxr_loop
*lp
= &mesh
->loops
[i
];
1942 lp
->index
= src
->loops
[i
].index
;
1943 lp
->edge_index
= src
->loops
[i
].edge_index
;
1944 v2_copy( src
->loops
[i
].uv
, lp
->uv
);
1947 abverts
->count
= src
->vertex_count
;
1951 static int cxr_solid_checkerr( cxr_mesh
*mesh
)
1953 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
1956 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
1960 cxr_polygon
*poly
= &mesh
->polys
[i
];
1963 normal_to_plane( poly
->normal
, poly
->center
, plane
);
1965 for( int j
=0; j
<poly
->loop_total
; j
++ )
1967 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
1968 double *vert
= verts
[ loop
->index
];
1970 if( fabs(plane_polarity(plane
,vert
)) > 0.0025 )
1976 plane_project_point( plane
, vert
, ref
);
1979 cxr_debug_line( ref
, vert
, colour_error
);
1980 cxr_debug_box( vert
, 0.1, colour_error
);
1987 cxr_debug_poly( mesh
, poly
, colour_error
);
1994 CXR_API
void cxr_free_world( cxr_world
*world
)
1996 for( int i
=0; i
<world
->absolids
.count
; i
++ )
1998 cxr_solid
*solid
= cxr_ab_ptr( &world
->absolids
, i
);
1999 cxr_free_mesh( solid
->pmesh
);
2002 cxr_ab_free( &world
->abverts
);
2003 cxr_ab_free( &world
->absolids
);
2004 free( world
->materials
);
2008 CXR_API cxr_tri_mesh
*cxr_world_preview( cxr_world
*world
)
2010 cxr_tri_mesh
*out
= malloc( sizeof(cxr_tri_mesh
) );
2011 out
->vertex_count
= 0;
2012 out
->indices_count
= 0;
2014 for( int i
=0; i
<world
->absolids
.count
; i
++ )
2016 cxr_solid
*solid
= cxr_ab_ptr( &world
->absolids
, i
);
2017 cxr_mesh
*mesh
= solid
->pmesh
;
2019 for( int j
=0; j
<mesh
->abpolys
.count
; j
++ )
2021 cxr_polygon
*poly
= &mesh
->polys
[j
];
2023 out
->vertex_count
+= poly
->loop_total
* 3; /* Polygon, edge strip */
2024 out
->indices_count
+= (poly
->loop_total
-2) * 3; /* Polygon */
2025 out
->indices_count
+= poly
->loop_total
* 2 * 3; /* Edge strip */
2029 out
->colours
= malloc( sizeof(v4f
)*out
->vertex_count
);
2030 out
->vertices
= malloc( sizeof(v3f
)*out
->vertex_count
);
2031 out
->indices
= malloc( sizeof(i32
)*out
->indices_count
);
2033 v3f
*overts
= out
->vertices
;
2034 v4f
*colours
= out
->colours
;
2035 i32
*indices
= out
->indices
;
2040 for( int i
=0; i
<world
->absolids
.count
; i
++ )
2042 cxr_solid
*solid
= cxr_ab_ptr( &world
->absolids
, i
);
2043 cxr_mesh
*mesh
= solid
->pmesh
;
2045 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
2048 colour_random_brush( i
, colour
);
2050 for( int j
=0; j
<mesh
->abpolys
.count
; j
++ )
2052 cxr_polygon
*poly
= &mesh
->polys
[j
];
2056 for( int k
=0; k
<poly
->loop_total
-2; k
++ )
2062 indices
[ ii
++ ] = istart
+i0
;
2063 indices
[ ii
++ ] = istart
+i1
;
2064 indices
[ ii
++ ] = istart
+i2
;
2067 for( int k
=0; k
<poly
->loop_total
; k
++ )
2069 cxr_loop
*lp
= &mesh
->loops
[poly
->loop_start
+k
];
2072 i1r
= cxr_range(k
+1,poly
->loop_total
)*3+1,
2074 i1i
= cxr_range(k
+1,poly
->loop_total
)*3+2;
2076 indices
[ ii
++ ] = istart
+i0i
;
2077 indices
[ ii
++ ] = istart
+i1i
;
2078 indices
[ ii
++ ] = istart
+i1r
;
2080 indices
[ ii
++ ] = istart
+i0i
;
2081 indices
[ ii
++ ] = istart
+i1r
;
2082 indices
[ ii
++ ] = istart
+i0r
;
2085 v3_muladds( verts
[lp
->index
], poly
->normal
, 0.02, overts
[vi
] );
2086 v4_copy( colour
, colours
[ vi
] );
2091 v3_lerp( verts
[lp
->index
], poly
->center
, 0.2, inner
);
2092 v3_muladds( inner
, poly
->normal
, 0.015, overts
[ vi
] );
2093 v4_copy( colour
, colours
[ vi
] );
2094 v4_copy( (v4f
){ 0.0, 0.0, 0.0, 0.0 }, colours
[vi
] );
2097 v3_muladds(verts
[lp
->index
], poly
->normal
, 0.0, overts
[ vi
] );
2098 v4_copy( colour
, colours
[ vi
] );
2099 v4_copy( (v4f
){ 1.0, 1.0, 1.0, 0.125 }, colours
[vi
] );
2108 CXR_API
void cxr_free_tri_mesh( cxr_tri_mesh
*mesh
)
2110 free( mesh
->colours
);
2111 free( mesh
->indices
);
2112 free( mesh
->vertices
);
2116 CXR_API cxr_world
*cxr_decompose( cxr_static_mesh
*src
)
2118 cxr_world
*world
= malloc( sizeof(*world
) );
2120 /* Copy data to internal formats */
2121 cxr_mesh
*main_mesh
= cxr_to_internal_format( src
, &world
->abverts
);
2122 cxr_ab_init( &world
->absolids
, sizeof(cxr_solid
), 2 );
2124 if( src
->material_count
)
2126 size_t dsize
= sizeof(cxr_material
) * src
->material_count
;
2127 world
->materials
= malloc( dsize
);
2128 memcpy( world
->materials
, src
->materials
, dsize
);
2130 else world
->materials
= NULL
;
2132 int invalid_count
= 0;
2135 * Preprocessor 1: Island seperation
2139 cxr_mesh
*res
= cxr_pull_island( main_mesh
);
2142 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ res
, 0, 0 });
2146 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ main_mesh
, 0, 0 } );
2149 * Preprocessor 2: Displacement processing & error checks
2151 for( int i
=0; i
<world
->absolids
.count
; i
++ )
2153 cxr_solid
*pinf
= cxr_ab_ptr(&world
->absolids
,i
);
2155 for( int j
=0; j
<pinf
->pmesh
->abpolys
.count
; j
++ )
2157 cxr_polygon
*poly
= &pinf
->pmesh
->polys
[ j
];
2159 for( int k
=0; k
<poly
->loop_total
; k
++ )
2161 cxr_loop
*lp
= &pinf
->pmesh
->loops
[ poly
->loop_start
+k
];
2162 cxr_edge
*edge
= &pinf
->pmesh
->edges
[ lp
->edge_index
];
2164 if( edge
->freestyle
)
2169 if( cxr_solid_checkerr( pinf
->pmesh
) )
2178 pinf
->displacement
= 1;
2182 * Main convex decomp algorithm
2184 int sources_count
= world
->absolids
.count
;
2190 for( int i
=0; i
<sources_count
; i
++ )
2192 cxr_solid pinf
= *(cxr_solid
*)cxr_ab_ptr(&world
->absolids
, i
);
2194 if( pinf
.displacement
|| pinf
.invalid
)
2199 cxr_mesh
*res
= cxr_pull_best_solid( pinf
.pmesh
, 0, &error
);
2203 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ res
, 0, 0 } );
2207 if( error
== k_soliderr_no_solids
)
2209 /* Retry if non-critical error, with extra edges */
2210 res
= cxr_pull_best_solid(pinf
.pmesh
, 1, &error
);
2213 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ res
, 0, 0 } );
2229 cxr_log( "Error %d\n", error
);
2230 cxr_free_world( world
);
2235 * format specific functions: vdf, vmf, (v)bsp
2236 * ----------------------------------------------------------------------------
2238 #ifdef CXR_VALVE_MAP_FILE
2240 CXR_API cxr_vdf
*cxr_vdf_open(const char *path
)
2242 cxr_vdf
*vdf
= malloc(sizeof(cxr_vdf
));
2245 vdf
->fp
= fopen( path
, "w" );
2256 CXR_API
void cxr_vdf_close(cxr_vdf
*vdf
)
2262 CXR_API
void cxr_vdf_put(cxr_vdf
*vdf
, const char *str
)
2264 for( int i
=0; i
<vdf
->level
; i
++ )
2265 fputs( " ", vdf
->fp
);
2267 fputs( str
, vdf
->fp
);
2270 static void cxr_vdf_printf( cxr_vdf
*vdf
, const char *fmt
, ... )
2272 cxr_vdf_put(vdf
,"");
2275 va_start( args
, fmt
);
2276 vfprintf( vdf
->fp
, fmt
, args
);
2280 CXR_API
void cxr_vdf_node(cxr_vdf
*vdf
, const char *str
)
2282 cxr_vdf_put( vdf
, str
);
2283 putc( (u8
)'\n', vdf
->fp
);
2284 cxr_vdf_put( vdf
, "{\n" );
2289 CXR_API
void cxr_vdf_edon( cxr_vdf
*vdf
)
2292 cxr_vdf_put( vdf
, "}\n" );
2295 CXR_API
void cxr_vdf_kv( cxr_vdf
*vdf
, const char *strk
, const char *strv
)
2297 cxr_vdf_printf( vdf
, "\"%s\" \"%s\"\n", strk
, strv
);
2301 * Data-type specific Keyvalues
2303 static void cxr_vdf_ki32( cxr_vdf
*vdf
, const char *strk
, i32 val
)
2305 cxr_vdf_printf( vdf
, "\"%s\" \"%d\"\n", strk
, val
);
2308 static void cxr_vdf_kdouble( cxr_vdf
*vdf
, const char *strk
, double val
)
2310 cxr_vdf_printf( vdf
, "\"%s\" \"%f\"\n", strk
, val
);
2313 static void cxr_vdf_kaxis( cxr_vdf
*vdf
, const char *strk
,
2314 v3f normal
, double offset
, double scale
2316 cxr_vdf_printf( vdf
, "\"%s\" \"[%f %f %f %f] %f\"\n",
2317 strk
, normal
[0], normal
[1],normal
[2], offset
, scale
);
2320 static void cxr_vdf_kv3f( cxr_vdf
*vdf
, const char *strk
, v3f v
)
2322 cxr_vdf_printf( vdf
, "\"%s\" \"[%f %f %f]\"\n", strk
, v
[0], v
[1], v
[2] );
2325 static void cxr_vdf_karrdouble( cxr_vdf
*vdf
, const char *strk
,
2326 int id
, double *doubles
, int count
2328 cxr_vdf_put(vdf
,"");
2329 fprintf( vdf
->fp
, "\"%s%d\" \"", strk
, id
);
2330 for( int i
=0; i
<count
; i
++ )
2332 if( i
== count
-1 ) fprintf( vdf
->fp
, "%f", doubles
[i
] );
2333 else fprintf( vdf
->fp
, "%f ", doubles
[i
] );
2335 fprintf( vdf
->fp
, "\"\n" );
2338 static void cxr_vdf_karrv3f( cxr_vdf
*vdf
, const char *strk
,
2339 int id
, v3f
*vecs
, int count
2341 cxr_vdf_put(vdf
,"");
2342 fprintf( vdf
->fp
, "\"%s%d\" \"", strk
, id
);
2343 for( int i
=0; i
<count
; i
++ )
2345 const char *format
= i
== count
-1? "%f %f %f": "%f %f %f ";
2346 fprintf( vdf
->fp
, format
, vecs
[i
][0], vecs
[i
][1], vecs
[i
][2] );
2348 fprintf( vdf
->fp
, "\"\n" );
2351 static void cxr_vdf_plane( cxr_vdf
*vdf
, const char *strk
, v3f a
, v3f b
, v3f c
)
2353 cxr_vdf_printf( vdf
, "\"%s\" \"(%f %f %f) (%f %f %f) (%f %f %f)\"\n",
2354 strk
, a
[0], a
[1], a
[2], b
[0], b
[1], b
[2], c
[0], c
[1], c
[2] );
2357 static void cxr_vdf_colour255(cxr_vdf
*vdf
, const char *strk
, v4f colour
)
2360 v4_muls( colour
, 255.0, scale
);
2361 cxr_vdf_printf( vdf
, "\"%s\" \"%d %d %d %d\"\n",
2362 strk
,(int)scale
[0], (int)scale
[1], (int)scale
[2], (int)scale
[3]);
2365 static struct cxr_material cxr_nodraw
=
2367 .res
= { 512, 512 },
2368 .name
= "tools/toolsnodraw"
2372 * Find most extreme point along a given direction
2374 static double support_distance( v3f verts
[3], v3f dir
, double coef
)
2378 coef
* v3_dot( verts
[0], dir
),
2381 coef
* v3_dot( verts
[1], dir
),
2382 coef
* v3_dot( verts
[2], dir
)
2388 * Convert regular UV'd triangle int Source's u/vaxis vectors
2390 * This supports affine move, scale, rotation, parallel skewing
2392 static void cxr_calculate_axis( cxr_texinfo
*transform
, v3f verts
[3],
2393 v2f uvs
[3], v2f texture_res
2395 v2f tT
, bT
; /* Tangent/bitangent pairs for UV space and world */
2398 v2_sub( uvs
[0], uvs
[1], tT
);
2399 v2_sub( uvs
[2], uvs
[1], bT
);
2400 v3_sub( verts
[0], verts
[1], tW
);
2401 v3_sub( verts
[2], verts
[1], bW
);
2403 /* Use arbitrary projection if there is no UV */
2404 if( v2_length( tT
) < 0.0001 || v2_length( bT
) < 0.0001 )
2406 v3f uaxis
, normal
, vaxis
;
2408 v3_copy( tW
, uaxis
);
2409 v3_normalize( uaxis
);
2411 v3_cross( tW
, bW
, normal
);
2412 v3_cross( normal
, uaxis
, vaxis
);
2413 v3_normalize( vaxis
);
2415 v3_copy( uaxis
, transform
->uaxis
);
2416 v3_copy( vaxis
, transform
->vaxis
);
2417 v2_zero( transform
->offset
);
2419 v2_div( (v2f
){128.0, 128.0}, texture_res
, transform
->scale
);
2420 transform
->winding
= 1.0;
2424 /* Detect if UV is reversed */
2425 double winding
= v2_cross( tT
, bT
) >= 0.0f
? 1.0f
: -1.0f
;
2427 /* UV projection reference */
2429 v2_muls((v2f
){1,0}, winding
, vX
);
2430 v2_muls((v2f
){0,1}, winding
, vY
);
2432 /* Reproject reference into world space, including skew */
2435 v3_muls( tW
, v2_cross(vX
,bT
) / v2_cross(bT
,tT
), uaxis1
);
2436 v3_muladds( uaxis1
, bW
, v2_cross(vX
, tT
) / v2_cross(tT
,bT
), uaxis1
);
2438 v3_muls( tW
, v2_cross(vY
,bT
) / v2_cross(bT
,tT
), vaxis1
);
2439 v3_muladds( vaxis1
, bW
, v2_cross(vY
,tT
) / v2_cross(tT
,bT
), vaxis1
);
2441 v3_normalize( uaxis1
);
2442 v3_normalize( vaxis1
);
2444 /* Apply source transform to axis (yes, they also need to be swapped) */
2445 v3f norm
, uaxis
, vaxis
;
2447 v3_cross( bW
, tW
, norm
);
2449 v3_cross( vaxis1
, norm
, uaxis
);
2450 v3_cross( uaxis1
, norm
, vaxis
);
2453 v2f uvmin
, uvmax
, uvdelta
;
2454 v2_minv( uvs
[0], uvs
[1], uvmin
);
2455 v2_minv( uvmin
, uvs
[2], uvmin
);
2456 v2_maxv( uvs
[0], uvs
[1], uvmax
);
2457 v2_maxv( uvmax
, uvs
[2], uvmax
);
2459 v2_sub( uvmax
, uvmin
, uvdelta
);
2461 /* world-uv scale */
2462 v2f uvminw
, uvmaxw
, uvdeltaw
;
2463 uvminw
[0] = -support_distance( verts
, uaxis
, -1.0f
);
2464 uvmaxw
[0] = support_distance( verts
, uaxis
, 1.0f
);
2465 uvminw
[1] = -support_distance( verts
, vaxis
, -1.0f
);
2466 uvmaxw
[1] = support_distance( verts
, vaxis
, 1.0f
);
2468 v2_sub( uvmaxw
, uvminw
, uvdeltaw
);
2472 v2_div( uvdeltaw
, uvdelta
, uv_scale
);
2473 v2_div( uv_scale
, texture_res
, uv_scale
);
2475 /* Find offset via 'natural' point */
2476 v2f target_uv
, natural_uv
, tex_offset
;
2477 v2_mul( uvs
[0], texture_res
, target_uv
);
2479 natural_uv
[0] = v3_dot( uaxis
, verts
[0] );
2480 natural_uv
[1] = -v3_dot( vaxis
, verts
[0] );
2481 v2_div( natural_uv
, uv_scale
, natural_uv
);
2483 tex_offset
[0] = target_uv
[0]-natural_uv
[0];
2484 tex_offset
[1] = -(target_uv
[1]-natural_uv
[1]);
2486 /* Copy everything into output */
2487 v3_copy( uaxis
, transform
->uaxis
);
2488 v3_copy( vaxis
, transform
->vaxis
);
2489 v2_copy( tex_offset
, transform
->offset
);
2490 v2_copy( uv_scale
, transform
->scale
);
2491 transform
->winding
= winding
;
2495 * Get the maximal direction of a vector, while also ignoring an axis
2498 static int cxr_cardinal( v3f a
, int ignore
)
2501 double component_max
= -CXR_BIG_NUMBER
;
2503 for( int i
=0; i
<3; i
++ )
2505 if( i
== ignore
) continue;
2507 if( fabs(a
[i
]) > component_max
)
2509 component_max
= fabs(a
[i
]);
2513 double d
= a
[component
] >= 0.0? 1.0: -1.0;
2521 * Convert contiguous mesh to displacement patch
2523 static int cxr_write_disp( cxr_mesh
*mesh
, cxr_world
*world
,
2524 cxr_vmf_context
*ctx
, cxr_vdf
*output
2526 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
2530 int con_start
, con_count
;
2538 *vertinfo
= malloc( sizeof(struct vertinfo
)*mesh
->p_abverts
->count
);
2539 int *graph
= malloc( sizeof(int) * mesh
->abedges
.count
*2 );
2542 for( int i
=0; i
<mesh
->p_abverts
->count
; i
++ )
2544 struct vertinfo
*info
= &vertinfo
[i
];
2545 info
->con_start
= con_pos
;
2546 info
->con_count
= 0;
2553 for( int j
=0; j
<mesh
->abedges
.count
; j
++ )
2555 cxr_edge
*edge
= &mesh
->edges
[j
];
2557 if( edge
->i0
== i
|| edge
->i1
== i
)
2559 graph
[ con_pos
++ ] = edge
->i0
== i
? edge
->i1
: edge
->i0
;
2562 if( edge
->freestyle
)
2568 v3f refv
, refu
, refn
;
2569 v3_zero(refv
); v3_zero(refu
); v3_zero(refn
);
2572 * Approximately match the area of the result brush faces to the actual
2575 * Necessary for accuracy and even lightmap texel allocation
2578 double uv_area
= 0.0, face_area
= 0.0, sf
;
2579 v2f uvboundmin
, uvboundmax
;
2580 v3f faceboundmin
, faceboundmax
;
2584 v2_fill( uvboundmin
, CXR_BIG_NUMBER
);
2585 v2_fill( uvboundmax
, -CXR_BIG_NUMBER
);
2586 v3_fill( faceboundmin
, CXR_BIG_NUMBER
);
2587 v3_fill( faceboundmax
, -CXR_BIG_NUMBER
);
2589 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
2591 cxr_polygon
*poly
= &mesh
->polys
[i
];
2593 for( int j
=0; j
<poly
->loop_total
; j
++ )
2595 cxr_loop
*lp0
= &mesh
->loops
[ poly
->loop_start
+j
];
2596 v2_minv( lp0
->uv
, uvboundmin
, uvboundmin
);
2597 v2_maxv( lp0
->uv
, uvboundmax
, uvboundmax
);
2598 v3_minv( verts
[lp0
->index
], faceboundmin
, faceboundmin
);
2599 v3_maxv( verts
[lp0
->index
], faceboundmax
, faceboundmax
);
2602 for( int j
=0; j
<poly
->loop_total
-2; j
++ )
2604 cxr_loop
*lp0
= &mesh
->loops
[poly
->loop_start
],
2605 *lp1
= &mesh
->loops
[poly
->loop_start
+j
+1],
2606 *lp2
= &mesh
->loops
[poly
->loop_start
+j
+2];
2609 v3_sub( verts
[lp1
->index
], verts
[lp0
->index
], va
);
2610 v3_sub( verts
[lp2
->index
], verts
[lp0
->index
], vb
);
2611 v3_cross( va
, vb
, orth
);
2613 face_area
+= v3_length( orth
) / 2.0;
2616 v2_sub( lp1
->uv
, lp0
->uv
, uva
);
2617 v2_sub( lp2
->uv
, lp0
->uv
, uvb
);
2619 uv_area
+= fabs(v2_cross( uva
, uvb
)) / 2.0;
2623 v3_add( faceboundmax
, faceboundmin
, face_center
);
2624 v3_muls( face_center
, 0.5, face_center
);
2625 v2_add( uvboundmin
, uvboundmax
, uv_center
);
2626 v2_muls( uv_center
, 0.5, uv_center
);
2628 sf
= sqrt( face_area
/ uv_area
);
2629 int corner_count
= 0;
2632 * Vertex classification
2633 * boundary vertices: they exist on a freestyle edge
2634 * corners: only connected to other boundaries
2636 for( int i
=0; i
<mesh
->p_abverts
->count
; i
++ )
2638 struct vertinfo
*info
= &vertinfo
[i
];
2639 if( !info
->boundary
) continue;
2644 for( int j
=0; j
<info
->con_count
; j
++ )
2646 int con
= graph
[info
->con_start
+j
];
2648 if( vertinfo
[con
].boundary
)
2654 if( count
> 2 || non_manifold
)
2662 * TODO(harry): This currently only supports power 2 displacements
2663 * its quite straightforward to upgrade it.
2665 * TODO(harry): Error checking is needed here for bad input data
2673 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
2675 cxr_polygon
*basepoly
= &mesh
->polys
[i
];
2677 for( int h
=0; h
<basepoly
->loop_total
; h
++ )
2680 i1
= cxr_range(h
+1,basepoly
->loop_total
);
2682 cxr_loop
*l0
= &mesh
->loops
[ basepoly
->loop_start
+i0
],
2683 *l1
= &mesh
->loops
[ basepoly
->loop_start
+i1
];
2684 struct vertinfo
*info
= &vertinfo
[ l0
->index
];
2689 int corner_count
= 1;
2691 cxr_material
*matptr
=
2692 basepoly
->material_id
< 0 || !world
->materials
?
2694 &world
->materials
[ basepoly
->material_id
];
2697 dispedge
[0] = l0
->index
;
2698 dispedge
[1] = l1
->index
;
2699 v2_copy( l0
->uv
, corner_uvs
[0] );
2701 /* Consume (use) face from orignal mesh */
2702 basepoly
->loop_total
= -1;
2704 while( dispedge_count
< 17 )
2706 struct vertinfo
*edge_head
=
2707 &vertinfo
[dispedge
[dispedge_count
-1]];
2711 if( edge_head
->corner
)
2713 /* Find polygon that has edge C-1 -> C */
2714 for( int j
=0; j
<mesh
->abpolys
.count
&& !newvert
; j
++ )
2716 cxr_polygon
*poly
= &mesh
->polys
[j
];
2718 for( int k
=0; k
<poly
->loop_total
; k
++ )
2721 i1
= cxr_range(k
+1,poly
->loop_total
);
2723 cxr_loop
*l0
= &mesh
->loops
[ poly
->loop_start
+i0
],
2724 *l1
= &mesh
->loops
[ poly
->loop_start
+i1
];
2726 if( l0
->index
== dispedge
[dispedge_count
-2] &&
2727 l1
->index
== dispedge
[dispedge_count
-1] )
2729 /* Take the next edge */
2730 v2_copy( l1
->uv
, corner_uvs
[corner_count
++] );
2732 int i2
= cxr_range(i1
+1,poly
->loop_total
);
2733 cxr_loop
*l2
= &mesh
->loops
[ poly
->loop_start
+i2
];
2735 dispedge
[dispedge_count
++] = l2
->index
;
2737 poly
->loop_total
= -1;
2745 for( int j
=0; j
<edge_head
->con_count
; j
++ )
2747 int con
= graph
[edge_head
->con_start
+j
];
2752 if( dispedge_count
> 1 )
2753 if( con
== dispedge
[dispedge_count
-2] )
2756 struct vertinfo
*coninfo
= &vertinfo
[con
];
2758 if( !coninfo
->boundary
)
2761 dispedge
[ dispedge_count
++ ] = con
;
2774 /* All edges collected */
2777 v2_sub( corner_uvs
[1], corner_uvs
[0], va
);
2778 v2_sub( corner_uvs
[2], corner_uvs
[0], vb
);
2780 /* Connect up the grid
2788 * Example: a := common unused vertex that is connected to
2789 * by 1 and 15. Or y-1, and x-1 on the grid.
2790 * g := c and f common vert ^
2795 for( int j
=0; j
<5; j
++ ) grid
[j
] = dispedge
[j
];
2796 for( int j
=1; j
<5; j
++ ) grid
[j
*5+4] = dispedge
[j
+4];
2797 for( int j
=0; j
<4; j
++ ) grid
[4*5+3-j
] = dispedge
[j
+9];
2798 for( int j
=1; j
<4; j
++ ) grid
[j
*5] = dispedge
[16-j
];
2801 for( int j
=1; j
<4; j
++ )
2803 for( int k
=1; k
<4; k
++ )
2805 int s0
= grid
[(j
-1)*5+k
],
2808 struct vertinfo
*va
= &vertinfo
[s0
],
2809 *vb
= &vertinfo
[s1
];
2811 /* Find common non-used vertex */
2812 for( int l
=0; l
<va
->con_count
; l
++ )
2814 for( int m
=0; m
<vb
->con_count
; m
++ )
2816 int cona
= graph
[va
->con_start
+l
],
2817 conb
= graph
[vb
->con_start
+m
];
2821 if( vertinfo
[cona
].used
|| vertinfo
[cona
].boundary
)
2824 grid
[ j
*5+k
] = cona
;
2825 vertinfo
[cona
].used
= 1;
2833 cxr_log( "Broken displacement!\n" );
2844 * Create V reference based on first displacement.
2845 * TODO(harry): This is not the moststable selection method!
2846 * faces can come in any order, so the first disp will of
2847 * course always vary. Additionaly the triangle can be oriented
2850 * Improvement can be made by selecting a first disp/triangle
2851 * based on deterministic factors.
2853 if( disp_count
== 0 )
2857 v3_copy( verts
[dispedge
[0]], tri_ref
[0] );
2858 v3_copy( verts
[dispedge
[4]], tri_ref
[1] );
2859 v3_copy( verts
[dispedge
[8]], tri_ref
[2] );
2860 cxr_calculate_axis( &tx
, tri_ref
, corner_uvs
, (v2f
){512,512} );
2862 v3_muls( tx
.vaxis
, -1.0, refv
);
2863 int v_cardinal
= cxr_cardinal( refv
, -1 );
2865 v3_cross( tx
.vaxis
, tx
.uaxis
, refn
);
2866 v3_muls( refn
, -tx
.winding
, refn
);
2868 /* Computing new reference vectors */
2869 int n1_cardinal
= cxr_cardinal( refn
, v_cardinal
);
2873 for( int j
=0; j
<2; j
++ )
2874 if( u_cardinal
== n1_cardinal
|| u_cardinal
== v_cardinal
)
2878 refu
[u_cardinal
] = tx
.uaxis
[u_cardinal
] > 0.0? 1.0: -1.0;
2882 v3_copy( face_center
, p0
);
2883 v3_muladds( face_center
, refn
, 1.5, pn
);
2884 v3_muladds( face_center
, refv
, 1.5, pv
);
2885 v3_muladds( face_center
, refu
, 1.5, pu
);
2888 /* Create world coordinates */
2889 v3f world_corners
[8];
2892 for( int j
=0; j
<4; j
++ )
2895 v2_sub( corner_uvs
[j
], uv_center
, local_uv
);
2896 v2_copy( corner_uvs
[j
], world_uv
[j
] );
2897 v2_muls( local_uv
, sf
, local_uv
);
2899 v3_muls( refu
, local_uv
[0], world_corners
[j
] );
2900 v3_muladds( world_corners
[j
],refv
,local_uv
[1],world_corners
[j
] );
2901 v3_add( face_center
, world_corners
[j
], world_corners
[j
] );
2904 double *colour
= colours_random
[cxr_range(disp_count
,8)];
2906 for( int j
=0; j
<4; j
++ )
2907 v3_muladds( world_corners
[j
], refn
, -1.0, world_corners
[j
+4] );
2909 /* Apply world transform */
2910 for( int j
=0; j
<8; j
++ )
2912 double *p0
= world_corners
[j
];
2913 v3_muls( p0
, ctx
->scale
, p0
);
2914 v3_add( p0
, ctx
->offset
, p0
);
2917 cxr_texinfo texinfo_shared
;
2918 cxr_calculate_axis( &texinfo_shared
, world_corners
, world_uv
,
2919 (v2f
){ matptr
->res
[0], matptr
->res
[1] } );
2922 cxr_vdf_node( output
, "solid" );
2923 cxr_vdf_ki32( output
, "id", ++ ctx
->brush_count
);
2934 double distances
[25];
2936 v3f lside0
, lside1
, lref
, vdelta
, vworld
;
2939 for( int j
=0; j
<5; j
++ )
2941 ty
= (double)j
/(double)(5-1);
2943 v3_lerp( world_corners
[0], world_corners
[3], ty
, lside0
);
2944 v3_lerp( world_corners
[1], world_corners
[2], ty
, lside1
);
2946 for( int k
=0; k
<5; k
++ )
2950 tx
= (double)k
/(double)(5-1);
2951 v3_lerp( lside0
, lside1
, tx
, lref
);
2952 v3_muls( verts
[grid
[index
]], ctx
->scale
, vworld
);
2953 v3_add( ctx
->offset
, vworld
, ctx
->offset
);
2955 v3_sub( vworld
, lref
, vdelta
);
2956 v3_copy( vdelta
, normals
[index
] );
2957 v3_normalize( normals
[index
] );
2958 distances
[index
] = v3_dot( vdelta
, normals
[index
] );
2962 for( int j
=0; j
<6; j
++ )
2964 int *side
= sides
[j
];
2966 cxr_vdf_node( output
, "side" );
2967 cxr_vdf_ki32( output
, "id", ++ ctx
->face_count
);
2968 cxr_vdf_plane( output
, "plane", world_corners
[side
[2]],
2969 world_corners
[side
[1]],
2970 world_corners
[side
[0]] );
2972 cxr_vdf_kv( output
, "material", matptr
->name
);
2974 cxr_vdf_kaxis( output
, "uaxis",
2975 texinfo_shared
.uaxis
,
2976 texinfo_shared
.offset
[0],
2977 texinfo_shared
.scale
[0] );
2978 cxr_vdf_kaxis( output
, "vaxis",
2979 texinfo_shared
.vaxis
,
2980 texinfo_shared
.offset
[1],
2981 texinfo_shared
.scale
[1] );
2983 cxr_vdf_kdouble( output
, "rotation", 0.0 );
2984 cxr_vdf_ki32( output
, "lightmapscale", ctx
->lightmap_scale
);
2985 cxr_vdf_ki32( output
, "smoothing_groups", 0 );
2989 cxr_vdf_node( output
, "dispinfo" );
2990 cxr_vdf_ki32( output
, "power", 2 );
2991 cxr_vdf_kv3f( output
, "startposition", world_corners
[0] );
2992 cxr_vdf_ki32( output
, "flags", 0 );
2993 cxr_vdf_kdouble( output
, "elevation", 0.0 );
2994 cxr_vdf_ki32( output
, "subdiv", 0 );
2996 cxr_vdf_node( output
, "normals" );
2997 for( int k
=0; k
<5; k
++ )
2998 cxr_vdf_karrv3f( output
, "row", k
, &normals
[k
*5], 5 );
2999 cxr_vdf_edon( output
);
3001 cxr_vdf_node( output
, "distances" );
3002 for( int k
=0; k
<5; k
++ )
3003 cxr_vdf_karrdouble( output
, "row", k
, &distances
[k
*5], 5 );
3004 cxr_vdf_edon( output
);
3007 * TODO: This might be needed for the compilers. Opens fine in
3012 cxr_vdf_node( output, "offsets" );
3013 for( int k=0; k<5; k++ )
3014 cxr_vdf_printf( output,
3015 "\"row%d\" \"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\"\n", k );
3016 cxr_vdf_edon( output );
3018 cxr_vdf_node( output, "offset_normals" );
3019 for( int k=0; k<5; k++ )
3020 cxr_vdf_printf( output,
3021 "\"row%d\" \"0 0 1 0 0 1 0 0 1 0 0 1 0 0 1\"\n", k );
3022 cxr_vdf_edon( output );
3024 cxr_vdf_node( output, "alphas" );
3025 for( int k=0; k<5; k++ )
3026 cxr_vdf_printf( output, "\"row%d\" \"0 0 0 0 0\"\n", k );
3027 cxr_vdf_edon( output );
3029 cxr_vdf_node( output, "triangle_tags" );
3030 for( int k=0; k<5-1; k++ )
3031 cxr_vdf_printf( output,
3032 "\"row%d\" \"9 9 9 9 9 9 9 9\"\n", k );
3033 cxr_vdf_edon( output );
3035 cxr_vdf_node( output, "allowed_verts" );
3036 cxr_vdf_printf( output,
3037 "\"10\" \"-1 -1 -1 -1 -1 -1 -1 -1 -1 -1\"\n" );
3038 cxr_vdf_edon( output );
3041 cxr_vdf_edon( output
);
3044 cxr_vdf_edon( output
);
3047 cxr_vdf_node( output
, "editor");
3048 cxr_vdf_colour255( output
, "color",
3049 colours_random
[cxr_range(ctx
->brush_count
,8)]);
3051 cxr_vdf_ki32( output
, "visgroupshown",1);
3052 cxr_vdf_ki32( output
, "visgroupautoshown",1);
3053 cxr_vdf_edon( output
);
3055 cxr_vdf_edon( output
);
3067 * Write header information for a vmf to vdf
3069 CXR_API
void cxr_begin_vmf( cxr_vmf_context
*ctx
, cxr_vdf
*output
)
3071 cxr_vdf_node( output
, "versioninfo" );
3072 cxr_vdf_ki32( output
, "editorversion", 400 );
3073 cxr_vdf_ki32( output
, "editorbuild", 8456 );
3074 cxr_vdf_ki32( output
, "mapversion", ctx
->mapversion
);
3075 cxr_vdf_ki32( output
, "formatversion", 100 );
3076 cxr_vdf_ki32( output
, "prefab", 0 );
3077 cxr_vdf_edon( output
);
3079 cxr_vdf_node( output
, "visgroups" );
3080 cxr_vdf_edon( output
);
3082 cxr_vdf_node( output
, "viewsettings" );
3083 cxr_vdf_ki32( output
, "bSnapToGrid", 1 );
3084 cxr_vdf_ki32( output
, "bShowGrid", 1 );
3085 cxr_vdf_ki32( output
, "bShowLogicalGrid", 0 );
3086 cxr_vdf_ki32( output
, "nGridSpacing", 64 );
3087 cxr_vdf_ki32( output
, "bShow3DGrid", 0 );
3088 cxr_vdf_edon( output
);
3090 cxr_vdf_node( output
, "world" );
3091 cxr_vdf_ki32( output
, "id", 1 );
3092 cxr_vdf_ki32( output
, "mapversion", 1 ); /* ?? */
3093 cxr_vdf_kv( output
, "classname", "worldspawn" );
3094 cxr_vdf_kv( output
, "skyname", ctx
->skyname
);
3095 cxr_vdf_ki32( output
, "maxpropscreenwidth", -1 );
3096 cxr_vdf_kv( output
, "detailvbsp", ctx
->detailvbsp
);
3097 cxr_vdf_kv( output
, "detailmaterial", ctx
->detailmaterial
);
3100 /* Fairly useless but might need in the future */
3101 CXR_API
void cxr_vmf_begin_entities( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
)
3103 cxr_vdf_edon( vdf
);
3106 CXR_API
void cxr_end_vmf( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
)
3111 * Write solids (and displacements) to VMF file
3113 CXR_API
void cxr_push_world_vmf( cxr_world
*world
, cxr_vmf_context
*ctx
,
3116 v3f
*verts
= cxr_ab_ptr( &world
->abverts
, 0 );
3118 /* Write all solids as VMF brushes */
3119 for( int i
=0; i
<world
->absolids
.count
; i
++ )
3121 cxr_solid
*solid
= cxr_ab_ptr(&world
->absolids
,i
);
3123 if( solid
->displacement
)
3125 cxr_write_disp( solid
->pmesh
, world
, ctx
, output
);
3129 cxr_vdf_node( output
, "solid" );
3130 cxr_vdf_ki32( output
, "id", ++ ctx
->brush_count
);
3132 for( int j
=0; j
<solid
->pmesh
->abpolys
.count
; j
++ )
3134 cxr_polygon
*poly
= &solid
->pmesh
->polys
[j
];
3135 cxr_loop
*ploops
= &solid
->pmesh
->loops
[poly
->loop_start
];
3137 cxr_material
*matptr
=
3138 poly
->material_id
< 0 || !world
->materials
?
3140 &world
->materials
[ poly
->material_id
];
3142 cxr_vdf_node( output
, "side" );
3143 cxr_vdf_ki32( output
, "id", ++ ctx
->face_count
);
3145 v3f tri
[3]; v2f uvs
[3];
3147 int i0
= ploops
[0].index
,
3148 i1
= ploops
[1].index
,
3149 i2
= ploops
[2].index
;
3151 v3_muls( verts
[i0
], ctx
->scale
, tri
[0] );
3152 v3_muls( verts
[i1
], ctx
->scale
, tri
[1] );
3153 v3_muls( verts
[i2
], ctx
->scale
, tri
[2] );
3155 v3_add( ctx
->offset
, tri
[0], tri
[0] );
3156 v3_add( ctx
->offset
, tri
[1], tri
[1] );
3157 v3_add( ctx
->offset
, tri
[2], tri
[2] );
3159 v2_copy( ploops
[0].uv
, uvs
[0] );
3160 v2_copy( ploops
[1].uv
, uvs
[1] );
3161 v2_copy( ploops
[2].uv
, uvs
[2] );
3163 cxr_vdf_plane( output
, "plane", tri
[2], tri
[1], tri
[0] );
3164 cxr_vdf_kv( output
, "material", matptr
->name
);
3167 cxr_calculate_axis( &tx
, tri
, uvs
,
3168 (double[2]){ matptr
->res
[0], matptr
->res
[1] });
3170 cxr_vdf_kaxis( output
, "uaxis", tx
.uaxis
, tx
.offset
[0], tx
.scale
[0]);
3171 cxr_vdf_kaxis( output
, "vaxis", tx
.vaxis
, tx
.offset
[1], tx
.scale
[1]);
3173 cxr_vdf_kdouble( output
, "rotation", 0.0 );
3174 cxr_vdf_ki32( output
, "lightmapscale", ctx
->lightmap_scale
);
3175 cxr_vdf_ki32( output
, "smoothing_groups", 0);
3177 cxr_vdf_edon( output
);
3180 cxr_vdf_node( output
, "editor" );
3181 cxr_vdf_colour255( output
, "color",
3182 colours_random
[cxr_range(ctx
->brush_count
,8)]);
3184 cxr_vdf_ki32( output
, "visgroupshown", 1 );
3185 cxr_vdf_ki32( output
, "visgroupautoshown", 1 );
3186 cxr_vdf_edon( output
);
3188 cxr_vdf_edon( output
);
3193 * Valve Source SDK 2015 CS:GO
3195 #define HEADER_LUMPS 64
3196 #define LUMP_WORLDLIGHTS 54
3198 #pragma pack(push,1)
3207 int fileofs
, filelen
;
3212 lumps
[ HEADER_LUMPS
];
3222 float shadow_cast_offset
[3];
3230 float constant_attn
;
3232 float quadratic_attn
;
3240 * Utility for patching BSP tools to remove -1 distance lights (we set them
3241 * like that, because we want these lights to go away)
3243 * Yes, there is no way to do this in hammer
3244 * Yes, the distance KV is unused but still gets compiled to this lump
3245 * No, Entities only compile will not do this for you
3247 CXR_API
int cxr_lightpatch_bsp( const char *path
)
3249 printf( "Lightpatch: %s\n", path
);
3251 FILE *fp
= fopen( path
, "r+b" );
3256 cxr_log( "Could not open BSP file for editing (r+b)\n" );
3262 struct header header
;
3263 fread( &header
, sizeof(struct header
), 1, fp
);
3264 struct lump
*lump
= &header
.lumps
[ LUMP_WORLDLIGHTS
];
3266 /* Read worldlight array */
3267 struct worldlight
*lights
= malloc( lump
->filelen
);
3268 fseek( fp
, lump
->fileofs
, SEEK_SET
);
3269 fread( lights
, lump
->filelen
, 1, fp
);
3271 /* Remove all marked lights */
3272 int light_count
= lump
->filelen
/ sizeof(struct worldlight
);
3275 for( int i
= 0; i
< light_count
; i
++ )
3276 if( lights
[i
].radius
>= 0.0f
)
3277 lights
[new_count
++] = lights
[i
];
3279 lump
->filelen
= new_count
*sizeof(struct worldlight
);
3281 /* Write changes back to file */
3282 fseek( fp
, lump
->fileofs
, SEEK_SET
);
3283 fwrite( lights
, lump
->filelen
, 1, fp
);
3284 fseek( fp
, 0, SEEK_SET
);
3285 fwrite( &header
, sizeof(struct header
), 1, fp
);
3288 cxr_log( "removed %d marked lights\n", light_count
-new_count
);
3296 #endif /* CXR_VALVE_MAP_FILE */
3297 #endif /* CXR_IMPLEMENTATION */