4 A GNU/Linux-first Source1 Hammer replacement
5 built with Blender, for mapmakers
7 Copyright (C) 2022 Harry Godden (hgn)
9 LICENSE: GPLv3.0, please see COPYING and LICENSE for more information
12 - Brush decomposition into convex pieces for well defined geometry
13 - Freely form displacements without limits
14 - Build your entire map in Blender
15 - Compile models and model groups easily
16 - It runs at an ok speed!
17 - Light patch BSP files; remove unwanted realtime effects
18 - Bestest VTF compressor (thanks to Richgel999 and stb)
19 - Pack content automatically
23 File/folder Lang Purpose
25 __init__.py Python Blender plugin interface
28 cxr.h C Heavy lifting; brush decomp, mesh processing
29 cxr_math.h C Vector maths and other handy things
30 cxr_mem.h C Automatic resizing buffers
31 libcxr.c C Compile as SO
34 nbvtf.h C VTF processing interface
35 librgcx.h C++ Rich Geldreich's DXT1/DXT5 compressors
36 stb/ C Sean Barrets image I/O
52 #define CXR_EPSILON 0.001
53 #define CXR_PLANE_SIMILARITY_MAX 0.998
54 #define CXR_BIG_NUMBER 1e300
55 #define CXR_INTERIOR_ANGLE_MAX 0.998
58 #define CXR_IMPLEMENTATION
77 typedef unsigned int uint
;
79 typedef double v2f
[2];
80 typedef double v3f
[3];
81 typedef double v4f
[4];
89 typedef struct cxr_world cxr_world
;
90 typedef struct cxr_solid cxr_solid
;
92 typedef struct cxr_mesh cxr_mesh
;
93 typedef struct cxr_edge cxr_edge
;
94 typedef struct cxr_polygon cxr_polygon
;
95 typedef struct cxr_static_mesh cxr_static_mesh
;
96 typedef struct cxr_loop cxr_loop
;
97 typedef struct cxr_static_loop cxr_static_loop
;
98 typedef struct cxr_material cxr_material
;
99 typedef struct cxr_tri_mesh cxr_tri_mesh
;
101 #ifdef CXR_VALVE_MAP_FILE
102 typedef struct cxr_vdf cxr_vdf
;
103 typedef struct cxr_texinfo cxr_texinfo
;
104 typedef struct cxr_visgroup cxr_visgroup
;
105 typedef struct cxr_vmf_context cxr_vmf_context
;
106 #endif /* CXR_VALVE_MAP_FILE */
112 /* Main convexer algorithms */
113 /* Convex decomp from mesh */
114 CXR_API cxr_world
*cxr_decompose( cxr_static_mesh
*src
, i32
*perrcode
);
115 CXR_API
void cxr_free_world( cxr_world
*world
);
116 CXR_API cxr_tri_mesh
*cxr_world_preview( cxr_world
*world
);
117 CXR_API
void cxr_free_tri_mesh( cxr_tri_mesh
*mesh
);
119 #ifdef CXR_VALVE_MAP_FILE
121 CXR_API
void cxr_begin_vmf( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
);
122 CXR_API
void cxr_vmf_begin_entities( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
);
123 CXR_API
void cxr_push_world_vmf(
124 cxr_world
*world
, cxr_vmf_context
*ctx
, cxr_vdf
*vdf
);
125 CXR_API
void cxr_end_vmf( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
);
128 CXR_API cxr_vdf
*cxr_vdf_open( const char *path
);
129 CXR_API
void cxr_vdf_close( cxr_vdf
*vdf
);
130 CXR_API
void cxr_vdf_put( cxr_vdf
*vdf
, const char *str
);
131 CXR_API
void cxr_vdf_node( cxr_vdf
*vdf
, const char *str
);
132 CXR_API
void cxr_vdf_edon( cxr_vdf
*vdf
);
133 CXR_API
void cxr_vdf_kv( cxr_vdf
*vdf
, const char *strk
, const char *strv
);
136 CXR_API
int cxr_lightpatch_bsp( const char *path
);
137 #endif /* CXR_VALVE_MAP_FILE */
141 CXR_API
void cxr_set_log_function( void (*func
)(const char *str
) );
142 CXR_API
void cxr_set_line_function( void (*func
)(v3f p0
, v3f p1
, v4f colour
) );
143 CXR_API
void cxr_write_test_data( cxr_static_mesh
*src
);
144 #endif /* CXR_DEBUG */
146 struct cxr_static_mesh
153 i32 freestyle
, sharp
;
157 struct cxr_static_loop
167 i32 loop_start
, loop_total
;
170 i32 material_id
; /* -1: interior material (nodraw) */
209 cxr_material
*materials
;
220 *p_abverts
; /* This data is stored externally because the data is often
221 shared between solids. */
223 /* Valid when update() is called on this mesh,
224 * Invalid when data is appended to them */
225 struct cxr_edge
*edges
;
226 struct cxr_polygon
*polys
;
227 struct cxr_loop
*loops
;
230 /* Simple mesh type mainly for debugging */
240 #ifdef CXR_VALVE_MAP_FILE
254 * Simplified VDF writing interface. No allocations or nodes, just write to file
262 struct cxr_vmf_context
270 cxr_visgroup
*visgroups
;
273 /* Transform settings */
284 #endif /* CXR_VALVE_MAP_FILE */
289 k_soliderr_non_manifold
,
290 k_soliderr_bad_manifold
,
291 k_soliderr_no_solids
,
292 k_soliderr_degenerate_implicit
,
293 k_soliderr_non_coplanar_vertices
,
294 k_soliderr_non_convex_poly
,
295 k_soliderr_bad_result
,
296 k_soliderr_invalid_input
301 * -----------------------------------------------------------------------------
303 #ifdef CXR_IMPLEMENTATION
305 const char *cxr_build_time
= __DATE__
" @" __TIME__
;
311 #warning 32 bit is not supported in blender 3.0
315 static void (*cxr_log_func
)(const char *str
);
316 static void (*cxr_line_func
)( v3f p0
, v3f p1
, v4f colour
);
318 static int cxr_range(int x
, int bound
)
321 x
+= bound
* (x
/bound
+ 1);
327 * This should be called after appending any data to those buffers
329 static void cxr_mesh_update( cxr_mesh
*mesh
)
331 mesh
->edges
= cxr_ab_ptr(&mesh
->abedges
, 0);
332 mesh
->polys
= cxr_ab_ptr(&mesh
->abpolys
, 0);
333 mesh
->loops
= cxr_ab_ptr(&mesh
->abloops
, 0);
336 static v4f colours_random
[] =
338 { 0.863, 0.078, 0.235, 0.4 },
339 { 0.000, 0.980, 0.604, 0.4 },
340 { 0.118, 0.565, 1.000, 0.4 },
341 { 0.855, 0.439, 0.839, 0.4 },
342 { 0.824, 0.412, 0.118, 0.4 },
343 { 0.125, 0.698, 0.667, 0.4 },
344 { 0.541, 0.169, 0.886, 0.4 },
345 { 1.000, 0.843, 0.000, 0.4 }
348 static v4f colours_solids
[] =
350 { 100, 143, 255, 200 },
351 { 120, 94, 240, 200 },
352 { 220, 38, 127, 200 },
357 static v4f colour_entity
= { 37, 241, 122, 255 };
358 static v4f colour_displacement_solid
= { 146, 146, 146, 120 };
359 static v4f colour_error
= { 1.0f
, 0.0f
, 0.0f
, 1.0f
};
360 static v4f colour_face_graph
= { 1.0f
, 1.0f
, 1.0f
, 0.03f
};
361 static v4f colour_success
= { 0.0f
, 1.0f
, 0.0f
, 1.0f
};
363 static void value_random(int n
, v4f colour
)
365 double val
= cxr_range(n
,8);
369 v3_muls( colour
, val
, colour
);
372 static void colour_random_brush(int n
, v4f colour
)
376 int colour_n
= cxr_range( n
, 5 );
377 v4_muls( colours_solids
[ colour_n
], 1.0/255.0, colour
);
378 value_random( value_n
, colour
);
380 int colour_n
= cxr_range( n
, 8 );
381 v4_copy( colours_random
[ colour_n
], colour
);
386 * Debugging and diagnostic utilities
387 * -----------------------------------------------------------------------------
392 static void cxr_log( const char *fmt
, ... )
397 va_start( args
, fmt
);
398 vsnprintf( buf
, sizeof(buf
)-1, fmt
, args
);
407 static void cxr_debug_line( v3f p0
, v3f p1
, v4f colour
)
410 cxr_line_func( p0
, p1
, colour
);
413 static void cxr_debug_box( v3f p0
, double sz
, v4f colour
)
417 v3_add(p0
, (v3f
){-sz
,-sz
,-sz
}, a
);
418 v3_add(p0
, (v3f
){-sz
, sz
,-sz
}, b
);
419 v3_add(p0
, (v3f
){ sz
, sz
,-sz
}, c
);
420 v3_add(p0
, (v3f
){ sz
,-sz
,-sz
}, d
);
421 v3_add(p0
, (v3f
){-sz
,-sz
,sz
}, a1
);
422 v3_add(p0
, (v3f
){-sz
, sz
,sz
}, b1
);
423 v3_add(p0
, (v3f
){ sz
, sz
,sz
}, c1
);
424 v3_add(p0
, (v3f
){ sz
,-sz
,sz
}, d1
);
426 cxr_debug_line( a
,b
, colour
);
427 cxr_debug_line( b
,c
, colour
);
428 cxr_debug_line( c
,d
, colour
);
429 cxr_debug_line( d
,a
, colour
);
430 cxr_debug_line( a1
,b1
, colour
);
431 cxr_debug_line( b1
,c1
, colour
);
432 cxr_debug_line( c1
,d1
, colour
);
433 cxr_debug_line( d1
,a1
, colour
);
434 cxr_debug_line( a
,a1
, colour
);
435 cxr_debug_line( b
,b1
, colour
);
436 cxr_debug_line( c
,c1
, colour
);
437 cxr_debug_line( d
,d1
, colour
);
441 * Draw arrow with the tips oriented along normal
443 static void cxr_debug_arrow( v3f p0
, v3f p1
, v3f normal
, double sz
, v4f colour
)
445 v3f dir
, tan
, p2
, p3
;
449 v3_cross(dir
,normal
,tan
);
450 v3_muladds( p1
,dir
, -sz
, p2
);
451 v3_muladds( p2
,tan
,sz
,p3
);
452 cxr_debug_line( p1
, p3
, colour
);
453 v3_muladds( p2
,tan
,-sz
,p3
);
454 cxr_debug_line( p1
, p3
, colour
);
455 cxr_debug_line( p0
, p1
, colour
);
459 * Draw arrows CCW around polygon, draw normal vector from center
461 static void cxr_debug_poly( cxr_mesh
*mesh
, cxr_polygon
*poly
, v4f colour
)
463 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
465 for( int i
=0; i
<poly
->loop_total
; i
++ )
467 int lp0
= poly
->loop_start
+i
,
468 lp1
= poly
->loop_start
+cxr_range(i
+1,poly
->loop_total
);
470 int i0
= mesh
->loops
[ lp0
].index
,
471 i1
= mesh
->loops
[ lp1
].index
;
475 v3_lerp( verts
[i0
], poly
->center
, 0.0075, p0
);
476 v3_lerp( verts
[i1
], poly
->center
, 0.0075, p1
);
477 v3_muladds( p0
, poly
->normal
, 0.01, p0
);
478 v3_muladds( p1
, poly
->normal
, 0.01, p1
);
480 cxr_debug_arrow( p0
, p1
, poly
->normal
, 0.05, colour
);
484 v3_muladds( poly
->center
, poly
->normal
, 0.3, nrm0
);
486 cxr_debug_line( poly
->center
, nrm0
, colour
);
489 static void cxr_debug_mesh(cxr_mesh
*mesh
, v4f colour
)
491 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
493 cxr_polygon
*poly
= &mesh
->polys
[i
];
494 cxr_debug_poly( mesh
, poly
, colour
);
498 CXR_API
void cxr_write_test_data( cxr_static_mesh
*src
)
501 "/home/harry/Documents/blender_addons_remote/addons/convexer/cxr/solid.h",
504 fprintf( fp
, "v3f test_verts[] = {\n" );
505 for( int i
=0; i
<src
->vertex_count
; i
++ )
507 fprintf( fp
, " { %f, %f, %f },\n",
510 src
->vertices
[i
][2] );
512 fprintf( fp
, "};\n" );
514 fprintf( fp
, "cxr_static_loop test_loops[] = {\n" );
515 for( int i
=0; i
<src
->loop_count
; i
++ )
517 fprintf( fp
, " {%d, %d},\n",
519 src
->loops
[i
].edge_index
);
521 fprintf( fp
, "};\n" );
523 fprintf( fp
, "cxr_polygon test_polys[] = {\n" );
524 for( int i
=0; i
<src
->poly_count
; i
++ )
526 fprintf( fp
, " {%d, %d, {%f, %f, %f}, {%f, %f, %f}},\n",
527 src
->polys
[i
].loop_start
,
528 src
->polys
[i
].loop_total
,
529 src
->polys
[i
].normal
[0],
530 src
->polys
[i
].normal
[1],
531 src
->polys
[i
].normal
[2],
532 src
->polys
[i
].center
[0],
533 src
->polys
[i
].center
[1],
534 src
->polys
[i
].center
[2] );
536 fprintf( fp
, "};\n" );
538 fprintf( fp
, "cxr_edge test_edges[] = {\n" );
539 for( int i
=0; i
<src
->edge_count
; i
++ )
541 fprintf( fp
, " {%d, %d, %d, %d},\n",
544 src
->edges
[i
].freestyle
,
548 fprintf( fp
, "};\n" );
550 fprintf( fp
, "cxr_static_mesh test_mesh = {\n" );
551 fprintf( fp
, " .vertices = test_verts,\n" );
552 fprintf( fp
, " .loops = test_loops,\n" );
553 fprintf( fp
, " .edges = test_edges,\n" );
554 fprintf( fp
, " .polys = test_polys,\n" );
555 fprintf( fp
, " .poly_count=%d,\n", src
->poly_count
);
556 fprintf( fp
, " .vertex_count=%d,\n", src
->vertex_count
);
557 fprintf( fp
, " .edge_count=%d,\n",src
->edge_count
);
558 fprintf( fp
, " .loop_count=%d\n", src
->loop_count
);
559 fprintf( fp
, "};\n" );
564 CXR_API
void cxr_set_log_function( void (*func
)(const char *str
) )
569 CXR_API
void cxr_set_line_function( void (*func
)(v3f p0
, v3f p1
, v4f colour
) )
571 cxr_line_func
= func
;
574 #endif /* CXR_DEBUG */
578 * abverts is a pointer to an existing vertex buffer
580 static cxr_mesh
*cxr_alloc_mesh( int edge_count
, int loop_count
, int poly_count
,
583 cxr_mesh
*mesh
= malloc(sizeof(cxr_mesh
));
584 cxr_ab_init(&mesh
->abedges
, sizeof(cxr_edge
), edge_count
);
585 cxr_ab_init(&mesh
->abloops
, sizeof(cxr_loop
), loop_count
);
586 cxr_ab_init(&mesh
->abpolys
, sizeof(cxr_polygon
), poly_count
);
587 mesh
->p_abverts
= abverts
;
589 cxr_mesh_update( mesh
);
594 static void cxr_free_mesh( cxr_mesh
*mesh
)
596 cxr_ab_free(&mesh
->abedges
);
597 cxr_ab_free(&mesh
->abloops
);
598 cxr_ab_free(&mesh
->abpolys
);
603 * Rebuilds edge data for mesh (useful to get rid of orphaned edges)
605 static void cxr_mesh_clean_edges( cxr_mesh
*mesh
)
607 cxr_abuffer new_edges
;
608 cxr_ab_init( &new_edges
, sizeof(cxr_edge
), mesh
->abedges
.count
);
610 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
612 cxr_polygon
*poly
= &mesh
->polys
[i
];
613 for( int j
=0; j
<poly
->loop_total
; j
++ )
616 *lp0
= &mesh
->loops
[poly
->loop_start
+j
],
617 *lp1
= &mesh
->loops
[poly
->loop_start
+cxr_range(j
+1,poly
->loop_total
)];
619 int i0
= cxr_min(lp0
->index
, lp1
->index
),
620 i1
= cxr_max(lp0
->index
, lp1
->index
);
622 /* Check if edge exists before adding */
623 for( int k
=0; k
<new_edges
.count
; k
++ )
625 cxr_edge
*edge
= cxr_ab_ptr(&new_edges
,k
);
627 if( edge
->i0
== i0
&& edge
->i1
== i1
)
630 goto IL_EDGE_CREATED
;
634 int orig_edge_id
= lp0
->edge_index
;
635 lp0
->edge_index
= new_edges
.count
;
637 cxr_edge edge
= { i0
, i1
};
640 * Copy extra information from original edges
643 if( orig_edge_id
< mesh
->abedges
.count
)
645 cxr_edge
*orig_edge
= &mesh
->edges
[ orig_edge_id
];
646 edge
.freestyle
= orig_edge
->freestyle
;
647 edge
.sharp
= orig_edge
->sharp
;
655 cxr_ab_push( &new_edges
, &edge
);
661 cxr_ab_free( &mesh
->abedges
);
662 mesh
->abedges
= new_edges
;
664 cxr_mesh_update( mesh
);
668 * Remove 0-length faces from mesh (we mark them light that for deletion
669 * Remove all unused loops as a result of removing those faces
671 static void cxr_mesh_clean_faces( cxr_mesh
*mesh
)
673 cxr_abuffer loops_new
;
674 cxr_ab_init( &loops_new
, sizeof(cxr_loop
), mesh
->abloops
.count
);
677 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
679 cxr_polygon
*src
= &mesh
->polys
[i
],
680 *dst
= &mesh
->polys
[new_length
];
682 if( src
->loop_total
> 0 )
684 int src_start
= src
->loop_start
,
685 src_total
= src
->loop_total
;
688 dst
->loop_start
= loops_new
.count
;
690 for( int j
=0; j
<src_total
; j
++ )
692 cxr_loop
*loop
= &mesh
->loops
[src_start
+j
],
693 *ldst
= cxr_ab_ptr(&loops_new
,dst
->loop_start
+j
);
695 ldst
->poly_left
= new_length
;
698 loops_new
.count
+= src_total
;
703 cxr_ab_free( &mesh
->abloops
);
704 mesh
->abloops
= loops_new
;
705 mesh
->abpolys
.count
= new_length
;
707 cxr_mesh_update( mesh
);
711 * Links loop's poly_left and poly_right
712 * Does not support more than 2 polys to one edge
714 * Returns 0 if there is non-manifold geomtry (aka: not watertight)
716 static int cxr_mesh_link_loops( cxr_mesh
*mesh
)
718 i32
*polygon_edge_map
= malloc(mesh
->abedges
.count
*2 *sizeof(i32
));
720 for( int i
= 0; i
< mesh
->abedges
.count
*2; i
++ )
721 polygon_edge_map
[i
] = -1;
723 for( int i
= 0; i
< mesh
->abpolys
.count
; i
++ )
725 cxr_polygon
*poly
= &mesh
->polys
[i
];
727 for( int j
= 0; j
< poly
->loop_total
; j
++ )
729 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
732 for( int k
= 0; k
< 2; k
++ )
734 i32
*edge
= &polygon_edge_map
[loop
->edge_index
*2+k
];
743 /* Overflowed edge mapping... Duplicated faces. */
744 free( polygon_edge_map
);
750 for( int i
= 0; i
< mesh
->abpolys
.count
; i
++ )
752 cxr_polygon
*poly
= &mesh
->polys
[i
];
754 for( int j
= 0; j
< poly
->loop_total
; j
++ )
756 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
758 i32
*face_map
= &polygon_edge_map
[ loop
->edge_index
*2 ];
760 if( face_map
[0] == loop
->poly_left
) loop
->poly_right
= face_map
[1];
761 else loop
->poly_right
= face_map
[0];
766 for( int i
=0; i
<mesh
->abedges
.count
*2; i
++ )
768 if( polygon_edge_map
[i
] == -1 )
770 free( polygon_edge_map
);
775 free( polygon_edge_map
);
780 * Create new empty polygon with known loop count
781 * Must be filled and completed by the following functions!
783 static int cxr_create_poly( cxr_mesh
*mesh
, int loop_count
)
785 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
790 cxr_log( "tried to add new poly with length %d!\n", loop_count
);
795 cxr_ab_reserve( &mesh
->abpolys
, 1 );
796 cxr_ab_reserve( &mesh
->abloops
, loop_count
);
797 cxr_mesh_update( mesh
);
799 cxr_polygon
*poly
= &mesh
->polys
[ mesh
->abpolys
.count
];
801 poly
->loop_start
= mesh
->abloops
.count
;
802 poly
->loop_total
= 0;
803 poly
->material_id
= -1;
804 v3_zero( poly
->center
);
810 * Add one index to the polygon created by the above function
812 static void cxr_poly_push_index( cxr_mesh
*mesh
, int id
)
814 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
816 int nface_id
= mesh
->abpolys
.count
;
817 cxr_polygon
*poly
= &mesh
->polys
[ nface_id
];
819 cxr_loop
*new_loop
= &mesh
->loops
[ poly
->loop_start
+ poly
->loop_total
];
821 new_loop
->poly_left
= nface_id
;
822 new_loop
->poly_right
= -1;
823 new_loop
->index
= id
;
824 new_loop
->edge_index
= 0;
825 v2_zero(new_loop
->uv
);
827 v3_add( poly
->center
, verts
[new_loop
->index
], poly
->center
);
830 mesh
->abloops
.count
++;
834 * Finalize and commit polygon into mesh
836 static void cxr_poly_finish( cxr_mesh
*mesh
)
838 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
840 int nface_id
= mesh
->abpolys
.count
;
841 cxr_polygon
*poly
= &mesh
->polys
[nface_id
];
843 /* Average center and calc normal */
845 v3_divs( poly
->center
, poly
->loop_total
, poly
->center
);
846 cxr_loop
*lp0
= &mesh
->loops
[ poly
->loop_start
],
847 *lp1
= &mesh
->loops
[ poly
->loop_start
+1 ],
848 *lp2
= &mesh
->loops
[ poly
->loop_start
+2 ];
851 verts
[lp0
->index
], verts
[lp1
->index
], verts
[lp2
->index
], poly
->normal
);
853 mesh
->abpolys
.count
++;
857 * Extract the next island from mesh
859 * Returns NULL if mesh is one contigous object
861 static cxr_mesh
*cxr_pull_island( cxr_mesh
*mesh
)
863 cxr_mesh_link_loops(mesh
);
865 int *island_current
= malloc(mesh
->abpolys
.count
*sizeof(int)),
870 island_current
[0] = 0;
873 last_count
= island_len
;
875 for( int i
=0; i
<island_len
; i
++ )
877 cxr_polygon
*poly
= &mesh
->polys
[ island_current
[i
] ];
879 for( int j
=0; j
<poly
->loop_total
; j
++ )
881 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
883 if( loop
->poly_right
!= -1 )
885 int face_present
= 0;
887 for( int k
=0; k
<island_len
; k
++ )
889 if( island_current
[k
] == loop
->poly_right
)
897 island_current
[ island_len
++ ] = loop
->poly_right
;
902 if( island_len
> last_count
)
905 /* Check for complete object */
906 if( island_len
== mesh
->abpolys
.count
)
908 free( island_current
);
912 for( int i
=0; i
<island_len
; i
++ )
914 cxr_polygon
*poly
= &mesh
->polys
[ island_current
[i
] ];
915 loop_count
+= poly
->loop_total
;
918 /* Create and update meshes */
919 cxr_mesh
*newmesh
= cxr_alloc_mesh( mesh
->abedges
.count
,
924 for( int i
=0; i
<island_len
; i
++ )
926 cxr_polygon
*src
= &mesh
->polys
[ island_current
[i
] ];
927 cxr_polygon
*dst
= cxr_ab_ptr(&newmesh
->abpolys
, i
);
930 dst
->loop_start
= newmesh
->abloops
.count
;
932 for( int j
=0; j
<src
->loop_total
; j
++ )
935 *lsrc
= &mesh
->loops
[ src
->loop_start
+j
],
936 *ldst
= cxr_ab_ptr(&newmesh
->abloops
, dst
->loop_start
+j
);
940 ldst
->poly_right
= -1;
943 newmesh
->abloops
.count
+= src
->loop_total
;
944 src
->loop_total
= -1;
947 newmesh
->abpolys
.count
= island_len
;
948 newmesh
->abedges
.count
= mesh
->abedges
.count
;
949 memcpy( cxr_ab_ptr(&newmesh
->abedges
,0),
951 mesh
->abedges
.count
* sizeof(cxr_edge
));
953 cxr_mesh_clean_faces(mesh
);
954 cxr_mesh_clean_edges(mesh
);
955 cxr_mesh_clean_edges(newmesh
);
957 free( island_current
);
962 * Invalid solid is when there are vertices that are coplanar to a face, but are
963 * outside the polygons edges.
965 static int cxr_valid_solid( cxr_mesh
*mesh
, int *solid
, int len
)
967 v3f
*verts
= cxr_ab_ptr(mesh
->p_abverts
, 0);
969 for( int i
=0; i
<len
; i
++ )
971 cxr_polygon
*polyi
= &mesh
->polys
[ solid
[i
] ];
974 normal_to_plane(polyi
->normal
, polyi
->center
, plane
);
976 for( int j
=0; j
<len
; j
++ )
980 cxr_polygon
*polyj
= &mesh
->polys
[ solid
[j
] ];
982 for( int k
=0; k
<polyj
->loop_total
; k
++ )
984 cxr_loop
*lpj
= &mesh
->loops
[ polyj
->loop_start
+k
];
986 /* Test if the vertex is not referenced by the polygon */
987 for( int l
=0; l
<polyi
->loop_total
; l
++ )
989 cxr_loop
*lpi
= &mesh
->loops
[ polyi
->loop_start
+l
];
991 if( lpi
->index
== lpj
->index
)
995 if( fabs(plane_polarity(plane
, verts
[lpj
->index
])) < 0.001 )
1007 * Use when iterating the loops array, to get a unique set of edges
1008 * Better than using the edges array and doing many more checks
1010 static int cxr_loop_unique_edge( cxr_loop
*lp
)
1012 if( lp
->poly_left
> lp
->poly_right
)
1019 * Identify edges in the mesh where the two connected face's normals
1020 * are opposing eachother (or close to identical)
1022 static int *cxr_mesh_reflex_edges( cxr_mesh
*mesh
)
1024 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
1025 int *edge_tagged
= malloc( mesh
->abedges
.count
* sizeof(int) );
1027 for( int i
=0; i
<mesh
->abloops
.count
; i
++ )
1029 cxr_loop
*lp
= &mesh
->loops
[i
];
1030 if( !cxr_loop_unique_edge( lp
) ) continue;
1032 edge_tagged
[lp
->edge_index
] = 0;
1034 cxr_polygon
*polya
= &mesh
->polys
[ lp
->poly_left
],
1035 *polyb
= &mesh
->polys
[ lp
->poly_right
];
1038 normal_to_plane(polyb
->normal
, polyb
->center
, planeb
);
1040 for( int j
=0; j
<polya
->loop_total
; j
++ )
1042 cxr_loop
*lp1
= &mesh
->loops
[ polya
->loop_start
+j
];
1044 if(( plane_polarity( planeb
, verts
[lp1
->index
] ) > 0.001 ) ||
1045 ( v3_dot(polya
->normal
,polyb
->normal
) > CXR_PLANE_SIMILARITY_MAX
))
1047 edge_tagged
[lp
->edge_index
] = 1;
1057 * Same logic as above function except it will apply it to each vertex
1059 static int *cxr_mesh_reflex_vertices( cxr_mesh
*mesh
)
1061 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
1063 int *vertex_tagged
= malloc( mesh
->p_abverts
->count
*sizeof(int) );
1064 int *connected_planes
= malloc( mesh
->abpolys
.count
*sizeof(int) );
1066 for( int i
=0; i
<mesh
->p_abverts
->count
; i
++ )
1069 int num_connected
= 0;
1071 /* Create a list of polygons that refer to this vertex */
1072 for( int j
=0; j
<mesh
->abpolys
.count
; j
++ )
1074 cxr_polygon
*poly
= &mesh
->polys
[j
];
1075 for( int k
=0; k
<poly
->loop_total
; k
++ )
1077 cxr_loop
*loop
= &mesh
->loops
[poly
->loop_start
+k
];
1078 if( loop
->index
== i
)
1080 connected_planes
[num_connected
++] = j
;
1086 /* Check all combinations for a similar normal */
1087 for( int j
=0; j
<num_connected
-1; j
++ )
1089 for( int k
=j
+1; k
<num_connected
; k
++ )
1091 cxr_polygon
*polyj
= &mesh
->polys
[connected_planes
[j
]],
1092 *polyk
= &mesh
->polys
[connected_planes
[k
]];
1094 if( v3_dot(polyj
->normal
,polyk
->normal
) > CXR_PLANE_SIMILARITY_MAX
)
1100 * Check if all connected planes either:
1102 * - Coplanar with it
1104 for( int j
=0; j
<num_connected
; j
++ )
1106 for( int k
=j
+1; k
<num_connected
; k
++ )
1108 cxr_polygon
*jpoly
= &mesh
->polys
[ connected_planes
[j
] ],
1109 *kpoly
= &mesh
->polys
[ connected_planes
[k
] ];
1112 normal_to_plane( kpoly
->normal
, kpoly
->center
, plane
);
1113 for( int l
=0; l
<jpoly
->loop_total
; l
++ )
1115 cxr_loop
*lp
= &mesh
->loops
[ jpoly
->loop_start
+l
];
1117 if( plane_polarity( plane
, verts
[lp
->index
] ) > 0.001 )
1125 vertex_tagged
[i
] = 1;
1128 free( connected_planes
);
1129 return vertex_tagged
;
1133 * Detect if potential future edges create a collision with any of the
1134 * existing edges in the mesh
1136 static int cxr_solid_overlap( cxr_mesh
*mesh
,
1139 int common_edge_index
1141 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
1142 cxr_edge
*common_edge
= &mesh
->edges
[common_edge_index
];
1144 int unique_a
= pa
->loop_total
-2,
1145 unique_b
= pb
->loop_total
-2;
1147 int *unique_verts
= malloc( (unique_a
+unique_b
)*sizeof(int) );
1148 int unique_total
= 0;
1150 for( int j
=0; j
<2; j
++ )
1152 cxr_polygon
*poly
= (cxr_polygon
*[2]){pa
,pb
}[j
];
1154 for( int i
=0; i
<poly
->loop_total
; i
++ )
1156 cxr_loop
*lp
= &mesh
->loops
[poly
->loop_start
+i
];
1158 if( lp
->index
== common_edge
->i0
|| lp
->index
== common_edge
->i1
)
1161 unique_verts
[ unique_total
++ ] = lp
->index
;
1167 for( int i
=0; i
<unique_a
; i
++ )
1169 for( int j
=unique_a
; j
<unique_total
; j
++ )
1171 int i0
= unique_verts
[i
],
1172 i1
= unique_verts
[j
];
1174 for( int k
=0; k
<mesh
->abedges
.count
; k
++ )
1176 cxr_edge
*edge
= &mesh
->edges
[k
];
1178 if( edge
->i0
== i0
|| edge
->i0
== i1
||
1179 edge
->i1
== i0
|| edge
->i1
== i1
) continue;
1181 double *a0
= verts
[i0
],
1183 *b0
= verts
[edge
->i0
],
1184 *b1
= verts
[edge
->i1
];
1186 double dist
= segment_segment_dist( a0
, a1
, b0
, b1
, ca
, cb
);
1190 free( unique_verts
);
1197 free( unique_verts
);
1202 * Creates the 'maximal' solid that originates from this faceid
1204 * Returns the number of faces used
1206 static int cxr_buildsolid(
1213 faces_tagged
[faceid
] = faceid
;
1216 solid
[solid_len
++] = faceid
;
1218 int search_start
= 0;
1223 for( int j
=search_start
; j
<solid_len
; j
++ )
1225 cxr_polygon
*poly
= &mesh
->polys
[ solid
[j
] ];
1227 for( int k
=0; k
<poly
->loop_total
; k
++ )
1229 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+k
];
1230 cxr_edge
*edge
= &mesh
->edges
[ loop
->edge_index
];
1232 if( faces_tagged
[ loop
->poly_right
] == -1 )
1234 if( !reflex_edges
[loop
->edge_index
] )
1236 /* Check for dodgy edges */
1237 cxr_polygon
*newpoly
= &mesh
->polys
[loop
->poly_right
];
1239 if( cxr_solid_overlap(mesh
,poly
,newpoly
,loop
->edge_index
))
1242 /* Looking ahead by one step gives us an early out for invalid
1243 * configurations. This might just all be handled by the new
1244 * edge overlap detector, though.
1246 for( int l
=0; l
< newpoly
->loop_total
; l
++ )
1248 cxr_loop
*lp1
= &mesh
->loops
[ newpoly
->loop_start
+l
];
1249 cxr_polygon
*future_face
= &mesh
->polys
[ lp1
->poly_right
];
1251 if( reflex_edges
[ lp1
->edge_index
]
1252 || lp1
->poly_right
== loop
->poly_right
)
1255 for( int m
=0; m
<solid_len
; m
++ )
1256 if( solid
[m
] == lp1
->poly_right
)
1259 for( int m
=0; m
<solid_len
; m
++ )
1261 cxr_polygon
*polym
= &mesh
->polys
[solid
[m
]];
1262 double pdist
= v3_dot( polym
->normal
,future_face
->normal
);
1264 if( pdist
> CXR_PLANE_SIMILARITY_MAX
)
1271 /* Check for vertices in the new polygon that exist on a current
1272 * plane. This condition is invalid */
1273 solid
[ solid_len
] = loop
->poly_right
;
1275 if( cxr_valid_solid(mesh
,solid
,solid_len
+1 ) )
1277 faces_tagged
[ loop
->poly_right
] = faceid
;
1287 search_start
= solid_len
;
1289 goto search_iterate
;
1296 int start
, count
, edge_count
;
1300 struct temp_manifold
1302 struct manifold_loop
1312 enum manifold_status
1316 k_manifold_fragmented
,
1317 k_manifold_complete
,
1323 * Create polygon from entire manifold structure.
1325 * Must be completely co-planar
1327 static void cxr_create_poly_full( cxr_mesh
*mesh
, struct temp_manifold
*src
)
1329 if( cxr_create_poly( mesh
, src
->loop_count
) )
1331 for( int l
=0; l
<src
->loop_count
; l
++ )
1332 cxr_poly_push_index( mesh
, src
->loops
[ l
].loop
.index
);
1334 cxr_poly_finish( mesh
);
1339 * Links up all edges into a potential new manifold
1341 * The return status can be:
1342 * (err): Critical programming error
1343 * none: No manifold to create
1344 * fragmented: Multiple sections exist, not just one
1345 * complete: Optimial manifold was created
1347 static void cxr_link_manifold(
1349 struct csolid
*solid
,
1351 struct temp_manifold
*manifold
1353 cxr_loop
**edge_list
= malloc( sizeof(*edge_list
) * solid
->edge_count
);
1354 int *temp_solid
= malloc( solid
->count
*sizeof(int) );
1355 int temp_solid_len
= 0;
1357 int init_reverse
= 0;
1358 int unique_edge_count
= 0;
1360 /* Try remove splitting faces first */
1362 int split_total
= 0;
1363 for( int j
=0; j
<solid
->count
; j
++ )
1365 cxr_polygon
*poly
= &mesh
->polys
[ solid_buffer
[solid
->start
+j
] ];
1366 int interior_count
= 0;
1368 for( int k
=0; k
<poly
->loop_total
; k
++ )
1370 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+k
];
1372 for( int l
=0; l
<solid
->count
; l
++ )
1373 if( loop
->poly_right
== solid_buffer
[solid
->start
+l
] )
1382 if( interior_count
< poly
->loop_total
-1 )
1388 temp_solid
[ temp_solid_len
++ ] = solid_buffer
[solid
->start
+j
];
1391 if( temp_solid_len
< 3 || (split_total
& 0x2) /* unkown reasons */ )
1396 /* Overwrite original solid */
1397 for( int j
=0; j
<temp_solid_len
; j
++ )
1398 solid_buffer
[ solid
->start
+j
] = temp_solid
[ j
];
1400 solid
->count
= temp_solid_len
;
1406 for( int j
=0; j
<solid
->count
; j
++ )
1408 cxr_polygon
*poly
= &mesh
->polys
[ solid_buffer
[solid
->start
+j
] ];
1410 /* when discarding, if a face has only one loop that points outwards,
1414 for( int k
=0; k
<poly
->loop_total
; k
++ )
1416 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+k
];
1418 for( int l
=0; l
<unique_edge_count
; l
++ )
1419 if( edge_list
[l
]->edge_index
== loop
->edge_index
)
1422 for( int l
=0; l
<solid
->count
; l
++ )
1423 if( loop
->poly_right
== solid_buffer
[solid
->start
+l
] )
1426 edge_list
[ unique_edge_count
] = loop
;
1428 if( unique_edge_count
== 0 )
1430 cxr_edge
*edgeptr
= &mesh
->edges
[ loop
->edge_index
];
1431 if( edgeptr
->i1
== loop
->index
)
1435 unique_edge_count
++;
1440 if( unique_edge_count
== 0 )
1443 manifold
->status
= k_manifold_none
;
1447 /* Link edges together to form manifold */
1448 manifold
->loops
= malloc( solid
->edge_count
*sizeof(struct manifold_loop
));
1449 manifold
->split_count
= 0;
1450 manifold
->loop_count
= 0;
1452 cxr_edge
*current
= &mesh
->edges
[ edge_list
[0]->edge_index
];
1454 int endpt
= (!init_reverse
)? current
->i0
: current
->i1
,
1456 curface
= edge_list
[0]->poly_left
;
1459 for( int j
=0; j
<unique_edge_count
; j
++ )
1461 cxr_edge
*other
= &mesh
->edges
[ edge_list
[j
]->edge_index
];
1462 if( other
== current
)
1465 if( other
->i0
== endpt
|| other
->i1
== endpt
)
1470 if( other
->i0
== endpt
) endpt
= current
->i1
;
1471 else endpt
= current
->i0
;
1473 struct manifold_loop
*ml
= &manifold
->loops
[ manifold
->loop_count
++ ];
1475 if( curface
==edge_list
[j
]->poly_left
)
1478 manifold
->split_count
++;
1483 ml
->loop
.edge_index
= edge_list
[j
]->edge_index
;
1484 ml
->loop
.poly_left
= edge_list
[j
]->poly_left
;
1485 ml
->loop
.index
= lastpt
;
1486 ml
->loop
.poly_right
= edge_list
[j
]->poly_right
;
1488 curface
= edge_list
[j
]->poly_left
;
1492 if( manifold
->loop_count
< unique_edge_count
)
1493 manifold
->status
= k_manifold_fragmented
;
1495 manifold
->status
= k_manifold_complete
;
1497 goto manifold_complete
;
1500 goto manifold_continue
;
1504 /* Incomplete links */
1505 manifold
->status
= k_manifold_err
;
1514 * Reconstruct implied internal geometry where the manifold doesn't have
1515 * enough information (vertices) to create a full result.
1517 static int cxr_build_implicit_geo( cxr_mesh
*mesh
, int new_polys
, int start
)
1519 for( int i
=0; i
<new_polys
-2; i
++ )
1521 for( int j
=i
+1; j
<new_polys
-1; j
++ )
1523 for( int k
=j
+1; k
<new_polys
; k
++ )
1525 cxr_polygon
*ptri
= &mesh
->polys
[ start
+i
],
1526 *ptrj
= &mesh
->polys
[ start
+j
],
1527 *ptrk
= &mesh
->polys
[ start
+k
];
1529 v4f planei
, planej
, planek
;
1530 normal_to_plane(ptri
->normal
,ptri
->center
,planei
);
1531 normal_to_plane(ptrj
->normal
,ptrj
->center
,planej
);
1532 normal_to_plane(ptrk
->normal
,ptrk
->center
,planek
);
1536 if( plane_intersect(planei
,planej
,planek
,intersect
) )
1538 /* Make sure the point is inside the convex region */
1540 int point_valid
= 1;
1541 for( int l
=0; l
<mesh
->abpolys
.count
; l
++ )
1543 cxr_polygon
*ptrl
= &mesh
->polys
[l
];
1546 normal_to_plane(ptrl
->normal
, ptrl
->center
, planel
);
1548 if( plane_polarity( planel
, intersect
) > 0.01 )
1551 cxr_log( "degen vert, planes %d, %d, %d [max:%d]\n",
1554 cxr_debug_poly( mesh
, ptri
, colours_random
[3] );
1555 cxr_debug_poly( mesh
, ptrj
, colours_random
[1] );
1556 cxr_debug_poly( mesh
, ptrk
, colours_random
[2] );
1563 /* Extend faces to include this vert */
1565 int nvertid
= mesh
->p_abverts
->count
;
1566 cxr_ab_push( mesh
->p_abverts
, intersect
);
1568 ptrj
->loop_start
+= 1;
1569 ptrk
->loop_start
+= 2;
1571 cxr_ab_reserve( &mesh
->abloops
, 3);
1573 int newi
= ptri
->loop_start
+ptri
->loop_total
,
1574 newj
= ptrj
->loop_start
+ptrj
->loop_total
,
1575 newk
= ptrk
->loop_start
+ptrk
->loop_total
;
1578 *lloopi
= cxr_ab_empty_at(&mesh
->abloops
, newi
),
1579 *lloopj
= cxr_ab_empty_at(&mesh
->abloops
, newj
),
1580 *lloopk
= cxr_ab_empty_at(&mesh
->abloops
, newk
);
1582 lloopi
->index
= nvertid
;
1583 lloopi
->edge_index
= 0;
1584 lloopi
->poly_left
= start
+ i
;
1585 lloopi
->poly_right
= -1;
1587 lloopj
->index
= nvertid
;
1588 lloopj
->poly_left
= start
+ j
;
1589 lloopj
->edge_index
= 0;
1590 lloopj
->poly_right
= -1;
1592 lloopk
->index
= nvertid
;
1593 lloopk
->edge_index
= 0;
1594 lloopk
->poly_left
= start
+ k
;
1595 lloopk
->poly_right
= -1;
1597 v2_zero(lloopi
->uv
);
1598 v2_zero(lloopj
->uv
);
1599 v2_zero(lloopk
->uv
);
1601 ptri
->loop_total
++;
1602 ptrj
->loop_total
++;
1603 ptrk
->loop_total
++;
1605 double qi
= 1.0/(double)ptri
->loop_total
,
1606 qj
= 1.0/(double)ptrj
->loop_total
,
1607 qk
= 1.0/(double)ptrk
->loop_total
;
1609 /* Adjust centers of faces */
1610 v3_lerp( ptri
->center
, intersect
, qi
, ptri
->center
);
1611 v3_lerp( ptrj
->center
, intersect
, qj
, ptrj
->center
);
1612 v3_lerp( ptrk
->center
, intersect
, qk
, ptrk
->center
);
1621 static int cxr_reflex_err( cxr_mesh
*mesh
)
1624 int *reflex_check
= cxr_mesh_reflex_edges( mesh
);
1626 v3f
*temp
= cxr_ab_ptr(mesh
->p_abverts
, 0);
1628 for( int i
=0; i
<mesh
->abedges
.count
; i
++ )
1630 if( reflex_check
[i
] )
1632 cxr_debug_line( temp
[mesh
->edges
[i
].i0
],
1633 temp
[mesh
->edges
[i
].i1
],
1639 free( reflex_check
);
1643 static int cxr_non_manifold_err( cxr_mesh
*mesh
)
1645 if( !cxr_mesh_link_loops(mesh
) )
1648 cxr_log( "non-manifold edges are in the mesh: "
1649 "implicit internal geometry does not have full support\n" );
1651 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
1653 for( int i
=0; i
<mesh
->abloops
.count
; i
++ )
1655 cxr_loop
*lp
= &mesh
->loops
[i
];
1656 cxr_edge
*edge
= &mesh
->edges
[lp
->edge_index
];
1657 cxr_debug_line( verts
[edge
->i0
], verts
[edge
->i1
], colours_random
[1] );
1659 if( lp
->poly_left
== -1 || lp
->poly_right
== -1 )
1661 cxr_debug_line( verts
[edge
->i0
], verts
[edge
->i1
], colour_error
);
1672 * Convexer's main algorithm
1674 * Return the best availible convex solid from mesh, and patch the existing mesh
1675 * to fill the gap where the new mesh left it.
1677 * Returns NULL if shape is already convex or empty.
1678 * This function will not preserve edge data such as freestyle, sharp etc.
1680 static cxr_mesh
*cxr_pull_best_solid(
1682 int preserve_more_edges
,
1683 enum cxr_soliderr
*err
)
1685 *err
= k_soliderr_none
;
1687 if( cxr_non_manifold_err( mesh
) )
1689 *err
= k_soliderr_non_manifold
;
1693 int *edge_tagged
= cxr_mesh_reflex_edges( mesh
);
1694 int *vertex_tagged
= cxr_mesh_reflex_vertices( mesh
);
1697 * Connect all marked vertices that share an edge
1700 int *edge_important
= malloc(mesh
->abedges
.count
*sizeof(int));
1701 for( int i
=0; i
< mesh
->abedges
.count
; i
++ )
1702 edge_important
[i
] = 0;
1704 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
1706 cxr_polygon
*poly
= &mesh
->polys
[i
];
1707 int not_tagged
= -1,
1710 for( int j
=0; j
<poly
->loop_total
; j
++ )
1712 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
1714 if( !edge_tagged
[ loop
->edge_index
] )
1716 if( not_tagged
== -1 )
1717 not_tagged
= loop
->edge_index
;
1719 goto edge_unimportant
;
1723 if( not_tagged
!= -1 )
1724 edge_important
[not_tagged
]=1;
1730 * Connect edges where both vertices are reflex, only if we are not
1733 for( int i
=0; i
<mesh
->abedges
.count
; i
++ )
1735 if( edge_important
[i
] && preserve_more_edges
) continue;
1737 cxr_edge
*edge
= &mesh
->edges
[i
];
1738 if( vertex_tagged
[edge
->i0
] && vertex_tagged
[edge
->i1
] )
1742 free( edge_important
);
1744 int *faces_tagged
= malloc(mesh
->abpolys
.count
*sizeof(int));
1745 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
1746 faces_tagged
[i
] = -1;
1748 struct csolid
*candidates
;
1749 int *solid_buffer
= malloc( mesh
->abpolys
.count
*sizeof(int) ),
1750 solid_buffer_len
= 0,
1751 candidate_count
= 0;
1753 candidates
= malloc( mesh
->abpolys
.count
*sizeof(struct csolid
) );
1756 * Create a valid, non-overlapping solid for every face present in the mesh
1758 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
1760 if( faces_tagged
[i
] != -1 ) continue;
1761 faces_tagged
[i
] = i
;
1763 int *solid
= &solid_buffer
[ solid_buffer_len
];
1764 int len
= cxr_buildsolid( mesh
, i
, solid
, edge_tagged
, faces_tagged
);
1767 struct csolid
*csolid
= &candidates
[candidate_count
++];
1768 csolid
->start
= solid_buffer_len
;
1769 csolid
->count
= len
;
1770 csolid
->edge_count
= 0;
1772 v3_zero( csolid
->center
);
1773 for( int j
=0; j
<len
; j
++ )
1775 cxr_polygon
*polyj
= &mesh
->polys
[ solid
[j
] ];
1776 v3_add( polyj
->center
, csolid
->center
, csolid
->center
);
1777 csolid
->edge_count
+= polyj
->loop_total
;
1779 v3_divs( csolid
->center
, len
, csolid
->center
);
1780 solid_buffer_len
+= len
;
1783 free( edge_tagged
);
1784 free( vertex_tagged
);
1785 free( faces_tagged
);
1788 * Choosing the best solid: most defined manifold
1790 struct csolid
*best_solid
= NULL
;
1791 int fewest_manifold_splits
= INT32_MAX
;
1793 struct temp_manifold best_manifold
= { .loops
= NULL
, .loop_count
= 0 };
1794 int max_solid_faces
= 0;
1796 for( int i
=0; i
<candidate_count
; i
++ )
1798 struct csolid
*solid
= &candidates
[i
];
1799 max_solid_faces
= cxr_max(max_solid_faces
,solid
->count
);
1801 if( solid
->count
<= 2 )
1804 struct temp_manifold manifold
;
1805 cxr_link_manifold( mesh
, solid
, solid_buffer
, &manifold
);
1807 if( manifold
.status
== k_manifold_err
)
1809 *err
= k_soliderr_bad_manifold
;
1813 free(manifold
.loops
);
1814 free(best_manifold
.loops
);
1818 if( manifold
.status
== k_manifold_complete
)
1820 if( manifold
.split_count
< fewest_manifold_splits
)
1822 fewest_manifold_splits
= manifold
.split_count
;
1825 free( best_manifold
.loops
);
1826 best_manifold
= manifold
;
1831 if( manifold
.status
!= k_manifold_none
)
1832 free( manifold
.loops
);
1835 if( max_solid_faces
< 2 )
1837 *err
= k_soliderr_no_solids
;
1840 free(best_manifold
.loops
);
1844 if( best_solid
!= NULL
)
1846 cxr_mesh
*pullmesh
= cxr_alloc_mesh( best_solid
->edge_count
,
1847 best_solid
->edge_count
,
1851 for( int i
=0; i
<best_solid
->count
; i
++ )
1853 int nface_id
= pullmesh
->abpolys
.count
;
1854 int exist_plane_id
= solid_buffer
[best_solid
->start
+i
];
1856 cxr_polygon
*exist_face
= &mesh
->polys
[ exist_plane_id
],
1857 *new_face
= cxr_ab_empty( &pullmesh
->abpolys
);
1859 *new_face
= *exist_face
;
1860 new_face
->loop_start
= pullmesh
->abloops
.count
;
1862 for( int j
=0; j
<exist_face
->loop_total
; j
++ )
1864 cxr_loop
*exist_loop
= &mesh
->loops
[ exist_face
->loop_start
+j
],
1865 *new_loop
= cxr_ab_empty(&pullmesh
->abloops
);
1867 new_loop
->index
= exist_loop
->index
;
1868 new_loop
->poly_left
= nface_id
;
1869 new_loop
->poly_right
= -1;
1870 new_loop
->edge_index
= 0;
1871 v2_copy( exist_loop
->uv
, new_loop
->uv
);
1874 exist_face
->loop_total
= -1;
1878 int pullmesh_new_start
= pullmesh
->abpolys
.count
;
1880 if( fewest_manifold_splits
!= 0 )
1882 /* Unusual observation:
1883 * If the split count is odd, the manifold can be created easily
1885 * If it is even, implicit internal geometry is needed to be
1886 * constructed. So the manifold gets folded as we create it segment
1889 * I'm not sure if this is a well defined rule of geometry, but seems
1890 * to apply to the data we care about.
1892 int collapse_used_segments
= (u32
)fewest_manifold_splits
& 0x1? 0: 1;
1896 for( int j
=0; j
< best_manifold
.loop_count
; j
++ )
1898 if( !best_manifold
.loops
[j
].split
) continue;
1900 cxr_loop
*loop
= &best_manifold
.loops
[j
].loop
;
1902 for( int k
=1; k
< best_manifold
.loop_count
; k
++ )
1904 int index1
= cxr_range(j
+k
, best_manifold
.loop_count
);
1905 cxr_loop
*loop1
= &best_manifold
.loops
[index1
].loop
;
1907 if( best_manifold
.loops
[index1
].split
)
1914 if( new_polys
> best_manifold
.loop_count
)
1917 cxr_log( "Programming error: Too many new polys!\n" );
1922 if( cxr_create_poly( pullmesh
, k
+1 ) )
1924 for( int l
=0; l
<k
+1; l
++ )
1926 int i0
= cxr_range(j
+l
, best_manifold
.loop_count
),
1927 index
= best_manifold
.loops
[ i0
].loop
.index
;
1929 cxr_poly_push_index( pullmesh
, index
);
1931 cxr_poly_finish( pullmesh
);
1934 /* Collapse down manifold */
1935 if( collapse_used_segments
)
1937 best_manifold
.loops
[j
].split
= 0;
1938 best_manifold
.loops
[index1
].split
= 0;
1940 int new_length
= (best_manifold
.loop_count
-(k
-1));
1942 struct temp_manifold new_manifold
= {
1943 .loop_count
= new_length
1945 new_manifold
.loops
=
1946 malloc( new_length
*sizeof(*new_manifold
.loops
) );
1948 for( int l
=0; l
<new_length
; l
++ )
1950 int i_src
= cxr_range( j
+k
+l
, best_manifold
.loop_count
);
1951 new_manifold
.loops
[l
] = best_manifold
.loops
[i_src
];
1954 free( best_manifold
.loops
);
1955 best_manifold
= new_manifold
;
1957 goto manifold_repeat
;
1966 if( best_manifold
.loop_count
&& collapse_used_segments
)
1968 cxr_create_poly_full( pullmesh
, &best_manifold
);
1974 cxr_create_poly_full( pullmesh
, &best_manifold
);
1978 if( new_polys
>= 3 )
1980 if( !cxr_build_implicit_geo( pullmesh
, new_polys
, pullmesh_new_start
))
1984 free(best_manifold
.loops
);
1986 cxr_free_mesh( pullmesh
);
1987 *err
= k_soliderr_degenerate_implicit
;
1993 * Copy faces from the pullmesh into original, to patch up where there
1994 * would be gaps created
1996 for( int i
=0; i
<new_polys
; i
++ )
1998 int rface_id
= mesh
->abpolys
.count
;
1999 cxr_polygon
*pface
= &pullmesh
->polys
[pullmesh_new_start
+i
],
2000 *rip_face
= cxr_ab_empty(&mesh
->abpolys
);
2002 rip_face
->loop_start
= mesh
->abloops
.count
;
2003 rip_face
->loop_total
= pface
->loop_total
;
2004 rip_face
->material_id
= -1;
2006 for( int j
=0; j
<rip_face
->loop_total
; j
++ )
2009 &pullmesh
->loops
[ pface
->loop_start
+pface
->loop_total
-j
-1 ],
2010 *rloop
= cxr_ab_empty(&mesh
->abloops
);
2012 rloop
->index
= ploop
->index
;
2013 rloop
->poly_left
= rface_id
;
2014 rloop
->poly_right
= -1;
2015 rloop
->edge_index
= 0;
2016 v2_copy( ploop
->uv
, rloop
->uv
);
2019 v3_copy( pface
->center
, rip_face
->center
);
2020 v3_negate( pface
->normal
, rip_face
->normal
);
2023 cxr_mesh_update( mesh
);
2024 cxr_mesh_update( pullmesh
);
2026 cxr_mesh_clean_faces( mesh
);
2027 cxr_mesh_clean_edges( mesh
);
2028 cxr_mesh_clean_faces( pullmesh
);
2029 cxr_mesh_clean_edges( pullmesh
);
2033 free(best_manifold
.loops
);
2036 * Do final checks on the mesh to make sure we diddn't introduce any
2039 if( cxr_non_manifold_err( pullmesh
) || cxr_reflex_err( pullmesh
) )
2041 *err
= k_soliderr_bad_result
;
2050 free(best_manifold
.loops
);
2052 if( cxr_non_manifold_err( mesh
) || cxr_reflex_err( mesh
) )
2053 *err
= k_soliderr_bad_result
;
2059 * Convert from the format we recieve from blender into our internal format
2060 * with auto buffers.
2062 static cxr_mesh
*cxr_to_internal_format(
2063 cxr_static_mesh
*src
,
2064 cxr_abuffer
*abverts
2066 cxr_mesh
*mesh
= cxr_alloc_mesh( src
->edge_count
, src
->loop_count
,
2067 src
->poly_count
, abverts
);
2069 cxr_ab_init( abverts
, sizeof(v3f
), src
->vertex_count
);
2071 memcpy( mesh
->abedges
.arr
, src
->edges
, src
->edge_count
*sizeof(cxr_edge
));
2072 memcpy( mesh
->abpolys
.arr
, src
->polys
, src
->poly_count
*sizeof(cxr_polygon
));
2073 memcpy( abverts
->arr
, src
->vertices
, src
->vertex_count
*sizeof(v3f
));
2074 mesh
->abedges
.count
= src
->edge_count
;
2075 mesh
->abloops
.count
= src
->loop_count
;
2076 mesh
->abpolys
.count
= src
->poly_count
;
2078 cxr_mesh_update( mesh
);
2080 for( int i
=0; i
<src
->loop_count
; i
++ )
2082 cxr_loop
*lp
= &mesh
->loops
[i
];
2084 lp
->index
= src
->loops
[i
].index
;
2085 lp
->edge_index
= src
->loops
[i
].edge_index
;
2086 v2_copy( src
->loops
[i
].uv
, lp
->uv
);
2089 abverts
->count
= src
->vertex_count
;
2093 static int cxr_poly_convex( cxr_mesh
*mesh
, cxr_polygon
*poly
)
2095 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
2097 for( int i
=0; i
<poly
->loop_total
; i
++ )
2099 int li0
= poly
->loop_start
+ i
,
2100 li1
= poly
->loop_start
+ cxr_range( i
+1, poly
->loop_total
),
2101 li2
= poly
->loop_start
+ cxr_range( i
+2, poly
->loop_total
);
2102 int i0
= mesh
->loops
[li0
].index
,
2103 i1
= mesh
->loops
[li1
].index
,
2104 i2
= mesh
->loops
[li2
].index
;
2108 v3_sub( verts
[i1
], verts
[i0
], v0
);
2109 v3_sub( verts
[i2
], verts
[i1
], v1
);
2111 v3_cross( v0
, v1
, c
);
2112 if( v3_dot( c
, poly
->normal
) <= 0.0 )
2115 cxr_debug_line( verts
[i0
], verts
[i1
], colour_error
);
2116 cxr_debug_box( verts
[i1
], 0.1, colour_error
);
2117 cxr_debug_line( verts
[i1
], verts
[i2
], colour_error
);
2118 cxr_debug_line( verts
[i1
], poly
->center
, colour_error
);
2127 static int cxr_solid_checkerr( cxr_mesh
*mesh
)
2129 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
2132 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
2136 cxr_polygon
*poly
= &mesh
->polys
[i
];
2139 normal_to_plane( poly
->normal
, poly
->center
, plane
);
2141 for( int j
=0; j
<poly
->loop_total
; j
++ )
2143 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
2144 double *vert
= verts
[ loop
->index
];
2146 if( fabs(plane_polarity(plane
,vert
)) > 0.0025 )
2152 plane_project_point( plane
, vert
, ref
);
2155 cxr_debug_line( ref
, vert
, colour_error
);
2156 cxr_debug_box( vert
, 0.1, colour_error
);
2163 cxr_debug_poly( mesh
, poly
, colour_error
);
2170 CXR_API
void cxr_free_world( cxr_world
*world
)
2172 for( int i
=0; i
<world
->absolids
.count
; i
++ )
2174 cxr_solid
*solid
= cxr_ab_ptr( &world
->absolids
, i
);
2175 cxr_free_mesh( solid
->pmesh
);
2178 cxr_ab_free( &world
->abverts
);
2179 cxr_ab_free( &world
->absolids
);
2181 if( world
->materials
)
2183 for( int i
=0; i
<world
->material_count
; i
++ )
2184 free( world
->materials
[i
].name
);
2186 free( world
->materials
);
2191 CXR_API cxr_tri_mesh
*cxr_world_preview( cxr_world
*world
)
2193 cxr_tri_mesh
*out
= malloc( sizeof(cxr_tri_mesh
) );
2194 out
->vertex_count
= 0;
2195 out
->indices_count
= 0;
2197 for( int i
=0; i
<world
->absolids
.count
; i
++ )
2199 cxr_solid
*solid
= cxr_ab_ptr( &world
->absolids
, i
);
2200 cxr_mesh
*mesh
= solid
->pmesh
;
2202 for( int j
=0; j
<mesh
->abpolys
.count
; j
++ )
2204 cxr_polygon
*poly
= &mesh
->polys
[j
];
2206 out
->vertex_count
+= poly
->loop_total
* 3; /* Polygon, edge strip */
2207 out
->indices_count
+= (poly
->loop_total
-2) * 3; /* Polygon */
2208 out
->indices_count
+= poly
->loop_total
* 2 * 3; /* Edge strip */
2212 out
->colours
= malloc( sizeof(v4f
)*out
->vertex_count
);
2213 out
->vertices
= malloc( sizeof(v3f
)*out
->vertex_count
);
2214 out
->indices
= malloc( sizeof(i32
)*out
->indices_count
);
2216 v3f
*overts
= out
->vertices
;
2217 v4f
*colours
= out
->colours
;
2218 i32
*indices
= out
->indices
;
2223 for( int i
=0; i
<world
->absolids
.count
; i
++ )
2225 cxr_solid
*solid
= cxr_ab_ptr( &world
->absolids
, i
);
2226 cxr_mesh
*mesh
= solid
->pmesh
;
2228 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
2231 colour_random_brush( i
, colour
);
2233 for( int j
=0; j
<mesh
->abpolys
.count
; j
++ )
2235 cxr_polygon
*poly
= &mesh
->polys
[j
];
2239 for( int k
=0; k
<poly
->loop_total
-2; k
++ )
2245 indices
[ ii
++ ] = istart
+i0
;
2246 indices
[ ii
++ ] = istart
+i1
;
2247 indices
[ ii
++ ] = istart
+i2
;
2250 for( int k
=0; k
<poly
->loop_total
; k
++ )
2252 cxr_loop
*lp
= &mesh
->loops
[poly
->loop_start
+k
];
2255 i1r
= cxr_range(k
+1,poly
->loop_total
)*3+1,
2257 i1i
= cxr_range(k
+1,poly
->loop_total
)*3+2;
2259 indices
[ ii
++ ] = istart
+i0i
;
2260 indices
[ ii
++ ] = istart
+i1i
;
2261 indices
[ ii
++ ] = istart
+i1r
;
2263 indices
[ ii
++ ] = istart
+i0i
;
2264 indices
[ ii
++ ] = istart
+i1r
;
2265 indices
[ ii
++ ] = istart
+i0r
;
2268 v3_muladds( verts
[lp
->index
], poly
->normal
, 0.02, overts
[vi
] );
2269 v4_copy( colour
, colours
[ vi
] );
2274 v3_lerp( verts
[lp
->index
], poly
->center
, 0.2, inner
);
2275 v3_muladds( inner
, poly
->normal
, 0.015, overts
[ vi
] );
2276 v4_copy( colour
, colours
[ vi
] );
2277 v4_copy( (v4f
){ 0.0, 0.0, 0.0, 0.0 }, colours
[vi
] );
2280 v3_muladds(verts
[lp
->index
], poly
->normal
, 0.0, overts
[ vi
] );
2281 v4_copy( colour
, colours
[ vi
] );
2282 v4_copy( (v4f
){ 1.0, 1.0, 1.0, 0.125 }, colours
[vi
] );
2291 CXR_API
void cxr_free_tri_mesh( cxr_tri_mesh
*mesh
)
2293 free( mesh
->colours
);
2294 free( mesh
->indices
);
2295 free( mesh
->vertices
);
2299 CXR_API cxr_world
*cxr_decompose( cxr_static_mesh
*src
, i32
*perrcode
)
2301 /* Make sure data is in the mesh and isn't empty */
2302 if( !src
->edge_count
|| !src
->loop_count
|| !src
->poly_count
)
2304 cxr_log( "Error %d\n", k_soliderr_invalid_input
);
2306 *perrcode
= k_soliderr_invalid_input
;
2312 cxr_world
*world
= malloc( sizeof(*world
) );
2314 /* Copy data to internal formats */
2315 cxr_mesh
*main_mesh
= cxr_to_internal_format( src
, &world
->abverts
);
2316 cxr_ab_init( &world
->absolids
, sizeof(cxr_solid
), 2 );
2318 if( src
->material_count
)
2320 size_t dsize
= sizeof(cxr_material
) * src
->material_count
;
2321 world
->materials
= malloc( dsize
);
2322 memcpy( world
->materials
, src
->materials
, dsize
);
2324 for( int i
=0; i
<src
->material_count
; i
++ )
2326 world
->materials
[i
].name
= malloc(strlen(src
->materials
[i
].name
) +1);
2327 strcpy( world
->materials
[i
].name
, src
->materials
[i
].name
);
2329 world
->material_count
= src
->material_count
;
2331 else world
->materials
= NULL
;
2333 int invalid_count
= 0;
2336 * Preprocessor 1: Island seperation
2340 cxr_mesh
*res
= cxr_pull_island( main_mesh
);
2343 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ res
, 0, 0 });
2347 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ main_mesh
, 0, 0 } );
2350 * Preprocessor 2: Displacement processing & error checks
2352 for( int i
=0; i
<world
->absolids
.count
; i
++ )
2354 cxr_solid
*pinf
= cxr_ab_ptr(&world
->absolids
,i
);
2356 for( int j
=0; j
<pinf
->pmesh
->abpolys
.count
; j
++ )
2358 cxr_polygon
*poly
= &pinf
->pmesh
->polys
[ j
];
2360 for( int k
=0; k
<poly
->loop_total
; k
++ )
2362 cxr_loop
*lp
= &pinf
->pmesh
->loops
[ poly
->loop_start
+k
];
2363 cxr_edge
*edge
= &pinf
->pmesh
->edges
[ lp
->edge_index
];
2365 if( edge
->freestyle
)
2369 if( !cxr_poly_convex( pinf
->pmesh
, poly
) )
2373 error
= k_soliderr_non_convex_poly
;
2377 if( cxr_solid_checkerr( pinf
->pmesh
) )
2381 error
= k_soliderr_non_coplanar_vertices
;
2387 pinf
->displacement
= 1;
2391 * Main convex decomp algorithm
2393 int sources_count
= world
->absolids
.count
;
2398 for( int i
=0; i
<sources_count
; i
++ )
2400 cxr_solid pinf
= *(cxr_solid
*)cxr_ab_ptr(&world
->absolids
, i
);
2402 if( pinf
.displacement
|| pinf
.invalid
)
2407 cxr_mesh
*res
= cxr_pull_best_solid( pinf
.pmesh
, 0, &error
);
2411 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ res
, 0, 0 } );
2415 if( error
== k_soliderr_no_solids
)
2417 /* Retry if non-critical error, with extra edges */
2418 res
= cxr_pull_best_solid(pinf
.pmesh
, 1, &error
);
2421 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ res
, 0, 0 } );
2437 cxr_log( "Error %d\n", error
);
2438 cxr_free_world( world
);
2447 * format specific functions: vdf, vmf, (v)bsp
2448 * ----------------------------------------------------------------------------
2450 #ifdef CXR_VALVE_MAP_FILE
2452 CXR_API cxr_vdf
*cxr_vdf_open(const char *path
)
2454 cxr_vdf
*vdf
= malloc(sizeof(cxr_vdf
));
2457 vdf
->fp
= fopen( path
, "w" );
2468 CXR_API
void cxr_vdf_close(cxr_vdf
*vdf
)
2474 CXR_API
void cxr_vdf_put(cxr_vdf
*vdf
, const char *str
)
2476 for( int i
=0; i
<vdf
->level
; i
++ )
2477 fputs( " ", vdf
->fp
);
2479 fputs( str
, vdf
->fp
);
2482 static void cxr_vdf_printf( cxr_vdf
*vdf
, const char *fmt
, ... )
2484 cxr_vdf_put(vdf
,"");
2487 va_start( args
, fmt
);
2488 vfprintf( vdf
->fp
, fmt
, args
);
2492 CXR_API
void cxr_vdf_node(cxr_vdf
*vdf
, const char *str
)
2494 cxr_vdf_put( vdf
, str
);
2495 putc( (u8
)'\n', vdf
->fp
);
2496 cxr_vdf_put( vdf
, "{\n" );
2501 CXR_API
void cxr_vdf_edon( cxr_vdf
*vdf
)
2504 cxr_vdf_put( vdf
, "}\n" );
2507 CXR_API
void cxr_vdf_kv( cxr_vdf
*vdf
, const char *strk
, const char *strv
)
2509 cxr_vdf_printf( vdf
, "\"%s\" \"%s\"\n", strk
, strv
);
2513 * Data-type specific Keyvalues
2515 static void cxr_vdf_ki32( cxr_vdf
*vdf
, const char *strk
, i32 val
)
2517 cxr_vdf_printf( vdf
, "\"%s\" \"%d\"\n", strk
, val
);
2520 static void cxr_vdf_kdouble( cxr_vdf
*vdf
, const char *strk
, double val
)
2522 cxr_vdf_printf( vdf
, "\"%s\" \"%f\"\n", strk
, val
);
2525 static void cxr_vdf_kaxis( cxr_vdf
*vdf
, const char *strk
,
2526 v3f normal
, double offset
, double scale
2528 cxr_vdf_printf( vdf
, "\"%s\" \"[%f %f %f %f] %f\"\n",
2529 strk
, normal
[0], normal
[1],normal
[2], offset
, scale
);
2532 static void cxr_vdf_kv3f( cxr_vdf
*vdf
, const char *strk
, v3f v
)
2534 cxr_vdf_printf( vdf
, "\"%s\" \"[%f %f %f]\"\n", strk
, v
[0], v
[1], v
[2] );
2537 static void cxr_vdf_karrdouble( cxr_vdf
*vdf
, const char *strk
,
2538 int id
, double *doubles
, int count
2540 cxr_vdf_put(vdf
,"");
2541 fprintf( vdf
->fp
, "\"%s%d\" \"", strk
, id
);
2542 for( int i
=0; i
<count
; i
++ )
2544 if( i
== count
-1 ) fprintf( vdf
->fp
, "%f", doubles
[i
] );
2545 else fprintf( vdf
->fp
, "%f ", doubles
[i
] );
2547 fprintf( vdf
->fp
, "\"\n" );
2550 static void cxr_vdf_karrv3f( cxr_vdf
*vdf
, const char *strk
,
2551 int id
, v3f
*vecs
, int count
2553 cxr_vdf_put(vdf
,"");
2554 fprintf( vdf
->fp
, "\"%s%d\" \"", strk
, id
);
2555 for( int i
=0; i
<count
; i
++ )
2557 const char *format
= i
== count
-1? "%f %f %f": "%f %f %f ";
2558 fprintf( vdf
->fp
, format
, vecs
[i
][0], vecs
[i
][1], vecs
[i
][2] );
2560 fprintf( vdf
->fp
, "\"\n" );
2563 static void cxr_vdf_plane( cxr_vdf
*vdf
, const char *strk
, v3f a
, v3f b
, v3f c
)
2565 cxr_vdf_printf( vdf
, "\"%s\" \"(%f %f %f) (%f %f %f) (%f %f %f)\"\n",
2566 strk
, a
[0], a
[1], a
[2], b
[0], b
[1], b
[2], c
[0], c
[1], c
[2] );
2569 static void cxr_vdf_colour255(cxr_vdf
*vdf
, const char *strk
, v4f colour
)
2572 v4_muls( colour
, 255.0, scale
);
2573 cxr_vdf_printf( vdf
, "\"%s\" \"%d %d %d %d\"\n",
2574 strk
,(int)scale
[0], (int)scale
[1], (int)scale
[2], (int)scale
[3]);
2577 static struct cxr_material cxr_nodraw
=
2579 .res
= { 512, 512 },
2580 .name
= "tools/toolsnodraw"
2584 * Find most extreme point along a given direction
2586 static double support_distance( v3f verts
[3], v3f dir
, double coef
)
2590 coef
* v3_dot( verts
[0], dir
),
2593 coef
* v3_dot( verts
[1], dir
),
2594 coef
* v3_dot( verts
[2], dir
)
2600 * Convert regular UV'd triangle int Source's u/vaxis vectors
2602 * This supports affine move, scale, rotation, parallel skewing
2604 static void cxr_calculate_axis( cxr_texinfo
*transform
, v3f verts
[3],
2605 v2f uvs
[3], v2f texture_res
2607 v2f tT
, bT
; /* Tangent/bitangent pairs for UV space and world */
2610 v2_sub( uvs
[0], uvs
[1], tT
);
2611 v2_sub( uvs
[2], uvs
[1], bT
);
2612 v3_sub( verts
[0], verts
[1], tW
);
2613 v3_sub( verts
[2], verts
[1], bW
);
2615 /* Use arbitrary projection if there is no UV */
2616 if( v2_length( tT
) < 0.0001 || v2_length( bT
) < 0.0001 )
2618 v3f uaxis
, normal
, vaxis
;
2620 v3_copy( tW
, uaxis
);
2621 v3_normalize( uaxis
);
2623 v3_cross( tW
, bW
, normal
);
2624 v3_cross( normal
, uaxis
, vaxis
);
2625 v3_normalize( vaxis
);
2627 v3_copy( uaxis
, transform
->uaxis
);
2628 v3_copy( vaxis
, transform
->vaxis
);
2629 v2_zero( transform
->offset
);
2631 v2_div( (v2f
){128.0, 128.0}, texture_res
, transform
->scale
);
2632 transform
->winding
= 1.0;
2636 /* Detect if UV is reversed */
2637 double winding
= v2_cross( tT
, bT
) >= 0.0f
? 1.0f
: -1.0f
;
2639 /* UV projection reference */
2641 v2_muls((v2f
){1,0}, winding
, vX
);
2642 v2_muls((v2f
){0,1}, winding
, vY
);
2644 /* Reproject reference into world space, including skew */
2647 v3_muls( tW
, v2_cross(vX
,bT
) / v2_cross(bT
,tT
), uaxis1
);
2648 v3_muladds( uaxis1
, bW
, v2_cross(vX
, tT
) / v2_cross(tT
,bT
), uaxis1
);
2650 v3_muls( tW
, v2_cross(vY
,bT
) / v2_cross(bT
,tT
), vaxis1
);
2651 v3_muladds( vaxis1
, bW
, v2_cross(vY
,tT
) / v2_cross(tT
,bT
), vaxis1
);
2653 v3_normalize( uaxis1
);
2654 v3_normalize( vaxis1
);
2656 /* Apply source transform to axis (yes, they also need to be swapped) */
2657 v3f norm
, uaxis
, vaxis
;
2659 v3_cross( bW
, tW
, norm
);
2661 v3_cross( vaxis1
, norm
, uaxis
);
2662 v3_cross( uaxis1
, norm
, vaxis
);
2665 v2f uvmin
, uvmax
, uvdelta
;
2666 v2_minv( uvs
[0], uvs
[1], uvmin
);
2667 v2_minv( uvmin
, uvs
[2], uvmin
);
2668 v2_maxv( uvs
[0], uvs
[1], uvmax
);
2669 v2_maxv( uvmax
, uvs
[2], uvmax
);
2671 v2_sub( uvmax
, uvmin
, uvdelta
);
2673 /* world-uv scale */
2674 v2f uvminw
, uvmaxw
, uvdeltaw
;
2675 uvminw
[0] = -support_distance( verts
, uaxis
, -1.0f
);
2676 uvmaxw
[0] = support_distance( verts
, uaxis
, 1.0f
);
2677 uvminw
[1] = -support_distance( verts
, vaxis
, -1.0f
);
2678 uvmaxw
[1] = support_distance( verts
, vaxis
, 1.0f
);
2680 v2_sub( uvmaxw
, uvminw
, uvdeltaw
);
2684 v2_div( uvdeltaw
, uvdelta
, uv_scale
);
2685 v2_div( uv_scale
, texture_res
, uv_scale
);
2687 /* Find offset via 'natural' point */
2688 v2f target_uv
, natural_uv
, tex_offset
;
2689 v2_mul( uvs
[0], texture_res
, target_uv
);
2691 natural_uv
[0] = v3_dot( uaxis
, verts
[0] );
2692 natural_uv
[1] = -v3_dot( vaxis
, verts
[0] );
2693 v2_div( natural_uv
, uv_scale
, natural_uv
);
2695 tex_offset
[0] = target_uv
[0]-natural_uv
[0];
2696 tex_offset
[1] = -(target_uv
[1]-natural_uv
[1]);
2698 /* Copy everything into output */
2699 v3_copy( uaxis
, transform
->uaxis
);
2700 v3_copy( vaxis
, transform
->vaxis
);
2701 v2_copy( tex_offset
, transform
->offset
);
2702 v2_copy( uv_scale
, transform
->scale
);
2703 transform
->winding
= winding
;
2707 * Get the maximal direction of a vector, while also ignoring an axis
2710 static int cxr_cardinal( v3f a
, int ignore
)
2713 double component_max
= -CXR_BIG_NUMBER
;
2715 for( int i
=0; i
<3; i
++ )
2717 if( i
== ignore
) continue;
2719 if( fabs(a
[i
]) > component_max
)
2721 component_max
= fabs(a
[i
]);
2725 double d
= a
[component
] >= 0.0? 1.0: -1.0;
2733 * Convert contiguous mesh to displacement patch
2735 static int cxr_write_disp( cxr_mesh
*mesh
, cxr_world
*world
,
2736 cxr_vmf_context
*ctx
, cxr_vdf
*output
2738 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
2742 int con_start
, con_count
;
2750 *vertinfo
= malloc( sizeof(struct vertinfo
)*mesh
->p_abverts
->count
);
2751 int *graph
= malloc( sizeof(int) * mesh
->abedges
.count
*2 );
2754 for( int i
=0; i
<mesh
->p_abverts
->count
; i
++ )
2756 struct vertinfo
*info
= &vertinfo
[i
];
2757 info
->con_start
= con_pos
;
2758 info
->con_count
= 0;
2765 for( int j
=0; j
<mesh
->abedges
.count
; j
++ )
2767 cxr_edge
*edge
= &mesh
->edges
[j
];
2769 if( edge
->i0
== i
|| edge
->i1
== i
)
2771 graph
[ con_pos
++ ] = edge
->i0
== i
? edge
->i1
: edge
->i0
;
2774 if( edge
->freestyle
)
2780 v3f refv
, refu
, refn
;
2781 v3_zero(refv
); v3_zero(refu
); v3_zero(refn
);
2784 * Approximately match the area of the result brush faces to the actual
2787 * Necessary for accuracy and even lightmap texel allocation
2790 double uv_area
= 0.0, face_area
= 0.0, sf
;
2791 v2f uvboundmin
, uvboundmax
;
2792 v3f faceboundmin
, faceboundmax
;
2796 v2_fill( uvboundmin
, CXR_BIG_NUMBER
);
2797 v2_fill( uvboundmax
, -CXR_BIG_NUMBER
);
2798 v3_fill( faceboundmin
, CXR_BIG_NUMBER
);
2799 v3_fill( faceboundmax
, -CXR_BIG_NUMBER
);
2801 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
2803 cxr_polygon
*poly
= &mesh
->polys
[i
];
2805 for( int j
=0; j
<poly
->loop_total
; j
++ )
2807 cxr_loop
*lp0
= &mesh
->loops
[ poly
->loop_start
+j
];
2808 v2_minv( lp0
->uv
, uvboundmin
, uvboundmin
);
2809 v2_maxv( lp0
->uv
, uvboundmax
, uvboundmax
);
2810 v3_minv( verts
[lp0
->index
], faceboundmin
, faceboundmin
);
2811 v3_maxv( verts
[lp0
->index
], faceboundmax
, faceboundmax
);
2814 for( int j
=0; j
<poly
->loop_total
-2; j
++ )
2816 cxr_loop
*lp0
= &mesh
->loops
[poly
->loop_start
],
2817 *lp1
= &mesh
->loops
[poly
->loop_start
+j
+1],
2818 *lp2
= &mesh
->loops
[poly
->loop_start
+j
+2];
2821 v3_sub( verts
[lp1
->index
], verts
[lp0
->index
], va
);
2822 v3_sub( verts
[lp2
->index
], verts
[lp0
->index
], vb
);
2823 v3_cross( va
, vb
, orth
);
2825 face_area
+= v3_length( orth
) / 2.0;
2828 v2_sub( lp1
->uv
, lp0
->uv
, uva
);
2829 v2_sub( lp2
->uv
, lp0
->uv
, uvb
);
2831 uv_area
+= fabs(v2_cross( uva
, uvb
)) / 2.0;
2835 v3_add( faceboundmax
, faceboundmin
, face_center
);
2836 v3_muls( face_center
, 0.5, face_center
);
2837 v2_add( uvboundmin
, uvboundmax
, uv_center
);
2838 v2_muls( uv_center
, 0.5, uv_center
);
2840 sf
= sqrt( face_area
/ uv_area
);
2841 int corner_count
= 0;
2844 * Vertex classification
2845 * boundary vertices: they exist on a freestyle edge
2846 * corners: only connected to other boundaries
2848 for( int i
=0; i
<mesh
->p_abverts
->count
; i
++ )
2850 struct vertinfo
*info
= &vertinfo
[i
];
2851 if( !info
->boundary
) continue;
2856 for( int j
=0; j
<info
->con_count
; j
++ )
2858 int con
= graph
[info
->con_start
+j
];
2860 if( vertinfo
[con
].boundary
)
2866 if( count
> 2 || non_manifold
)
2874 * TODO(harry): This currently only supports power 2 displacements
2875 * its quite straightforward to upgrade it.
2877 * TODO(harry): Error checking is needed here for bad input data
2885 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
2887 cxr_polygon
*basepoly
= &mesh
->polys
[i
];
2889 for( int h
=0; h
<basepoly
->loop_total
; h
++ )
2892 i1
= cxr_range(h
+1,basepoly
->loop_total
);
2894 cxr_loop
*l0
= &mesh
->loops
[ basepoly
->loop_start
+i0
],
2895 *l1
= &mesh
->loops
[ basepoly
->loop_start
+i1
];
2896 struct vertinfo
*info
= &vertinfo
[ l0
->index
];
2901 int corner_count
= 1;
2903 cxr_material
*matptr
=
2904 basepoly
->material_id
< 0 || !world
->materials
?
2906 &world
->materials
[ basepoly
->material_id
];
2909 dispedge
[0] = l0
->index
;
2910 dispedge
[1] = l1
->index
;
2911 v2_copy( l0
->uv
, corner_uvs
[0] );
2913 /* Consume (use) face from orignal mesh */
2914 basepoly
->loop_total
= -1;
2916 while( dispedge_count
< 17 )
2918 struct vertinfo
*edge_head
=
2919 &vertinfo
[dispedge
[dispedge_count
-1]];
2923 if( edge_head
->corner
)
2925 /* Find polygon that has edge C-1 -> C */
2926 for( int j
=0; j
<mesh
->abpolys
.count
&& !newvert
; j
++ )
2928 cxr_polygon
*poly
= &mesh
->polys
[j
];
2930 for( int k
=0; k
<poly
->loop_total
; k
++ )
2933 i1
= cxr_range(k
+1,poly
->loop_total
);
2935 cxr_loop
*l0
= &mesh
->loops
[ poly
->loop_start
+i0
],
2936 *l1
= &mesh
->loops
[ poly
->loop_start
+i1
];
2938 if( l0
->index
== dispedge
[dispedge_count
-2] &&
2939 l1
->index
== dispedge
[dispedge_count
-1] )
2941 /* Take the next edge */
2942 v2_copy( l1
->uv
, corner_uvs
[corner_count
++] );
2944 int i2
= cxr_range(i1
+1,poly
->loop_total
);
2945 cxr_loop
*l2
= &mesh
->loops
[ poly
->loop_start
+i2
];
2947 dispedge
[dispedge_count
++] = l2
->index
;
2949 poly
->loop_total
= -1;
2957 for( int j
=0; j
<edge_head
->con_count
; j
++ )
2959 int con
= graph
[edge_head
->con_start
+j
];
2964 if( dispedge_count
> 1 )
2965 if( con
== dispedge
[dispedge_count
-2] )
2968 struct vertinfo
*coninfo
= &vertinfo
[con
];
2970 if( !coninfo
->boundary
)
2973 dispedge
[ dispedge_count
++ ] = con
;
2988 /* All edges collected */
2991 v2_sub( corner_uvs
[1], corner_uvs
[0], va
);
2992 v2_sub( corner_uvs
[2], corner_uvs
[0], vb
);
2994 /* Connect up the grid
3002 * Example: a := common unused vertex that is connected to
3003 * by 1 and 15. Or y-1, and x-1 on the grid.
3004 * g := c and f common vert ^
3009 for( int j
=0; j
<5; j
++ ) grid
[j
] = dispedge
[j
];
3010 for( int j
=1; j
<5; j
++ ) grid
[j
*5+4] = dispedge
[j
+4];
3011 for( int j
=0; j
<4; j
++ ) grid
[4*5+3-j
] = dispedge
[j
+9];
3012 for( int j
=1; j
<4; j
++ ) grid
[j
*5] = dispedge
[16-j
];
3015 for( int j
=1; j
<4; j
++ )
3017 for( int k
=1; k
<4; k
++ )
3019 int s0
= grid
[(j
-1)*5+k
],
3022 struct vertinfo
*va
= &vertinfo
[s0
],
3023 *vb
= &vertinfo
[s1
];
3025 /* Find common non-used vertex */
3026 for( int l
=0; l
<va
->con_count
; l
++ )
3028 for( int m
=0; m
<vb
->con_count
; m
++ )
3030 int cona
= graph
[va
->con_start
+l
],
3031 conb
= graph
[vb
->con_start
+m
];
3035 if( vertinfo
[cona
].used
|| vertinfo
[cona
].boundary
)
3038 grid
[ j
*5+k
] = cona
;
3039 vertinfo
[cona
].used
= 1;
3055 * Create V reference based on first displacement.
3056 * TODO(harry): This is not the moststable selection method!
3057 * faces can come in any order, so the first disp will of
3058 * course always vary. Additionaly the triangle can be oriented
3061 * Improvement can be made by selecting a first disp/triangle
3062 * based on deterministic factors.
3064 if( disp_count
== 0 )
3068 v3_copy( verts
[dispedge
[0]], tri_ref
[0] );
3069 v3_copy( verts
[dispedge
[4]], tri_ref
[1] );
3070 v3_copy( verts
[dispedge
[8]], tri_ref
[2] );
3071 cxr_calculate_axis( &tx
, tri_ref
, corner_uvs
, (v2f
){512,512} );
3073 v3_muls( tx
.vaxis
, -1.0, refv
);
3074 int v_cardinal
= cxr_cardinal( refv
, -1 );
3076 v3_cross( tx
.vaxis
, tx
.uaxis
, refn
);
3077 v3_muls( refn
, -tx
.winding
, refn
);
3079 /* Computing new reference vectors */
3080 int n1_cardinal
= cxr_cardinal( refn
, v_cardinal
);
3084 for( int j
=0; j
<2; j
++ )
3085 if( u_cardinal
== n1_cardinal
|| u_cardinal
== v_cardinal
)
3089 refu
[u_cardinal
] = tx
.uaxis
[u_cardinal
] > 0.0? 1.0: -1.0;
3093 v3_copy( face_center
, p0
);
3094 v3_muladds( face_center
, refn
, 1.5, pn
);
3095 v3_muladds( face_center
, refv
, 1.5, pv
);
3096 v3_muladds( face_center
, refu
, 1.5, pu
);
3098 v3_muladds( face_center
, refn
, 2.0, face_center
);
3101 /* Create world coordinates */
3102 v3f world_corners
[8];
3105 for( int j
=0; j
<4; j
++ )
3108 v2_sub( corner_uvs
[j
], uv_center
, local_uv
);
3109 v2_copy( corner_uvs
[j
], world_uv
[j
] );
3110 v2_muls( local_uv
, sf
, local_uv
);
3112 v3_muls( refu
, local_uv
[0], world_corners
[j
] );
3113 v3_muladds( world_corners
[j
],refv
,local_uv
[1],world_corners
[j
] );
3114 v3_add( face_center
, world_corners
[j
], world_corners
[j
] );
3117 double *colour
= colours_random
[cxr_range(disp_count
,8)];
3119 for( int j
=0; j
<4; j
++ )
3120 v3_muladds( world_corners
[j
], refn
, -1.0, world_corners
[j
+4] );
3122 /* Apply world transform */
3123 for( int j
=0; j
<8; j
++ )
3125 double *p0
= world_corners
[j
];
3126 v3_muls( p0
, ctx
->scale
, p0
);
3127 v3_add( p0
, ctx
->offset
, p0
);
3130 cxr_texinfo texinfo_shared
;
3131 cxr_calculate_axis( &texinfo_shared
, world_corners
, world_uv
,
3132 (v2f
){ matptr
->res
[0], matptr
->res
[1] } );
3135 cxr_vdf_node( output
, "solid" );
3136 cxr_vdf_ki32( output
, "id", ++ ctx
->brush_count
);
3147 double distances
[25];
3149 v3f lside0
, lside1
, lref
, vdelta
, vworld
;
3152 for( int j
=0; j
<5; j
++ )
3154 ty
= (double)j
/(double)(5-1);
3156 v3_lerp( world_corners
[0], world_corners
[3], ty
, lside0
);
3157 v3_lerp( world_corners
[1], world_corners
[2], ty
, lside1
);
3159 for( int k
=0; k
<5; k
++ )
3163 tx
= (double)k
/(double)(5-1);
3164 v3_lerp( lside0
, lside1
, tx
, lref
);
3165 v3_muls( verts
[grid
[index
]], ctx
->scale
, vworld
);
3166 v3_add( ctx
->offset
, vworld
, vworld
);
3168 v3_sub( vworld
, lref
, vdelta
);
3169 v3_copy( vdelta
, normals
[index
] );
3170 v3_normalize( normals
[index
] );
3171 distances
[index
] = v3_dot( vdelta
, normals
[index
] );
3175 for( int j
=0; j
<6; j
++ )
3177 int *side
= sides
[j
];
3179 cxr_vdf_node( output
, "side" );
3180 cxr_vdf_ki32( output
, "id", ++ ctx
->face_count
);
3181 cxr_vdf_plane( output
, "plane", world_corners
[side
[2]],
3182 world_corners
[side
[1]],
3183 world_corners
[side
[0]] );
3185 cxr_vdf_kv( output
, "material", matptr
->name
);
3186 cxr_vdf_kaxis( output
, "uaxis",
3187 texinfo_shared
.uaxis
,
3188 texinfo_shared
.offset
[0],
3189 texinfo_shared
.scale
[0] );
3190 cxr_vdf_kaxis( output
, "vaxis",
3191 texinfo_shared
.vaxis
,
3192 texinfo_shared
.offset
[1],
3193 texinfo_shared
.scale
[1] );
3195 cxr_vdf_kdouble( output
, "rotation", 0.0 );
3196 cxr_vdf_ki32( output
, "lightmapscale", ctx
->lightmap_scale
);
3197 cxr_vdf_ki32( output
, "smoothing_groups", 0 );
3201 cxr_vdf_node( output
, "dispinfo" );
3202 cxr_vdf_ki32( output
, "power", 2 );
3203 cxr_vdf_kv3f( output
, "startposition", world_corners
[0] );
3204 cxr_vdf_ki32( output
, "flags", 0 );
3205 cxr_vdf_kdouble( output
, "elevation", 0.0 );
3206 cxr_vdf_ki32( output
, "subdiv", 0 );
3208 cxr_vdf_node( output
, "normals" );
3209 for( int k
=0; k
<5; k
++ )
3210 cxr_vdf_karrv3f( output
, "row", k
, &normals
[k
*5], 5 );
3211 cxr_vdf_edon( output
);
3213 cxr_vdf_node( output
, "distances" );
3214 for( int k
=0; k
<5; k
++ )
3215 cxr_vdf_karrdouble( output
, "row", k
, &distances
[k
*5], 5 );
3216 cxr_vdf_edon( output
);
3219 * TODO: This might be needed for the compilers. Opens fine in
3224 cxr_vdf_node( output, "offsets" );
3225 for( int k=0; k<5; k++ )
3226 cxr_vdf_printf( output,
3227 "\"row%d\" \"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\"\n", k );
3228 cxr_vdf_edon( output );
3230 cxr_vdf_node( output, "offset_normals" );
3231 for( int k=0; k<5; k++ )
3232 cxr_vdf_printf( output,
3233 "\"row%d\" \"0 0 1 0 0 1 0 0 1 0 0 1 0 0 1\"\n", k );
3234 cxr_vdf_edon( output );
3236 cxr_vdf_node( output, "alphas" );
3237 for( int k=0; k<5; k++ )
3238 cxr_vdf_printf( output, "\"row%d\" \"0 0 0 0 0\"\n", k );
3239 cxr_vdf_edon( output );
3241 cxr_vdf_node( output, "triangle_tags" );
3242 for( int k=0; k<5-1; k++ )
3243 cxr_vdf_printf( output,
3244 "\"row%d\" \"9 9 9 9 9 9 9 9\"\n", k );
3245 cxr_vdf_edon( output );
3247 cxr_vdf_node( output, "allowed_verts" );
3248 cxr_vdf_printf( output,
3249 "\"10\" \"-1 -1 -1 -1 -1 -1 -1 -1 -1 -1\"\n" );
3250 cxr_vdf_edon( output );
3253 cxr_vdf_edon( output
);
3256 cxr_vdf_edon( output
);
3259 cxr_vdf_node( output
, "editor");
3260 cxr_vdf_colour255( output
, "color",
3261 colours_random
[cxr_range(ctx
->brush_count
,8)]);
3263 cxr_vdf_ki32( output
, "visgroupid", ctx
->visgroupid
);
3264 cxr_vdf_ki32( output
, "visgroupshown",1);
3265 cxr_vdf_ki32( output
, "visgroupautoshown",1);
3266 cxr_vdf_edon( output
);
3268 cxr_vdf_edon( output
);
3280 * Write header information for a vmf to vdf
3282 CXR_API
void cxr_begin_vmf( cxr_vmf_context
*ctx
, cxr_vdf
*output
)
3284 cxr_vdf_node( output
, "versioninfo" );
3285 cxr_vdf_ki32( output
, "editorversion", 400 );
3286 cxr_vdf_ki32( output
, "editorbuild", 8456 );
3287 cxr_vdf_ki32( output
, "mapversion", ctx
->mapversion
);
3288 cxr_vdf_ki32( output
, "formatversion", 100 );
3289 cxr_vdf_ki32( output
, "prefab", 0 );
3290 cxr_vdf_edon( output
);
3292 cxr_vdf_node( output
, "visgroups" );
3294 for( int i
=0; i
<ctx
->visgroup_count
; i
++ )
3296 cxr_vdf_node( output
, "visgroup" );
3297 cxr_vdf_kv( output
, "name", ctx
->visgroups
[i
].name
);
3298 cxr_vdf_ki32( output
, "visgroupid", i
+1 );
3299 cxr_vdf_edon( output
);
3302 cxr_vdf_edon( output
);
3304 cxr_vdf_node( output
, "viewsettings" );
3305 cxr_vdf_ki32( output
, "bSnapToGrid", 1 );
3306 cxr_vdf_ki32( output
, "bShowGrid", 1 );
3307 cxr_vdf_ki32( output
, "bShowLogicalGrid", 0 );
3308 cxr_vdf_ki32( output
, "nGridSpacing", 64 );
3309 cxr_vdf_ki32( output
, "bShow3DGrid", 0 );
3310 cxr_vdf_edon( output
);
3312 cxr_vdf_node( output
, "world" );
3313 cxr_vdf_ki32( output
, "id", 1 );
3314 cxr_vdf_ki32( output
, "mapversion", 1 ); /* ?? */
3315 cxr_vdf_kv( output
, "classname", "worldspawn" );
3316 cxr_vdf_kv( output
, "skyname", ctx
->skyname
);
3317 cxr_vdf_ki32( output
, "maxpropscreenwidth", -1 );
3318 cxr_vdf_kv( output
, "detailvbsp", ctx
->detailvbsp
);
3319 cxr_vdf_kv( output
, "detailmaterial", ctx
->detailmaterial
);
3322 /* Fairly useless but might need in the future */
3323 CXR_API
void cxr_vmf_begin_entities( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
)
3325 cxr_vdf_edon( vdf
);
3328 CXR_API
void cxr_end_vmf( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
)
3333 * Write solids (and displacements) to VMF file
3335 CXR_API
void cxr_push_world_vmf( cxr_world
*world
, cxr_vmf_context
*ctx
,
3338 v3f
*verts
= cxr_ab_ptr( &world
->abverts
, 0 );
3340 /* Write all solids as VMF brushes */
3341 for( int i
=0; i
<world
->absolids
.count
; i
++ )
3343 cxr_solid
*solid
= cxr_ab_ptr(&world
->absolids
,i
);
3345 if( solid
->displacement
)
3347 if( !cxr_write_disp( solid
->pmesh
, world
, ctx
, output
) )
3349 cxr_log( "Warning: Invalid displacement\n" );
3354 cxr_vdf_node( output
, "solid" );
3355 cxr_vdf_ki32( output
, "id", ++ ctx
->brush_count
);
3357 for( int j
=0; j
<solid
->pmesh
->abpolys
.count
; j
++ )
3359 cxr_polygon
*poly
= &solid
->pmesh
->polys
[j
];
3360 cxr_loop
*ploops
= &solid
->pmesh
->loops
[poly
->loop_start
];
3362 cxr_material
*matptr
=
3363 poly
->material_id
< 0 || !world
->materials
?
3365 &world
->materials
[ poly
->material_id
];
3367 cxr_vdf_node( output
, "side" );
3368 cxr_vdf_ki32( output
, "id", ++ ctx
->face_count
);
3370 v3f tri
[3]; v2f uvs
[3];
3372 int i0
= ploops
[0].index
,
3373 i1
= ploops
[1].index
,
3374 i2
= ploops
[2].index
;
3376 v3_muls( verts
[i0
], ctx
->scale
, tri
[0] );
3377 v3_muls( verts
[i1
], ctx
->scale
, tri
[1] );
3378 v3_muls( verts
[i2
], ctx
->scale
, tri
[2] );
3380 v3_add( ctx
->offset
, tri
[0], tri
[0] );
3381 v3_add( ctx
->offset
, tri
[1], tri
[1] );
3382 v3_add( ctx
->offset
, tri
[2], tri
[2] );
3384 v2_copy( ploops
[0].uv
, uvs
[0] );
3385 v2_copy( ploops
[1].uv
, uvs
[1] );
3386 v2_copy( ploops
[2].uv
, uvs
[2] );
3388 cxr_vdf_plane( output
, "plane", tri
[2], tri
[1], tri
[0] );
3389 cxr_vdf_kv( output
, "material", matptr
->name
);
3392 cxr_calculate_axis( &tx
, tri
, uvs
,
3393 (double[2]){ matptr
->res
[0], matptr
->res
[1] });
3395 cxr_vdf_kaxis( output
, "uaxis", tx
.uaxis
, tx
.offset
[0], tx
.scale
[0]);
3396 cxr_vdf_kaxis( output
, "vaxis", tx
.vaxis
, tx
.offset
[1], tx
.scale
[1]);
3398 cxr_vdf_kdouble( output
, "rotation", 0.0 );
3399 cxr_vdf_ki32( output
, "lightmapscale", ctx
->lightmap_scale
);
3400 cxr_vdf_ki32( output
, "smoothing_groups", 0);
3402 cxr_vdf_edon( output
);
3405 cxr_vdf_node( output
, "editor" );
3406 cxr_vdf_colour255( output
, "color",
3407 colours_random
[cxr_range(ctx
->brush_count
,8)]);
3409 cxr_vdf_ki32( output
, "visgroupid", ctx
->visgroupid
);
3410 cxr_vdf_ki32( output
, "visgroupshown", 1 );
3411 cxr_vdf_ki32( output
, "visgroupautoshown", 1 );
3412 cxr_vdf_edon( output
);
3414 cxr_vdf_edon( output
);
3419 * Valve Source SDK 2015 CS:GO
3421 #define HEADER_LUMPS 64
3422 #define LUMP_WORLDLIGHTS 54
3424 #pragma pack(push,1)
3433 int fileofs
, filelen
;
3438 lumps
[ HEADER_LUMPS
];
3448 float shadow_cast_offset
[3];
3456 float constant_attn
;
3458 float quadratic_attn
;
3466 * Utility for patching BSP tools to remove -1 distance lights (we set them
3467 * like that, because we want these lights to go away)
3469 * Yes, there is no way to do this in hammer
3470 * Yes, the distance KV is unused but still gets compiled to this lump
3471 * No, Entities only compile will not do this for you
3473 CXR_API
int cxr_lightpatch_bsp( const char *path
)
3475 printf( "Lightpatch: %s\n", path
);
3477 FILE *fp
= fopen( path
, "r+b" );
3482 cxr_log( "Could not open BSP file for editing (r+b)\n" );
3488 struct header header
;
3489 fread( &header
, sizeof(struct header
), 1, fp
);
3490 struct lump
*lump
= &header
.lumps
[ LUMP_WORLDLIGHTS
];
3492 /* Read worldlight array */
3493 struct worldlight
*lights
= malloc( lump
->filelen
);
3494 fseek( fp
, lump
->fileofs
, SEEK_SET
);
3495 fread( lights
, lump
->filelen
, 1, fp
);
3497 /* Remove all marked lights */
3498 int light_count
= lump
->filelen
/ sizeof(struct worldlight
);
3501 for( int i
= 0; i
< light_count
; i
++ )
3502 if( lights
[i
].radius
>= 0.0f
)
3503 lights
[new_count
++] = lights
[i
];
3505 lump
->filelen
= new_count
*sizeof(struct worldlight
);
3507 /* Write changes back to file */
3508 fseek( fp
, lump
->fileofs
, SEEK_SET
);
3509 fwrite( lights
, lump
->filelen
, 1, fp
);
3510 fseek( fp
, 0, SEEK_SET
);
3511 fwrite( &header
, sizeof(struct header
), 1, fp
);
3514 cxr_log( "removed %d marked lights\n", light_count
-new_count
);
3522 #endif /* CXR_VALVE_MAP_FILE */
3523 #endif /* CXR_IMPLEMENTATION */