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
, i32
*perrcode
);
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
,
280 k_soliderr_non_coplanar_vertices
,
281 k_soliderr_non_convex_poly
286 * -----------------------------------------------------------------------------
288 #ifdef CXR_IMPLEMENTATION
290 const char *cxr_build_time
= __DATE__
" @" __TIME__
;
293 static void (*cxr_log_func
)(const char *str
);
294 static void (*cxr_line_func
)( v3f p0
, v3f p1
, v4f colour
);
296 static int cxr_range(int x
, int bound
)
299 x
+= bound
* (x
/bound
+ 1);
305 * This should be called after appending any data to those buffers
307 static void cxr_mesh_update( cxr_mesh
*mesh
)
309 mesh
->edges
= cxr_ab_ptr(&mesh
->abedges
, 0);
310 mesh
->polys
= cxr_ab_ptr(&mesh
->abpolys
, 0);
311 mesh
->loops
= cxr_ab_ptr(&mesh
->abloops
, 0);
314 static v4f colours_random
[] =
316 { 0.863, 0.078, 0.235, 0.4 },
317 { 0.000, 0.980, 0.604, 0.4 },
318 { 0.118, 0.565, 1.000, 0.4 },
319 { 0.855, 0.439, 0.839, 0.4 },
320 { 0.824, 0.412, 0.118, 0.4 },
321 { 0.125, 0.698, 0.667, 0.4 },
322 { 0.541, 0.169, 0.886, 0.4 },
323 { 1.000, 0.843, 0.000, 0.4 }
326 static v4f colours_solids
[] =
328 { 100, 143, 255, 200 },
329 { 120, 94, 240, 200 },
330 { 220, 38, 127, 200 },
335 static v4f colour_entity
= { 37, 241, 122, 255 };
336 static v4f colour_displacement_solid
= { 146, 146, 146, 120 };
337 static v4f colour_error
= { 1.0f
, 0.0f
, 0.0f
, 1.0f
};
338 static v4f colour_face_graph
= { 1.0f
, 1.0f
, 1.0f
, 0.03f
};
339 static v4f colour_success
= { 0.0f
, 1.0f
, 0.0f
, 1.0f
};
341 static void value_random(int n
, v4f colour
)
343 double val
= cxr_range(n
,8);
347 v3_muls( colour
, val
, colour
);
350 static void colour_random_brush(int n
, v4f colour
)
354 int colour_n
= cxr_range( n
, 5 );
355 v4_muls( colours_solids
[ colour_n
], 1.0/255.0, colour
);
356 value_random( value_n
, colour
);
358 int colour_n
= cxr_range( n
, 8 );
359 v4_copy( colours_random
[ colour_n
], colour
);
364 * Debugging and diagnostic utilities
365 * -----------------------------------------------------------------------------
370 static void cxr_log( const char *fmt
, ... )
375 va_start( args
, fmt
);
376 vsnprintf( buf
, sizeof(buf
)-1, fmt
, args
);
385 static void cxr_debug_line( v3f p0
, v3f p1
, v4f colour
)
388 cxr_line_func( p0
, p1
, colour
);
391 static void cxr_debug_box( v3f p0
, double sz
, v4f colour
)
395 v3_add(p0
, (v3f
){-sz
,-sz
,-sz
}, a
);
396 v3_add(p0
, (v3f
){-sz
, sz
,-sz
}, b
);
397 v3_add(p0
, (v3f
){ sz
, sz
,-sz
}, c
);
398 v3_add(p0
, (v3f
){ sz
,-sz
,-sz
}, d
);
399 v3_add(p0
, (v3f
){-sz
,-sz
,sz
}, a1
);
400 v3_add(p0
, (v3f
){-sz
, sz
,sz
}, b1
);
401 v3_add(p0
, (v3f
){ sz
, sz
,sz
}, c1
);
402 v3_add(p0
, (v3f
){ sz
,-sz
,sz
}, d1
);
404 cxr_debug_line( a
,b
, colour
);
405 cxr_debug_line( b
,c
, colour
);
406 cxr_debug_line( c
,d
, colour
);
407 cxr_debug_line( d
,a
, colour
);
408 cxr_debug_line( a1
,b1
, colour
);
409 cxr_debug_line( b1
,c1
, colour
);
410 cxr_debug_line( c1
,d1
, colour
);
411 cxr_debug_line( d1
,a1
, colour
);
412 cxr_debug_line( a
,a1
, colour
);
413 cxr_debug_line( b
,b1
, colour
);
414 cxr_debug_line( c
,c1
, colour
);
415 cxr_debug_line( d
,d1
, colour
);
419 * Draw arrow with the tips oriented along normal
421 static void cxr_debug_arrow( v3f p0
, v3f p1
, v3f normal
, double sz
, v4f colour
)
423 v3f dir
, tan
, p2
, p3
;
427 v3_cross(dir
,normal
,tan
);
428 v3_muladds( p1
,dir
, -sz
, p2
);
429 v3_muladds( p2
,tan
,sz
,p3
);
430 cxr_debug_line( p1
, p3
, colour
);
431 v3_muladds( p2
,tan
,-sz
,p3
);
432 cxr_debug_line( p1
, p3
, colour
);
433 cxr_debug_line( p0
, p1
, colour
);
437 * Draw arrows CCW around polygon, draw normal vector from center
439 static void cxr_debug_poly( cxr_mesh
*mesh
, cxr_polygon
*poly
, v4f colour
)
441 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
443 for( int i
=0; i
<poly
->loop_total
; i
++ )
445 int lp0
= poly
->loop_start
+i
,
446 lp1
= poly
->loop_start
+cxr_range(i
+1,poly
->loop_total
);
448 int i0
= mesh
->loops
[ lp0
].index
,
449 i1
= mesh
->loops
[ lp1
].index
;
453 v3_lerp( verts
[i0
], poly
->center
, 0.0075, p0
);
454 v3_lerp( verts
[i1
], poly
->center
, 0.0075, p1
);
455 v3_muladds( p0
, poly
->normal
, 0.01, p0
);
456 v3_muladds( p1
, poly
->normal
, 0.01, p1
);
458 cxr_debug_arrow( p0
, p1
, poly
->normal
, 0.05, colour
);
462 v3_muladds( poly
->center
, poly
->normal
, 0.3, nrm0
);
464 cxr_debug_line( poly
->center
, nrm0
, colour
);
467 static void cxr_debug_mesh(cxr_mesh
*mesh
, v4f colour
)
469 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
471 cxr_polygon
*poly
= &mesh
->polys
[i
];
472 cxr_debug_poly( mesh
, poly
, colour
);
476 CXR_API
void cxr_write_test_data( cxr_static_mesh
*src
)
479 "/home/harry/Documents/blender_addons_remote/addons/convexer/cxr/solid.h",
482 fprintf( fp
, "v3f test_verts[] = {\n" );
483 for( int i
=0; i
<src
->vertex_count
; i
++ )
485 fprintf( fp
, " { %f, %f, %f },\n",
488 src
->vertices
[i
][2] );
490 fprintf( fp
, "};\n" );
492 fprintf( fp
, "struct cxr_static_loop test_loops[] = {\n" );
493 for( int i
=0; i
<src
->loop_count
; i
++ )
495 fprintf( fp
, " {%d, %d},\n",
497 src
->loops
[i
].edge_index
);
499 fprintf( fp
, "};\n" );
501 fprintf( fp
, "struct cxr_polygon test_polys[] = {\n" );
502 for( int i
=0; i
<src
->poly_count
; i
++ )
504 fprintf( fp
, " {%d, %d, {%f, %f, %f}, {%f, %f, %f}},\n",
505 src
->polys
[i
].loop_start
,
506 src
->polys
[i
].loop_total
,
507 src
->polys
[i
].normal
[0],
508 src
->polys
[i
].normal
[1],
509 src
->polys
[i
].normal
[2],
510 src
->polys
[i
].center
[0],
511 src
->polys
[i
].center
[1],
512 src
->polys
[i
].center
[2] );
514 fprintf( fp
, "};\n" );
516 fprintf( fp
, "struct cxr_edge test_edges[] = {\n" );
517 for( int i
=0; i
<src
->edge_count
; i
++ )
519 fprintf( fp
, " {%d, %d, %d},\n",
522 src
->edges
[i
].freestyle
525 fprintf( fp
, "};\n" );
527 fprintf( fp
, "struct cxr_static_mesh test_mesh = {\n" );
528 fprintf( fp
, " .vertices = test_verts,\n" );
529 fprintf( fp
, " .loops = test_loops,\n" );
530 fprintf( fp
, " .edges = test_edges,\n" );
531 fprintf( fp
, " .polys = test_polys,\n" );
532 fprintf( fp
, " .poly_count=%d,\n", src
->poly_count
);
533 fprintf( fp
, " .vertex_count=%d,\n", src
->vertex_count
);
534 fprintf( fp
, " .edge_count=%d,\n",src
->edge_count
);
535 fprintf( fp
, " .loop_count=%d\n", src
->loop_count
);
536 fprintf( fp
, "};\n" );
541 CXR_API
void cxr_set_log_function( void (*func
)(const char *str
) )
546 CXR_API
void cxr_set_line_function( void (*func
)(v3f p0
, v3f p1
, v4f colour
) )
548 cxr_line_func
= func
;
551 #endif /* CXR_DEBUG */
555 * abverts is a pointer to an existing vertex buffer
557 static cxr_mesh
*cxr_alloc_mesh( int edge_count
, int loop_count
, int poly_count
,
560 cxr_mesh
*mesh
= malloc(sizeof(cxr_mesh
));
561 cxr_ab_init(&mesh
->abedges
, sizeof(cxr_edge
), edge_count
);
562 cxr_ab_init(&mesh
->abloops
, sizeof(cxr_loop
), loop_count
);
563 cxr_ab_init(&mesh
->abpolys
, sizeof(cxr_polygon
), poly_count
);
564 mesh
->p_abverts
= abverts
;
566 cxr_mesh_update( mesh
);
571 static void cxr_free_mesh( cxr_mesh
*mesh
)
573 cxr_ab_free(&mesh
->abedges
);
574 cxr_ab_free(&mesh
->abloops
);
575 cxr_ab_free(&mesh
->abpolys
);
580 * Rebuilds edge data for mesh (useful to get rid of orphaned edges)
582 static void cxr_mesh_clean_edges( cxr_mesh
*mesh
)
584 cxr_abuffer new_edges
;
585 cxr_ab_init( &new_edges
, sizeof(cxr_edge
), mesh
->abedges
.count
);
587 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
589 cxr_polygon
*poly
= &mesh
->polys
[i
];
590 for( int j
=0; j
<poly
->loop_total
; j
++ )
593 *lp0
= &mesh
->loops
[poly
->loop_start
+j
],
594 *lp1
= &mesh
->loops
[poly
->loop_start
+cxr_range(j
+1,poly
->loop_total
)];
596 int i0
= cxr_min(lp0
->index
, lp1
->index
),
597 i1
= cxr_max(lp0
->index
, lp1
->index
);
599 /* Check if edge exists before adding */
600 for( int k
=0; k
<new_edges
.count
; k
++ )
602 cxr_edge
*edge
= cxr_ab_ptr(&new_edges
,k
);
604 if( edge
->i0
== i0
&& edge
->i1
== i1
)
607 goto IL_EDGE_CREATED
;
611 int orig_edge_id
= lp0
->edge_index
;
612 lp0
->edge_index
= new_edges
.count
;
614 cxr_edge edge
= { i0
, i1
};
617 * Copy extra information from original edges
620 if( orig_edge_id
< mesh
->abedges
.count
)
622 cxr_edge
*orig_edge
= &mesh
->edges
[ orig_edge_id
];
623 edge
.freestyle
= orig_edge
->freestyle
;
630 cxr_ab_push( &new_edges
, &edge
);
636 cxr_ab_free( &mesh
->abedges
);
637 mesh
->abedges
= new_edges
;
639 cxr_mesh_update( mesh
);
643 * Remove 0-length faces from mesh (we mark them light that for deletion
644 * Remove all unused loops as a result of removing those faces
646 static void cxr_mesh_clean_faces( cxr_mesh
*mesh
)
648 cxr_abuffer loops_new
;
649 cxr_ab_init( &loops_new
, sizeof(cxr_loop
), mesh
->abloops
.count
);
652 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
654 cxr_polygon
*src
= &mesh
->polys
[i
],
655 *dst
= &mesh
->polys
[new_length
];
657 if( src
->loop_total
> 0 )
659 int src_start
= src
->loop_start
,
660 src_total
= src
->loop_total
;
663 dst
->loop_start
= loops_new
.count
;
665 for( int j
=0; j
<src_total
; j
++ )
667 cxr_loop
*loop
= &mesh
->loops
[src_start
+j
],
668 *ldst
= cxr_ab_ptr(&loops_new
,dst
->loop_start
+j
);
670 ldst
->poly_left
= new_length
;
673 loops_new
.count
+= src_total
;
678 cxr_ab_free( &mesh
->abloops
);
679 mesh
->abloops
= loops_new
;
680 mesh
->abpolys
.count
= new_length
;
682 cxr_mesh_update( mesh
);
686 * Links loop's poly_left and poly_right
687 * Does not support more than 2 polys to one edge
689 * Returns 0 if there is non-manifold geomtry (aka: not watertight)
691 static int cxr_mesh_link_loops( cxr_mesh
*mesh
)
693 i32
*polygon_edge_map
= malloc(mesh
->abedges
.count
*2 *sizeof(i32
));
695 for( int i
= 0; i
< mesh
->abedges
.count
*2; i
++ )
696 polygon_edge_map
[i
] = -1;
698 for( int i
= 0; i
< mesh
->abpolys
.count
; i
++ )
700 cxr_polygon
*poly
= &mesh
->polys
[i
];
702 for( int j
= 0; j
< poly
->loop_total
; j
++ )
704 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
707 for( int k
= 0; k
< 2; k
++ )
709 i32
*edge
= &polygon_edge_map
[loop
->edge_index
*2+k
];
719 for( int i
= 0; i
< mesh
->abpolys
.count
; i
++ )
721 cxr_polygon
*poly
= &mesh
->polys
[i
];
723 for( int j
= 0; j
< poly
->loop_total
; j
++ )
725 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
727 i32
*face_map
= &polygon_edge_map
[ loop
->edge_index
*2 ];
729 if( face_map
[0] == loop
->poly_left
) loop
->poly_right
= face_map
[1];
730 else loop
->poly_right
= face_map
[0];
735 for( int i
=0; i
<mesh
->abedges
.count
*2; i
++ )
737 if( polygon_edge_map
[i
] == -1 )
739 free( polygon_edge_map
);
744 free( polygon_edge_map
);
749 * Create new empty polygon with known loop count
750 * Must be filled and completed by the following functions!
752 static int cxr_create_poly( cxr_mesh
*mesh
, int loop_count
)
754 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
759 cxr_log( "tried to add new poly with length %d!\n", loop_count
);
764 cxr_ab_reserve( &mesh
->abpolys
, 1 );
765 cxr_ab_reserve( &mesh
->abloops
, loop_count
);
766 cxr_mesh_update( mesh
);
768 cxr_polygon
*poly
= &mesh
->polys
[ mesh
->abpolys
.count
];
770 poly
->loop_start
= mesh
->abloops
.count
;
771 poly
->loop_total
= 0;
772 poly
->material_id
= -1;
773 v3_zero( poly
->center
);
779 * Add one index to the polygon created by the above function
781 static void cxr_poly_push_index( cxr_mesh
*mesh
, int id
)
783 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
785 int nface_id
= mesh
->abpolys
.count
;
786 cxr_polygon
*poly
= &mesh
->polys
[ nface_id
];
788 cxr_loop
*new_loop
= &mesh
->loops
[ poly
->loop_start
+ poly
->loop_total
];
790 new_loop
->poly_left
= nface_id
;
791 new_loop
->poly_right
= -1;
792 new_loop
->index
= id
;
793 new_loop
->edge_index
= 0;
794 v2_zero(new_loop
->uv
);
796 v3_add( poly
->center
, verts
[new_loop
->index
], poly
->center
);
799 mesh
->abloops
.count
++;
803 * Finalize and commit polygon into mesh
805 static void cxr_poly_finish( cxr_mesh
*mesh
)
807 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
809 int nface_id
= mesh
->abpolys
.count
;
810 cxr_polygon
*poly
= &mesh
->polys
[nface_id
];
812 /* Average center and calc normal */
814 v3_divs( poly
->center
, poly
->loop_total
, poly
->center
);
815 cxr_loop
*lp0
= &mesh
->loops
[ poly
->loop_start
],
816 *lp1
= &mesh
->loops
[ poly
->loop_start
+1 ],
817 *lp2
= &mesh
->loops
[ poly
->loop_start
+2 ];
820 verts
[lp0
->index
], verts
[lp1
->index
], verts
[lp2
->index
], poly
->normal
);
822 mesh
->abpolys
.count
++;
826 * Extract the next island from mesh
828 * Returns NULL if mesh is one contigous object
830 static cxr_mesh
*cxr_pull_island( cxr_mesh
*mesh
)
832 cxr_mesh_link_loops(mesh
);
834 int *island_current
= malloc(mesh
->abpolys
.count
*sizeof(int)),
839 island_current
[0] = 0;
842 last_count
= island_len
;
844 for( int i
=0; i
<island_len
; i
++ )
846 cxr_polygon
*poly
= &mesh
->polys
[ island_current
[i
] ];
848 for( int j
=0; j
<poly
->loop_total
; j
++ )
850 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
852 if( loop
->poly_right
!= -1 )
854 int face_present
= 0;
856 for( int k
=0; k
<island_len
; k
++ )
858 if( island_current
[k
] == loop
->poly_right
)
866 island_current
[ island_len
++ ] = loop
->poly_right
;
871 if( island_len
> last_count
)
874 /* Check for complete object */
875 if( island_len
== mesh
->abpolys
.count
)
877 free( island_current
);
881 for( int i
=0; i
<island_len
; i
++ )
883 cxr_polygon
*poly
= &mesh
->polys
[ island_current
[i
] ];
884 loop_count
+= poly
->loop_total
;
887 /* Create and update meshes */
888 cxr_mesh
*newmesh
= cxr_alloc_mesh( mesh
->abedges
.count
,
893 for( int i
=0; i
<island_len
; i
++ )
895 cxr_polygon
*src
= &mesh
->polys
[ island_current
[i
] ];
896 cxr_polygon
*dst
= cxr_ab_ptr(&newmesh
->abpolys
, i
);
899 dst
->loop_start
= newmesh
->abloops
.count
;
901 for( int j
=0; j
<src
->loop_total
; j
++ )
904 *lsrc
= &mesh
->loops
[ src
->loop_start
+j
],
905 *ldst
= cxr_ab_ptr(&newmesh
->abloops
, dst
->loop_start
+j
);
909 ldst
->poly_right
= -1;
912 newmesh
->abloops
.count
+= src
->loop_total
;
913 src
->loop_total
= -1;
916 newmesh
->abpolys
.count
= island_len
;
917 newmesh
->abedges
.count
= mesh
->abedges
.count
;
918 memcpy( cxr_ab_ptr(&newmesh
->abedges
,0),
920 mesh
->abedges
.count
* sizeof(cxr_edge
));
922 cxr_mesh_clean_faces(mesh
);
923 cxr_mesh_clean_edges(mesh
);
924 cxr_mesh_clean_edges(newmesh
);
926 free( island_current
);
931 * Invalid solid is when there are vertices that are coplanar to a face, but are
932 * outside the polygons edges.
934 static int cxr_valid_solid( cxr_mesh
*mesh
, int *solid
, int len
)
936 v3f
*verts
= cxr_ab_ptr(mesh
->p_abverts
, 0);
938 for( int i
=0; i
<len
; i
++ )
940 cxr_polygon
*polyi
= &mesh
->polys
[ solid
[i
] ];
943 normal_to_plane(polyi
->normal
, polyi
->center
, plane
);
945 for( int j
=0; j
<len
; j
++ )
949 cxr_polygon
*polyj
= &mesh
->polys
[ solid
[j
] ];
951 for( int k
=0; k
<polyj
->loop_total
; k
++ )
953 cxr_loop
*lpj
= &mesh
->loops
[ polyj
->loop_start
+k
];
955 /* Test if the vertex is not referenced by the polygon */
956 for( int l
=0; l
<polyi
->loop_total
; l
++ )
958 cxr_loop
*lpi
= &mesh
->loops
[ polyi
->loop_start
+l
];
960 if( lpi
->index
== lpj
->index
)
964 if( fabs(plane_polarity(plane
, verts
[lpj
->index
])) < 0.001 )
976 * Use when iterating the loops array, to get a unique set of edges
977 * Better than using the edges array and doing many more checks
979 static int cxr_loop_unique_edge( cxr_loop
*lp
)
981 if( lp
->poly_left
> lp
->poly_right
)
988 * Identify edges in the mesh where the two connected face's normals
989 * are opposing eachother (or close to identical)
991 static int *cxr_mesh_reflex_edges( cxr_mesh
*mesh
)
993 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
994 int *edge_tagged
= malloc( mesh
->abedges
.count
* sizeof(int) );
996 for( int i
=0; i
<mesh
->abloops
.count
; i
++ )
998 cxr_loop
*lp
= &mesh
->loops
[i
];
999 if( !cxr_loop_unique_edge( lp
) ) continue;
1001 edge_tagged
[lp
->edge_index
] = 0;
1003 cxr_polygon
*polya
= &mesh
->polys
[ lp
->poly_left
],
1004 *polyb
= &mesh
->polys
[ lp
->poly_right
];
1007 normal_to_plane(polyb
->normal
, polyb
->center
, planeb
);
1009 for( int j
=0; j
<polya
->loop_total
; j
++ )
1011 cxr_loop
*lp1
= &mesh
->loops
[ polya
->loop_start
+j
];
1013 if(( plane_polarity( planeb
, verts
[lp1
->index
] ) > 0.001 ) ||
1014 ( v3_dot(polya
->normal
,polyb
->normal
) > CXR_PLANE_SIMILARITY_MAX
))
1016 edge_tagged
[lp
->edge_index
] = 1;
1026 * Same logic as above function except it will apply it to each vertex
1028 static int *cxr_mesh_reflex_vertices( cxr_mesh
*mesh
)
1030 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
1032 int *vertex_tagged
= malloc( mesh
->p_abverts
->count
*sizeof(int) );
1033 int *connected_planes
= malloc( mesh
->abpolys
.count
*sizeof(int) );
1035 for( int i
=0; i
<mesh
->p_abverts
->count
; i
++ )
1038 int num_connected
= 0;
1040 /* Create a list of polygons that refer to this vertex */
1041 for( int j
=0; j
<mesh
->abpolys
.count
; j
++ )
1043 cxr_polygon
*poly
= &mesh
->polys
[j
];
1044 for( int k
=0; k
<poly
->loop_total
; k
++ )
1046 cxr_loop
*loop
= &mesh
->loops
[poly
->loop_start
+k
];
1047 if( loop
->index
== i
)
1049 connected_planes
[num_connected
++] = j
;
1055 /* Check all combinations for a similar normal */
1056 for( int j
=0; j
<num_connected
-1; j
++ )
1058 for( int k
=j
+1; k
<num_connected
; k
++ )
1060 cxr_polygon
*polyj
= &mesh
->polys
[connected_planes
[j
]],
1061 *polyk
= &mesh
->polys
[connected_planes
[k
]];
1063 if( v3_dot(polyj
->normal
,polyk
->normal
) > CXR_PLANE_SIMILARITY_MAX
)
1069 * Check if all connected planes either:
1071 * - Coplanar with it
1073 for( int j
=0; j
<num_connected
; j
++ )
1075 for( int k
=j
+1; k
<num_connected
; k
++ )
1077 cxr_polygon
*jpoly
= &mesh
->polys
[ connected_planes
[j
] ],
1078 *kpoly
= &mesh
->polys
[ connected_planes
[k
] ];
1081 normal_to_plane( kpoly
->normal
, kpoly
->center
, plane
);
1082 for( int l
=0; l
<jpoly
->loop_total
; l
++ )
1084 cxr_loop
*lp
= &mesh
->loops
[ jpoly
->loop_start
+l
];
1086 if( plane_polarity( plane
, verts
[lp
->index
] ) > 0.001 )
1094 vertex_tagged
[i
] = 1;
1097 free( connected_planes
);
1098 return vertex_tagged
;
1102 * Detect if potential future edges create a collision with any of the
1103 * existing edges in the mesh
1105 static int cxr_solid_overlap( cxr_mesh
*mesh
,
1108 int common_edge_index
1110 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
1111 cxr_edge
*common_edge
= &mesh
->edges
[common_edge_index
];
1113 int unique_a
= pa
->loop_total
-2,
1114 unique_b
= pb
->loop_total
-2;
1116 int *unique_verts
= malloc( (unique_a
+unique_b
)*sizeof(int) );
1117 int unique_total
= 0;
1119 for( int j
=0; j
<2; j
++ )
1121 cxr_polygon
*poly
= (cxr_polygon
*[2]){pa
,pb
}[j
];
1123 for( int i
=0; i
<poly
->loop_total
; i
++ )
1125 cxr_loop
*lp
= &mesh
->loops
[poly
->loop_start
+i
];
1127 if( lp
->index
== common_edge
->i0
|| lp
->index
== common_edge
->i1
)
1130 unique_verts
[ unique_total
++ ] = lp
->index
;
1136 for( int i
=0; i
<unique_a
; i
++ )
1138 for( int j
=unique_a
; j
<unique_total
; j
++ )
1140 int i0
= unique_verts
[i
],
1141 i1
= unique_verts
[j
];
1143 for( int k
=0; k
<mesh
->abedges
.count
; k
++ )
1145 cxr_edge
*edge
= &mesh
->edges
[k
];
1147 if( edge
->i0
== i0
|| edge
->i0
== i1
||
1148 edge
->i1
== i0
|| edge
->i1
== i1
) continue;
1150 double *a0
= verts
[i0
],
1152 *b0
= verts
[edge
->i0
],
1153 *b1
= verts
[edge
->i1
];
1155 double dist
= segment_segment_dist( a0
, a1
, b0
, b1
, ca
, cb
);
1159 free( unique_verts
);
1166 free( unique_verts
);
1171 * Creates the 'maximal' solid that originates from this faceid
1173 * Returns the number of faces used
1175 static int cxr_buildsolid(
1182 faces_tagged
[faceid
] = faceid
;
1185 solid
[solid_len
++] = faceid
;
1187 int search_start
= 0;
1192 for( int j
=search_start
; j
<solid_len
; j
++ )
1194 cxr_polygon
*poly
= &mesh
->polys
[ solid
[j
] ];
1196 for( int k
=0; k
<poly
->loop_total
; k
++ )
1198 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+k
];
1199 cxr_edge
*edge
= &mesh
->edges
[ loop
->edge_index
];
1201 if( faces_tagged
[ loop
->poly_right
] == -1 )
1203 if( !reflex_edges
[loop
->edge_index
] )
1205 /* Check for dodgy edges */
1206 cxr_polygon
*newpoly
= &mesh
->polys
[loop
->poly_right
];
1208 if( cxr_solid_overlap(mesh
,poly
,newpoly
,loop
->edge_index
))
1211 /* Looking ahead by one step gives us an early out for invalid
1212 * configurations. This might just all be handled by the new
1213 * edge overlap detector, though.
1215 for( int l
=0; l
< newpoly
->loop_total
; l
++ )
1217 cxr_loop
*lp1
= &mesh
->loops
[ newpoly
->loop_start
+l
];
1218 cxr_polygon
*future_face
= &mesh
->polys
[ lp1
->poly_right
];
1220 if( reflex_edges
[ lp1
->edge_index
]
1221 || lp1
->poly_right
== loop
->poly_right
)
1224 for( int m
=0; m
<solid_len
; m
++ )
1225 if( solid
[m
] == lp1
->poly_right
)
1228 for( int m
=0; m
<solid_len
; m
++ )
1230 cxr_polygon
*polym
= &mesh
->polys
[solid
[m
]];
1231 double pdist
= v3_dot( polym
->normal
,future_face
->normal
);
1233 if( pdist
> CXR_PLANE_SIMILARITY_MAX
)
1240 /* Check for vertices in the new polygon that exist on a current
1241 * plane. This condition is invalid */
1242 solid
[ solid_len
] = loop
->poly_right
;
1244 if( cxr_valid_solid(mesh
,solid
,solid_len
+1 ) )
1246 faces_tagged
[ loop
->poly_right
] = faceid
;
1256 search_start
= solid_len
;
1258 goto search_iterate
;
1265 int start
, count
, edge_count
;
1269 struct temp_manifold
1271 struct manifold_loop
1281 enum manifold_status
1285 k_manifold_fragmented
,
1286 k_manifold_complete
,
1292 * Create polygon from entire manifold structure.
1294 * Must be completely co-planar
1296 static void cxr_create_poly_full( cxr_mesh
*mesh
, struct temp_manifold
*src
)
1298 if( cxr_create_poly( mesh
, src
->loop_count
) )
1300 for( int l
=0; l
<src
->loop_count
; l
++ )
1301 cxr_poly_push_index( mesh
, src
->loops
[ l
].loop
.index
);
1303 cxr_poly_finish( mesh
);
1308 * Links up all edges into a potential new manifold
1310 * The return status can be:
1311 * (err): Critical programming error
1312 * none: No manifold to create
1313 * fragmented: Multiple sections exist, not just one
1314 * complete: Optimial manifold was created
1316 static void cxr_link_manifold(
1318 struct csolid
*solid
,
1320 struct temp_manifold
*manifold
1322 cxr_loop
**edge_list
= malloc( sizeof(*edge_list
) * solid
->edge_count
);
1324 int init_reverse
= 0;
1325 int unique_edge_count
= 0;
1327 /* Gather list of unique edges */
1329 for( int j
=0; j
<solid
->count
; j
++ )
1331 cxr_polygon
*poly
= &mesh
->polys
[ solid_buffer
[solid
->start
+j
] ];
1333 for( int k
=0; k
<poly
->loop_total
; k
++ )
1335 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+k
];
1337 for( int l
=0; l
<unique_edge_count
; l
++ )
1338 if( edge_list
[l
]->edge_index
== loop
->edge_index
)
1341 for( int l
=0; l
<solid
->count
; l
++ )
1342 if( loop
->poly_right
== solid_buffer
[solid
->start
+l
] )
1345 edge_list
[ unique_edge_count
] = loop
;
1347 if( unique_edge_count
== 0 )
1349 cxr_edge
*edgeptr
= &mesh
->edges
[ loop
->edge_index
];
1350 if( edgeptr
->i1
== loop
->index
)
1354 unique_edge_count
++;
1359 if( unique_edge_count
== 0 )
1362 manifold
->status
= k_manifold_none
;
1366 /* Link edges together to form manifold */
1367 manifold
->loops
= malloc( solid
->edge_count
*sizeof(struct manifold_loop
));
1368 manifold
->split_count
= 0;
1369 manifold
->loop_count
= 0;
1371 cxr_edge
*current
= &mesh
->edges
[ edge_list
[0]->edge_index
];
1373 int endpt
= (!init_reverse
)? current
->i0
: current
->i1
,
1375 curface
= edge_list
[0]->poly_left
;
1378 for( int j
=0; j
<unique_edge_count
; j
++ )
1380 cxr_edge
*other
= &mesh
->edges
[ edge_list
[j
]->edge_index
];
1381 if( other
== current
)
1384 if( other
->i0
== endpt
|| other
->i1
== endpt
)
1389 if( other
->i0
== endpt
) endpt
= current
->i1
;
1390 else endpt
= current
->i0
;
1392 struct manifold_loop
*ml
= &manifold
->loops
[ manifold
->loop_count
++ ];
1394 if( curface
==edge_list
[j
]->poly_left
)
1397 manifold
->split_count
++;
1402 ml
->loop
.edge_index
= edge_list
[j
]->edge_index
;
1403 ml
->loop
.poly_left
= edge_list
[j
]->poly_left
;
1404 ml
->loop
.index
= lastpt
;
1405 ml
->loop
.poly_right
= edge_list
[j
]->poly_right
;
1407 curface
= edge_list
[j
]->poly_left
;
1411 if( manifold
->loop_count
< unique_edge_count
)
1412 manifold
->status
= k_manifold_fragmented
;
1414 manifold
->status
= k_manifold_complete
;
1416 goto manifold_complete
;
1419 goto manifold_continue
;
1423 /* Incomplete links */
1424 manifold
->status
= k_manifold_err
;
1433 * Reconstruct implied internal geometry where the manifold doesn't have
1434 * enough information (vertices) to create a full result.
1436 static int cxr_build_implicit_geo( cxr_mesh
*mesh
, int new_polys
, int start
)
1438 for( int i
=0; i
<new_polys
-2; i
++ )
1440 for( int j
=i
+1; j
<new_polys
-1; j
++ )
1442 for( int k
=j
+1; k
<new_polys
; k
++ )
1444 cxr_polygon
*ptri
= &mesh
->polys
[ start
+i
],
1445 *ptrj
= &mesh
->polys
[ start
+j
],
1446 *ptrk
= &mesh
->polys
[ start
+k
];
1448 v4f planei
, planej
, planek
;
1449 normal_to_plane(ptri
->normal
,ptri
->center
,planei
);
1450 normal_to_plane(ptrj
->normal
,ptrj
->center
,planej
);
1451 normal_to_plane(ptrk
->normal
,ptrk
->center
,planek
);
1455 if( plane_intersect(planei
,planej
,planek
,intersect
) )
1457 /* Make sure the point is inside the convex region */
1459 int point_valid
= 1;
1460 for( int l
=0; l
<mesh
->abpolys
.count
; l
++ )
1462 cxr_polygon
*ptrl
= &mesh
->polys
[l
];
1465 normal_to_plane(ptrl
->normal
, ptrl
->center
, planel
);
1467 if( plane_polarity( planel
, intersect
) > 0.01 )
1470 cxr_log( "degen vert, planes %d, %d, %d [max:%d]\n",
1473 cxr_debug_poly( mesh
, ptri
, colours_random
[3] );
1474 cxr_debug_poly( mesh
, ptrj
, colours_random
[1] );
1475 cxr_debug_poly( mesh
, ptrk
, colours_random
[2] );
1482 /* Extend faces to include this vert */
1484 int nvertid
= mesh
->p_abverts
->count
;
1485 cxr_ab_push( mesh
->p_abverts
, intersect
);
1487 ptrj
->loop_start
+= 1;
1488 ptrk
->loop_start
+= 2;
1490 cxr_ab_reserve( &mesh
->abloops
, 3);
1492 int newi
= ptri
->loop_start
+ptri
->loop_total
,
1493 newj
= ptrj
->loop_start
+ptrj
->loop_total
,
1494 newk
= ptrk
->loop_start
+ptrk
->loop_total
;
1497 *lloopi
= cxr_ab_empty_at(&mesh
->abloops
, newi
),
1498 *lloopj
= cxr_ab_empty_at(&mesh
->abloops
, newj
),
1499 *lloopk
= cxr_ab_empty_at(&mesh
->abloops
, newk
);
1501 lloopi
->index
= nvertid
;
1502 lloopi
->edge_index
= 0;
1503 lloopi
->poly_left
= start
+ i
;
1504 lloopi
->poly_right
= -1;
1506 lloopj
->index
= nvertid
;
1507 lloopj
->poly_left
= start
+ j
;
1508 lloopj
->edge_index
= 0;
1509 lloopj
->poly_right
= -1;
1511 lloopk
->index
= nvertid
;
1512 lloopk
->edge_index
= 0;
1513 lloopk
->poly_left
= start
+ k
;
1514 lloopk
->poly_right
= -1;
1516 v2_zero(lloopi
->uv
);
1517 v2_zero(lloopj
->uv
);
1518 v2_zero(lloopk
->uv
);
1520 ptri
->loop_total
++;
1521 ptrj
->loop_total
++;
1522 ptrk
->loop_total
++;
1524 double qi
= 1.0/(double)ptri
->loop_total
,
1525 qj
= 1.0/(double)ptrj
->loop_total
,
1526 qk
= 1.0/(double)ptrk
->loop_total
;
1528 /* Adjust centers of faces */
1529 v3_lerp( ptri
->center
, intersect
, qi
, ptri
->center
);
1530 v3_lerp( ptrj
->center
, intersect
, qj
, ptrj
->center
);
1531 v3_lerp( ptrk
->center
, intersect
, qk
, ptrk
->center
);
1541 * Convexer's main algorithm
1543 * Return the best availible convex solid from mesh, and patch the existing mesh
1544 * to fill the gap where the new mesh left it.
1546 * Returns NULL if shape is already convex or empty.
1547 * This function will not preserve edge data such as freestyle, sharp etc.
1549 static cxr_mesh
*cxr_pull_best_solid(
1551 int preserve_more_edges
,
1552 enum cxr_soliderr
*err
)
1554 *err
= k_soliderr_none
;
1556 if( !cxr_mesh_link_loops(mesh
) )
1559 cxr_log( "non-manifold edges are in the mesh: "
1560 "implicit internal geometry does not have full support\n" );
1562 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
1564 for( int i
=0; i
<mesh
->abloops
.count
; i
++ )
1566 cxr_loop
*lp
= &mesh
->loops
[i
];
1568 if( lp
->poly_left
== -1 || lp
->poly_right
== -1 )
1570 cxr_edge
*edge
= &mesh
->edges
[lp
->edge_index
];
1571 cxr_debug_line( verts
[edge
->i0
], verts
[edge
->i1
], colour_error
);
1575 *err
= k_soliderr_non_manifold
;
1579 int *edge_tagged
= cxr_mesh_reflex_edges( mesh
);
1580 int *vertex_tagged
= cxr_mesh_reflex_vertices( mesh
);
1583 * Connect all marked vertices that share an edge
1586 int *edge_important
= malloc(mesh
->abedges
.count
*sizeof(int));
1587 for( int i
=0; i
< mesh
->abedges
.count
; i
++ )
1588 edge_important
[i
] = 0;
1590 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
1592 cxr_polygon
*poly
= &mesh
->polys
[i
];
1593 int not_tagged
= -1,
1596 for( int j
=0; j
<poly
->loop_total
; j
++ )
1598 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
1600 if( !edge_tagged
[ loop
->edge_index
] )
1602 if( not_tagged
== -1 )
1603 not_tagged
= loop
->edge_index
;
1605 goto edge_unimportant
;
1609 if( not_tagged
!= -1 )
1610 edge_important
[not_tagged
]=1;
1616 * Connect edges where both vertices are reflex, only if we are not
1619 for( int i
=0; i
<mesh
->abedges
.count
; i
++ )
1621 if( edge_important
[i
] && preserve_more_edges
) continue;
1623 cxr_edge
*edge
= &mesh
->edges
[i
];
1624 if( vertex_tagged
[edge
->i0
] && vertex_tagged
[edge
->i1
] )
1628 free( edge_important
);
1630 int *faces_tagged
= malloc(mesh
->abpolys
.count
*sizeof(int));
1631 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
1632 faces_tagged
[i
] = -1;
1634 struct csolid
*candidates
;
1635 int *solid_buffer
= malloc( mesh
->abpolys
.count
*sizeof(int) ),
1636 solid_buffer_len
= 0,
1637 candidate_count
= 0;
1639 candidates
= malloc( mesh
->abpolys
.count
*sizeof(struct csolid
) );
1642 * Create a valid, non-overlapping solid for every face present in the mesh
1644 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
1646 if( faces_tagged
[i
] != -1 ) continue;
1647 faces_tagged
[i
] = i
;
1649 int *solid
= &solid_buffer
[ solid_buffer_len
];
1650 int len
= cxr_buildsolid( mesh
, i
, solid
, edge_tagged
, faces_tagged
);
1653 struct csolid
*csolid
= &candidates
[candidate_count
++];
1654 csolid
->start
= solid_buffer_len
;
1655 csolid
->count
= len
;
1656 csolid
->edge_count
= 0;
1658 v3_zero( csolid
->center
);
1659 for( int j
=0; j
<len
; j
++ )
1661 cxr_polygon
*polyj
= &mesh
->polys
[ solid
[j
] ];
1662 v3_add( polyj
->center
, csolid
->center
, csolid
->center
);
1663 csolid
->edge_count
+= polyj
->loop_total
;
1665 v3_divs( csolid
->center
, len
, csolid
->center
);
1666 solid_buffer_len
+= len
;
1669 free( edge_tagged
);
1670 free( vertex_tagged
);
1671 free( faces_tagged
);
1674 * Choosing the best solid: most defined manifold
1676 struct csolid
*best_solid
= NULL
;
1677 int fewest_manifold_splits
= INT32_MAX
;
1679 struct temp_manifold best_manifold
= { .loops
= NULL
, .loop_count
= 0 };
1680 int max_solid_faces
= 0;
1682 for( int i
=0; i
<candidate_count
; i
++ )
1684 struct csolid
*solid
= &candidates
[i
];
1685 max_solid_faces
= cxr_max(max_solid_faces
,solid
->count
);
1687 if( solid
->count
<= 2 )
1690 struct temp_manifold manifold
;
1691 cxr_link_manifold( mesh
, solid
, solid_buffer
, &manifold
);
1693 if( manifold
.status
== k_manifold_err
)
1695 *err
= k_soliderr_bad_manifold
;
1699 free(manifold
.loops
);
1700 free(best_manifold
.loops
);
1704 if( manifold
.status
== k_manifold_complete
)
1706 if( manifold
.split_count
< fewest_manifold_splits
)
1708 fewest_manifold_splits
= manifold
.split_count
;
1711 free( best_manifold
.loops
);
1712 best_manifold
= manifold
;
1717 if( manifold
.status
!= k_manifold_none
)
1718 free( manifold
.loops
);
1721 if( max_solid_faces
< 2 )
1723 *err
= k_soliderr_no_solids
;
1726 free(best_manifold
.loops
);
1730 if( best_solid
!= NULL
)
1732 cxr_mesh
*pullmesh
= cxr_alloc_mesh( best_solid
->edge_count
,
1733 best_solid
->edge_count
,
1737 for( int i
=0; i
<best_solid
->count
; i
++ )
1739 int nface_id
= pullmesh
->abpolys
.count
;
1740 int exist_plane_id
= solid_buffer
[best_solid
->start
+i
];
1742 cxr_polygon
*exist_face
= &mesh
->polys
[ exist_plane_id
],
1743 *new_face
= cxr_ab_empty( &pullmesh
->abpolys
);
1745 *new_face
= *exist_face
;
1746 new_face
->loop_start
= pullmesh
->abloops
.count
;
1748 for( int j
=0; j
<exist_face
->loop_total
; j
++ )
1750 cxr_loop
*exist_loop
= &mesh
->loops
[ exist_face
->loop_start
+j
],
1751 *new_loop
= cxr_ab_empty(&pullmesh
->abloops
);
1753 new_loop
->index
= exist_loop
->index
;
1754 new_loop
->poly_left
= nface_id
;
1755 new_loop
->poly_right
= -1;
1756 new_loop
->edge_index
= 0;
1757 v2_copy( exist_loop
->uv
, new_loop
->uv
);
1760 exist_face
->loop_total
= -1;
1764 int pullmesh_new_start
= pullmesh
->abpolys
.count
;
1766 if( fewest_manifold_splits
!= 0 )
1768 /* Unusual observation:
1769 * If the split count is odd, the manifold can be created easily
1771 * If it is even, implicit internal geometry is needed to be
1772 * constructed. So the manifold gets folded as we create it segment
1775 * I'm not sure if this is a well defined rule of geometry, but seems
1776 * to apply to the data we care about.
1778 int collapse_used_segments
= (u32
)fewest_manifold_splits
& 0x1? 0: 1;
1782 for( int j
=0; j
< best_manifold
.loop_count
; j
++ )
1784 if( !best_manifold
.loops
[j
].split
) continue;
1786 cxr_loop
*loop
= &best_manifold
.loops
[j
].loop
;
1788 for( int k
=1; k
< best_manifold
.loop_count
; k
++ )
1790 int index1
= cxr_range(j
+k
, best_manifold
.loop_count
);
1791 cxr_loop
*loop1
= &best_manifold
.loops
[index1
].loop
;
1793 if( best_manifold
.loops
[index1
].split
)
1800 if( new_polys
> best_manifold
.loop_count
)
1803 cxr_log( "Programming error: Too many new polys!\n" );
1808 if( cxr_create_poly( pullmesh
, k
+1 ) )
1810 for( int l
=0; l
<k
+1; l
++ )
1812 int i0
= cxr_range(j
+l
, best_manifold
.loop_count
),
1813 index
= best_manifold
.loops
[ i0
].loop
.index
;
1815 cxr_poly_push_index( pullmesh
, index
);
1817 cxr_poly_finish( pullmesh
);
1820 /* Collapse down manifold */
1821 if( collapse_used_segments
)
1823 best_manifold
.loops
[j
].split
= 0;
1824 best_manifold
.loops
[index1
].split
= 0;
1826 int new_length
= (best_manifold
.loop_count
-(k
-1));
1828 struct temp_manifold new_manifold
= {
1829 .loop_count
= new_length
1831 new_manifold
.loops
=
1832 malloc( new_length
*sizeof(*new_manifold
.loops
) );
1834 for( int l
=0; l
<new_length
; l
++ )
1836 int i_src
= cxr_range( j
+k
+l
, best_manifold
.loop_count
);
1837 new_manifold
.loops
[l
] = best_manifold
.loops
[i_src
];
1840 free( best_manifold
.loops
);
1841 best_manifold
= new_manifold
;
1843 goto manifold_repeat
;
1852 if( best_manifold
.loop_count
&& collapse_used_segments
)
1854 cxr_create_poly_full( pullmesh
, &best_manifold
);
1860 cxr_create_poly_full( pullmesh
, &best_manifold
);
1864 if( new_polys
>= 3 )
1866 if( !cxr_build_implicit_geo( pullmesh
, new_polys
, pullmesh_new_start
))
1870 free(best_manifold
.loops
);
1872 cxr_free_mesh( pullmesh
);
1873 *err
= k_soliderr_degenerate_implicit
;
1879 * Copy faces from the pullmesh into original, to patch up where there
1880 * would be gaps created
1882 for( int i
=0; i
<new_polys
; i
++ )
1884 int rface_id
= mesh
->abpolys
.count
;
1885 cxr_polygon
*pface
= &pullmesh
->polys
[pullmesh_new_start
+i
],
1886 *rip_face
= cxr_ab_empty(&mesh
->abpolys
);
1888 rip_face
->loop_start
= mesh
->abloops
.count
;
1889 rip_face
->loop_total
= pface
->loop_total
;
1890 rip_face
->material_id
= -1;
1892 for( int j
=0; j
<rip_face
->loop_total
; j
++ )
1895 &pullmesh
->loops
[ pface
->loop_start
+pface
->loop_total
-j
-1 ],
1896 *rloop
= cxr_ab_empty(&mesh
->abloops
);
1898 rloop
->index
= ploop
->index
;
1899 rloop
->poly_left
= rface_id
;
1900 rloop
->poly_right
= -1;
1901 rloop
->edge_index
= 0;
1902 v2_copy( ploop
->uv
, rloop
->uv
);
1905 v3_copy( pface
->center
, rip_face
->center
);
1906 v3_negate( pface
->normal
, rip_face
->normal
);
1909 cxr_mesh_update( mesh
);
1910 cxr_mesh_update( pullmesh
);
1912 cxr_mesh_clean_faces( mesh
);
1913 cxr_mesh_clean_edges( mesh
);
1914 cxr_mesh_clean_faces( pullmesh
);
1915 cxr_mesh_clean_edges( pullmesh
);
1919 free(best_manifold
.loops
);
1926 free(best_manifold
.loops
);
1932 * Convert from the format we recieve from blender into our internal format
1933 * with auto buffers.
1935 static cxr_mesh
*cxr_to_internal_format(
1936 cxr_static_mesh
*src
,
1937 cxr_abuffer
*abverts
1939 cxr_mesh
*mesh
= cxr_alloc_mesh( src
->edge_count
, src
->loop_count
,
1940 src
->poly_count
, abverts
);
1942 cxr_ab_init( abverts
, sizeof(v3f
), src
->vertex_count
);
1944 memcpy( mesh
->abedges
.arr
, src
->edges
, src
->edge_count
*sizeof(cxr_edge
));
1945 memcpy( mesh
->abpolys
.arr
, src
->polys
, src
->poly_count
*sizeof(cxr_polygon
));
1946 memcpy( abverts
->arr
, src
->vertices
, src
->vertex_count
*sizeof(v3f
));
1947 mesh
->abedges
.count
= src
->edge_count
;
1948 mesh
->abloops
.count
= src
->loop_count
;
1949 mesh
->abpolys
.count
= src
->poly_count
;
1951 cxr_mesh_update( mesh
);
1953 for( int i
=0; i
<src
->loop_count
; i
++ )
1955 cxr_loop
*lp
= &mesh
->loops
[i
];
1957 lp
->index
= src
->loops
[i
].index
;
1958 lp
->edge_index
= src
->loops
[i
].edge_index
;
1959 v2_copy( src
->loops
[i
].uv
, lp
->uv
);
1962 abverts
->count
= src
->vertex_count
;
1966 static int cxr_poly_convex( cxr_mesh
*mesh
, cxr_polygon
*poly
)
1968 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
1970 for( int i
=0; i
<poly
->loop_total
; i
++ )
1972 int li0
= poly
->loop_start
+ i
,
1973 li1
= poly
->loop_start
+ cxr_range( i
+1, poly
->loop_total
),
1974 li2
= poly
->loop_start
+ cxr_range( i
+2, poly
->loop_total
);
1975 int i0
= mesh
->loops
[li0
].index
,
1976 i1
= mesh
->loops
[li1
].index
,
1977 i2
= mesh
->loops
[li2
].index
;
1981 v3_sub( verts
[i1
], verts
[i0
], v0
);
1982 v3_sub( verts
[i2
], verts
[i1
], v1
);
1984 v3_cross( v0
, v1
, c
);
1985 if( v3_dot( c
, poly
->normal
) <= 0.0 )
1988 cxr_debug_line( verts
[i0
], verts
[i1
], colour_error
);
1989 cxr_debug_box( verts
[i1
], 0.1, colour_error
);
1990 cxr_debug_line( verts
[i1
], verts
[i2
], colour_error
);
1991 cxr_debug_line( verts
[i1
], poly
->center
, colour_error
);
2000 static int cxr_solid_checkerr( cxr_mesh
*mesh
)
2002 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
2005 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
2009 cxr_polygon
*poly
= &mesh
->polys
[i
];
2012 normal_to_plane( poly
->normal
, poly
->center
, plane
);
2014 for( int j
=0; j
<poly
->loop_total
; j
++ )
2016 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
2017 double *vert
= verts
[ loop
->index
];
2019 if( fabs(plane_polarity(plane
,vert
)) > 0.0025 )
2025 plane_project_point( plane
, vert
, ref
);
2028 cxr_debug_line( ref
, vert
, colour_error
);
2029 cxr_debug_box( vert
, 0.1, colour_error
);
2036 cxr_debug_poly( mesh
, poly
, colour_error
);
2043 CXR_API
void cxr_free_world( cxr_world
*world
)
2045 for( int i
=0; i
<world
->absolids
.count
; i
++ )
2047 cxr_solid
*solid
= cxr_ab_ptr( &world
->absolids
, i
);
2048 cxr_free_mesh( solid
->pmesh
);
2051 cxr_ab_free( &world
->abverts
);
2052 cxr_ab_free( &world
->absolids
);
2053 free( world
->materials
);
2057 CXR_API cxr_tri_mesh
*cxr_world_preview( cxr_world
*world
)
2059 cxr_tri_mesh
*out
= malloc( sizeof(cxr_tri_mesh
) );
2060 out
->vertex_count
= 0;
2061 out
->indices_count
= 0;
2063 for( int i
=0; i
<world
->absolids
.count
; i
++ )
2065 cxr_solid
*solid
= cxr_ab_ptr( &world
->absolids
, i
);
2066 cxr_mesh
*mesh
= solid
->pmesh
;
2068 for( int j
=0; j
<mesh
->abpolys
.count
; j
++ )
2070 cxr_polygon
*poly
= &mesh
->polys
[j
];
2072 out
->vertex_count
+= poly
->loop_total
* 3; /* Polygon, edge strip */
2073 out
->indices_count
+= (poly
->loop_total
-2) * 3; /* Polygon */
2074 out
->indices_count
+= poly
->loop_total
* 2 * 3; /* Edge strip */
2078 out
->colours
= malloc( sizeof(v4f
)*out
->vertex_count
);
2079 out
->vertices
= malloc( sizeof(v3f
)*out
->vertex_count
);
2080 out
->indices
= malloc( sizeof(i32
)*out
->indices_count
);
2082 v3f
*overts
= out
->vertices
;
2083 v4f
*colours
= out
->colours
;
2084 i32
*indices
= out
->indices
;
2089 for( int i
=0; i
<world
->absolids
.count
; i
++ )
2091 cxr_solid
*solid
= cxr_ab_ptr( &world
->absolids
, i
);
2092 cxr_mesh
*mesh
= solid
->pmesh
;
2094 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
2097 colour_random_brush( i
, colour
);
2099 for( int j
=0; j
<mesh
->abpolys
.count
; j
++ )
2101 cxr_polygon
*poly
= &mesh
->polys
[j
];
2105 for( int k
=0; k
<poly
->loop_total
-2; k
++ )
2111 indices
[ ii
++ ] = istart
+i0
;
2112 indices
[ ii
++ ] = istart
+i1
;
2113 indices
[ ii
++ ] = istart
+i2
;
2116 for( int k
=0; k
<poly
->loop_total
; k
++ )
2118 cxr_loop
*lp
= &mesh
->loops
[poly
->loop_start
+k
];
2121 i1r
= cxr_range(k
+1,poly
->loop_total
)*3+1,
2123 i1i
= cxr_range(k
+1,poly
->loop_total
)*3+2;
2125 indices
[ ii
++ ] = istart
+i0i
;
2126 indices
[ ii
++ ] = istart
+i1i
;
2127 indices
[ ii
++ ] = istart
+i1r
;
2129 indices
[ ii
++ ] = istart
+i0i
;
2130 indices
[ ii
++ ] = istart
+i1r
;
2131 indices
[ ii
++ ] = istart
+i0r
;
2134 v3_muladds( verts
[lp
->index
], poly
->normal
, 0.02, overts
[vi
] );
2135 v4_copy( colour
, colours
[ vi
] );
2140 v3_lerp( verts
[lp
->index
], poly
->center
, 0.2, inner
);
2141 v3_muladds( inner
, poly
->normal
, 0.015, overts
[ vi
] );
2142 v4_copy( colour
, colours
[ vi
] );
2143 v4_copy( (v4f
){ 0.0, 0.0, 0.0, 0.0 }, colours
[vi
] );
2146 v3_muladds(verts
[lp
->index
], poly
->normal
, 0.0, overts
[ vi
] );
2147 v4_copy( colour
, colours
[ vi
] );
2148 v4_copy( (v4f
){ 1.0, 1.0, 1.0, 0.125 }, colours
[vi
] );
2157 CXR_API
void cxr_free_tri_mesh( cxr_tri_mesh
*mesh
)
2159 free( mesh
->colours
);
2160 free( mesh
->indices
);
2161 free( mesh
->vertices
);
2165 CXR_API cxr_world
*cxr_decompose( cxr_static_mesh
*src
, i32
*perrcode
)
2168 cxr_world
*world
= malloc( sizeof(*world
) );
2170 /* Copy data to internal formats */
2171 cxr_mesh
*main_mesh
= cxr_to_internal_format( src
, &world
->abverts
);
2172 cxr_ab_init( &world
->absolids
, sizeof(cxr_solid
), 2 );
2174 if( src
->material_count
)
2176 size_t dsize
= sizeof(cxr_material
) * src
->material_count
;
2177 world
->materials
= malloc( dsize
);
2178 memcpy( world
->materials
, src
->materials
, dsize
);
2180 else world
->materials
= NULL
;
2182 int invalid_count
= 0;
2185 * Preprocessor 1: Island seperation
2189 cxr_mesh
*res
= cxr_pull_island( main_mesh
);
2192 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ res
, 0, 0 });
2196 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ main_mesh
, 0, 0 } );
2199 * Preprocessor 2: Displacement processing & error checks
2201 for( int i
=0; i
<world
->absolids
.count
; i
++ )
2203 cxr_solid
*pinf
= cxr_ab_ptr(&world
->absolids
,i
);
2205 for( int j
=0; j
<pinf
->pmesh
->abpolys
.count
; j
++ )
2207 cxr_polygon
*poly
= &pinf
->pmesh
->polys
[ j
];
2209 for( int k
=0; k
<poly
->loop_total
; k
++ )
2211 cxr_loop
*lp
= &pinf
->pmesh
->loops
[ poly
->loop_start
+k
];
2212 cxr_edge
*edge
= &pinf
->pmesh
->edges
[ lp
->edge_index
];
2214 if( edge
->freestyle
)
2218 if( !cxr_poly_convex( pinf
->pmesh
, poly
) )
2222 error
= k_soliderr_non_convex_poly
;
2226 if( cxr_solid_checkerr( pinf
->pmesh
) )
2230 error
= k_soliderr_non_coplanar_vertices
;
2236 pinf
->displacement
= 1;
2240 * Main convex decomp algorithm
2242 int sources_count
= world
->absolids
.count
;
2247 for( int i
=0; i
<sources_count
; i
++ )
2249 cxr_solid pinf
= *(cxr_solid
*)cxr_ab_ptr(&world
->absolids
, i
);
2251 if( pinf
.displacement
|| pinf
.invalid
)
2256 cxr_mesh
*res
= cxr_pull_best_solid( pinf
.pmesh
, 0, &error
);
2260 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ res
, 0, 0 } );
2264 if( error
== k_soliderr_no_solids
)
2266 /* Retry if non-critical error, with extra edges */
2267 res
= cxr_pull_best_solid(pinf
.pmesh
, 1, &error
);
2270 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ res
, 0, 0 } );
2286 cxr_log( "Error %d\n", error
);
2287 cxr_free_world( world
);
2296 * format specific functions: vdf, vmf, (v)bsp
2297 * ----------------------------------------------------------------------------
2299 #ifdef CXR_VALVE_MAP_FILE
2301 CXR_API cxr_vdf
*cxr_vdf_open(const char *path
)
2303 cxr_vdf
*vdf
= malloc(sizeof(cxr_vdf
));
2306 vdf
->fp
= fopen( path
, "w" );
2317 CXR_API
void cxr_vdf_close(cxr_vdf
*vdf
)
2323 CXR_API
void cxr_vdf_put(cxr_vdf
*vdf
, const char *str
)
2325 for( int i
=0; i
<vdf
->level
; i
++ )
2326 fputs( " ", vdf
->fp
);
2328 fputs( str
, vdf
->fp
);
2331 static void cxr_vdf_printf( cxr_vdf
*vdf
, const char *fmt
, ... )
2333 cxr_vdf_put(vdf
,"");
2336 va_start( args
, fmt
);
2337 vfprintf( vdf
->fp
, fmt
, args
);
2341 CXR_API
void cxr_vdf_node(cxr_vdf
*vdf
, const char *str
)
2343 cxr_vdf_put( vdf
, str
);
2344 putc( (u8
)'\n', vdf
->fp
);
2345 cxr_vdf_put( vdf
, "{\n" );
2350 CXR_API
void cxr_vdf_edon( cxr_vdf
*vdf
)
2353 cxr_vdf_put( vdf
, "}\n" );
2356 CXR_API
void cxr_vdf_kv( cxr_vdf
*vdf
, const char *strk
, const char *strv
)
2358 cxr_vdf_printf( vdf
, "\"%s\" \"%s\"\n", strk
, strv
);
2362 * Data-type specific Keyvalues
2364 static void cxr_vdf_ki32( cxr_vdf
*vdf
, const char *strk
, i32 val
)
2366 cxr_vdf_printf( vdf
, "\"%s\" \"%d\"\n", strk
, val
);
2369 static void cxr_vdf_kdouble( cxr_vdf
*vdf
, const char *strk
, double val
)
2371 cxr_vdf_printf( vdf
, "\"%s\" \"%f\"\n", strk
, val
);
2374 static void cxr_vdf_kaxis( cxr_vdf
*vdf
, const char *strk
,
2375 v3f normal
, double offset
, double scale
2377 cxr_vdf_printf( vdf
, "\"%s\" \"[%f %f %f %f] %f\"\n",
2378 strk
, normal
[0], normal
[1],normal
[2], offset
, scale
);
2381 static void cxr_vdf_kv3f( cxr_vdf
*vdf
, const char *strk
, v3f v
)
2383 cxr_vdf_printf( vdf
, "\"%s\" \"[%f %f %f]\"\n", strk
, v
[0], v
[1], v
[2] );
2386 static void cxr_vdf_karrdouble( cxr_vdf
*vdf
, const char *strk
,
2387 int id
, double *doubles
, int count
2389 cxr_vdf_put(vdf
,"");
2390 fprintf( vdf
->fp
, "\"%s%d\" \"", strk
, id
);
2391 for( int i
=0; i
<count
; i
++ )
2393 if( i
== count
-1 ) fprintf( vdf
->fp
, "%f", doubles
[i
] );
2394 else fprintf( vdf
->fp
, "%f ", doubles
[i
] );
2396 fprintf( vdf
->fp
, "\"\n" );
2399 static void cxr_vdf_karrv3f( cxr_vdf
*vdf
, const char *strk
,
2400 int id
, v3f
*vecs
, int count
2402 cxr_vdf_put(vdf
,"");
2403 fprintf( vdf
->fp
, "\"%s%d\" \"", strk
, id
);
2404 for( int i
=0; i
<count
; i
++ )
2406 const char *format
= i
== count
-1? "%f %f %f": "%f %f %f ";
2407 fprintf( vdf
->fp
, format
, vecs
[i
][0], vecs
[i
][1], vecs
[i
][2] );
2409 fprintf( vdf
->fp
, "\"\n" );
2412 static void cxr_vdf_plane( cxr_vdf
*vdf
, const char *strk
, v3f a
, v3f b
, v3f c
)
2414 cxr_vdf_printf( vdf
, "\"%s\" \"(%f %f %f) (%f %f %f) (%f %f %f)\"\n",
2415 strk
, a
[0], a
[1], a
[2], b
[0], b
[1], b
[2], c
[0], c
[1], c
[2] );
2418 static void cxr_vdf_colour255(cxr_vdf
*vdf
, const char *strk
, v4f colour
)
2421 v4_muls( colour
, 255.0, scale
);
2422 cxr_vdf_printf( vdf
, "\"%s\" \"%d %d %d %d\"\n",
2423 strk
,(int)scale
[0], (int)scale
[1], (int)scale
[2], (int)scale
[3]);
2426 static struct cxr_material cxr_nodraw
=
2428 .res
= { 512, 512 },
2429 .name
= "tools/toolsnodraw"
2433 * Find most extreme point along a given direction
2435 static double support_distance( v3f verts
[3], v3f dir
, double coef
)
2439 coef
* v3_dot( verts
[0], dir
),
2442 coef
* v3_dot( verts
[1], dir
),
2443 coef
* v3_dot( verts
[2], dir
)
2449 * Convert regular UV'd triangle int Source's u/vaxis vectors
2451 * This supports affine move, scale, rotation, parallel skewing
2453 static void cxr_calculate_axis( cxr_texinfo
*transform
, v3f verts
[3],
2454 v2f uvs
[3], v2f texture_res
2456 v2f tT
, bT
; /* Tangent/bitangent pairs for UV space and world */
2459 v2_sub( uvs
[0], uvs
[1], tT
);
2460 v2_sub( uvs
[2], uvs
[1], bT
);
2461 v3_sub( verts
[0], verts
[1], tW
);
2462 v3_sub( verts
[2], verts
[1], bW
);
2464 /* Use arbitrary projection if there is no UV */
2465 if( v2_length( tT
) < 0.0001 || v2_length( bT
) < 0.0001 )
2467 v3f uaxis
, normal
, vaxis
;
2469 v3_copy( tW
, uaxis
);
2470 v3_normalize( uaxis
);
2472 v3_cross( tW
, bW
, normal
);
2473 v3_cross( normal
, uaxis
, vaxis
);
2474 v3_normalize( vaxis
);
2476 v3_copy( uaxis
, transform
->uaxis
);
2477 v3_copy( vaxis
, transform
->vaxis
);
2478 v2_zero( transform
->offset
);
2480 v2_div( (v2f
){128.0, 128.0}, texture_res
, transform
->scale
);
2481 transform
->winding
= 1.0;
2485 /* Detect if UV is reversed */
2486 double winding
= v2_cross( tT
, bT
) >= 0.0f
? 1.0f
: -1.0f
;
2488 /* UV projection reference */
2490 v2_muls((v2f
){1,0}, winding
, vX
);
2491 v2_muls((v2f
){0,1}, winding
, vY
);
2493 /* Reproject reference into world space, including skew */
2496 v3_muls( tW
, v2_cross(vX
,bT
) / v2_cross(bT
,tT
), uaxis1
);
2497 v3_muladds( uaxis1
, bW
, v2_cross(vX
, tT
) / v2_cross(tT
,bT
), uaxis1
);
2499 v3_muls( tW
, v2_cross(vY
,bT
) / v2_cross(bT
,tT
), vaxis1
);
2500 v3_muladds( vaxis1
, bW
, v2_cross(vY
,tT
) / v2_cross(tT
,bT
), vaxis1
);
2502 v3_normalize( uaxis1
);
2503 v3_normalize( vaxis1
);
2505 /* Apply source transform to axis (yes, they also need to be swapped) */
2506 v3f norm
, uaxis
, vaxis
;
2508 v3_cross( bW
, tW
, norm
);
2510 v3_cross( vaxis1
, norm
, uaxis
);
2511 v3_cross( uaxis1
, norm
, vaxis
);
2514 v2f uvmin
, uvmax
, uvdelta
;
2515 v2_minv( uvs
[0], uvs
[1], uvmin
);
2516 v2_minv( uvmin
, uvs
[2], uvmin
);
2517 v2_maxv( uvs
[0], uvs
[1], uvmax
);
2518 v2_maxv( uvmax
, uvs
[2], uvmax
);
2520 v2_sub( uvmax
, uvmin
, uvdelta
);
2522 /* world-uv scale */
2523 v2f uvminw
, uvmaxw
, uvdeltaw
;
2524 uvminw
[0] = -support_distance( verts
, uaxis
, -1.0f
);
2525 uvmaxw
[0] = support_distance( verts
, uaxis
, 1.0f
);
2526 uvminw
[1] = -support_distance( verts
, vaxis
, -1.0f
);
2527 uvmaxw
[1] = support_distance( verts
, vaxis
, 1.0f
);
2529 v2_sub( uvmaxw
, uvminw
, uvdeltaw
);
2533 v2_div( uvdeltaw
, uvdelta
, uv_scale
);
2534 v2_div( uv_scale
, texture_res
, uv_scale
);
2536 /* Find offset via 'natural' point */
2537 v2f target_uv
, natural_uv
, tex_offset
;
2538 v2_mul( uvs
[0], texture_res
, target_uv
);
2540 natural_uv
[0] = v3_dot( uaxis
, verts
[0] );
2541 natural_uv
[1] = -v3_dot( vaxis
, verts
[0] );
2542 v2_div( natural_uv
, uv_scale
, natural_uv
);
2544 tex_offset
[0] = target_uv
[0]-natural_uv
[0];
2545 tex_offset
[1] = -(target_uv
[1]-natural_uv
[1]);
2547 /* Copy everything into output */
2548 v3_copy( uaxis
, transform
->uaxis
);
2549 v3_copy( vaxis
, transform
->vaxis
);
2550 v2_copy( tex_offset
, transform
->offset
);
2551 v2_copy( uv_scale
, transform
->scale
);
2552 transform
->winding
= winding
;
2556 * Get the maximal direction of a vector, while also ignoring an axis
2559 static int cxr_cardinal( v3f a
, int ignore
)
2562 double component_max
= -CXR_BIG_NUMBER
;
2564 for( int i
=0; i
<3; i
++ )
2566 if( i
== ignore
) continue;
2568 if( fabs(a
[i
]) > component_max
)
2570 component_max
= fabs(a
[i
]);
2574 double d
= a
[component
] >= 0.0? 1.0: -1.0;
2582 * Convert contiguous mesh to displacement patch
2584 static int cxr_write_disp( cxr_mesh
*mesh
, cxr_world
*world
,
2585 cxr_vmf_context
*ctx
, cxr_vdf
*output
2587 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
2591 int con_start
, con_count
;
2599 *vertinfo
= malloc( sizeof(struct vertinfo
)*mesh
->p_abverts
->count
);
2600 int *graph
= malloc( sizeof(int) * mesh
->abedges
.count
*2 );
2603 for( int i
=0; i
<mesh
->p_abverts
->count
; i
++ )
2605 struct vertinfo
*info
= &vertinfo
[i
];
2606 info
->con_start
= con_pos
;
2607 info
->con_count
= 0;
2614 for( int j
=0; j
<mesh
->abedges
.count
; j
++ )
2616 cxr_edge
*edge
= &mesh
->edges
[j
];
2618 if( edge
->i0
== i
|| edge
->i1
== i
)
2620 graph
[ con_pos
++ ] = edge
->i0
== i
? edge
->i1
: edge
->i0
;
2623 if( edge
->freestyle
)
2629 v3f refv
, refu
, refn
;
2630 v3_zero(refv
); v3_zero(refu
); v3_zero(refn
);
2633 * Approximately match the area of the result brush faces to the actual
2636 * Necessary for accuracy and even lightmap texel allocation
2639 double uv_area
= 0.0, face_area
= 0.0, sf
;
2640 v2f uvboundmin
, uvboundmax
;
2641 v3f faceboundmin
, faceboundmax
;
2645 v2_fill( uvboundmin
, CXR_BIG_NUMBER
);
2646 v2_fill( uvboundmax
, -CXR_BIG_NUMBER
);
2647 v3_fill( faceboundmin
, CXR_BIG_NUMBER
);
2648 v3_fill( faceboundmax
, -CXR_BIG_NUMBER
);
2650 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
2652 cxr_polygon
*poly
= &mesh
->polys
[i
];
2654 for( int j
=0; j
<poly
->loop_total
; j
++ )
2656 cxr_loop
*lp0
= &mesh
->loops
[ poly
->loop_start
+j
];
2657 v2_minv( lp0
->uv
, uvboundmin
, uvboundmin
);
2658 v2_maxv( lp0
->uv
, uvboundmax
, uvboundmax
);
2659 v3_minv( verts
[lp0
->index
], faceboundmin
, faceboundmin
);
2660 v3_maxv( verts
[lp0
->index
], faceboundmax
, faceboundmax
);
2663 for( int j
=0; j
<poly
->loop_total
-2; j
++ )
2665 cxr_loop
*lp0
= &mesh
->loops
[poly
->loop_start
],
2666 *lp1
= &mesh
->loops
[poly
->loop_start
+j
+1],
2667 *lp2
= &mesh
->loops
[poly
->loop_start
+j
+2];
2670 v3_sub( verts
[lp1
->index
], verts
[lp0
->index
], va
);
2671 v3_sub( verts
[lp2
->index
], verts
[lp0
->index
], vb
);
2672 v3_cross( va
, vb
, orth
);
2674 face_area
+= v3_length( orth
) / 2.0;
2677 v2_sub( lp1
->uv
, lp0
->uv
, uva
);
2678 v2_sub( lp2
->uv
, lp0
->uv
, uvb
);
2680 uv_area
+= fabs(v2_cross( uva
, uvb
)) / 2.0;
2684 v3_add( faceboundmax
, faceboundmin
, face_center
);
2685 v3_muls( face_center
, 0.5, face_center
);
2686 v2_add( uvboundmin
, uvboundmax
, uv_center
);
2687 v2_muls( uv_center
, 0.5, uv_center
);
2689 sf
= sqrt( face_area
/ uv_area
);
2690 int corner_count
= 0;
2693 * Vertex classification
2694 * boundary vertices: they exist on a freestyle edge
2695 * corners: only connected to other boundaries
2697 for( int i
=0; i
<mesh
->p_abverts
->count
; i
++ )
2699 struct vertinfo
*info
= &vertinfo
[i
];
2700 if( !info
->boundary
) continue;
2705 for( int j
=0; j
<info
->con_count
; j
++ )
2707 int con
= graph
[info
->con_start
+j
];
2709 if( vertinfo
[con
].boundary
)
2715 if( count
> 2 || non_manifold
)
2723 * TODO(harry): This currently only supports power 2 displacements
2724 * its quite straightforward to upgrade it.
2726 * TODO(harry): Error checking is needed here for bad input data
2734 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
2736 cxr_polygon
*basepoly
= &mesh
->polys
[i
];
2738 for( int h
=0; h
<basepoly
->loop_total
; h
++ )
2741 i1
= cxr_range(h
+1,basepoly
->loop_total
);
2743 cxr_loop
*l0
= &mesh
->loops
[ basepoly
->loop_start
+i0
],
2744 *l1
= &mesh
->loops
[ basepoly
->loop_start
+i1
];
2745 struct vertinfo
*info
= &vertinfo
[ l0
->index
];
2750 int corner_count
= 1;
2752 cxr_material
*matptr
=
2753 basepoly
->material_id
< 0 || !world
->materials
?
2755 &world
->materials
[ basepoly
->material_id
];
2758 dispedge
[0] = l0
->index
;
2759 dispedge
[1] = l1
->index
;
2760 v2_copy( l0
->uv
, corner_uvs
[0] );
2762 /* Consume (use) face from orignal mesh */
2763 basepoly
->loop_total
= -1;
2765 while( dispedge_count
< 17 )
2767 struct vertinfo
*edge_head
=
2768 &vertinfo
[dispedge
[dispedge_count
-1]];
2772 if( edge_head
->corner
)
2774 /* Find polygon that has edge C-1 -> C */
2775 for( int j
=0; j
<mesh
->abpolys
.count
&& !newvert
; j
++ )
2777 cxr_polygon
*poly
= &mesh
->polys
[j
];
2779 for( int k
=0; k
<poly
->loop_total
; k
++ )
2782 i1
= cxr_range(k
+1,poly
->loop_total
);
2784 cxr_loop
*l0
= &mesh
->loops
[ poly
->loop_start
+i0
],
2785 *l1
= &mesh
->loops
[ poly
->loop_start
+i1
];
2787 if( l0
->index
== dispedge
[dispedge_count
-2] &&
2788 l1
->index
== dispedge
[dispedge_count
-1] )
2790 /* Take the next edge */
2791 v2_copy( l1
->uv
, corner_uvs
[corner_count
++] );
2793 int i2
= cxr_range(i1
+1,poly
->loop_total
);
2794 cxr_loop
*l2
= &mesh
->loops
[ poly
->loop_start
+i2
];
2796 dispedge
[dispedge_count
++] = l2
->index
;
2798 poly
->loop_total
= -1;
2806 for( int j
=0; j
<edge_head
->con_count
; j
++ )
2808 int con
= graph
[edge_head
->con_start
+j
];
2813 if( dispedge_count
> 1 )
2814 if( con
== dispedge
[dispedge_count
-2] )
2817 struct vertinfo
*coninfo
= &vertinfo
[con
];
2819 if( !coninfo
->boundary
)
2822 dispedge
[ dispedge_count
++ ] = con
;
2835 /* All edges collected */
2838 v2_sub( corner_uvs
[1], corner_uvs
[0], va
);
2839 v2_sub( corner_uvs
[2], corner_uvs
[0], vb
);
2841 /* Connect up the grid
2849 * Example: a := common unused vertex that is connected to
2850 * by 1 and 15. Or y-1, and x-1 on the grid.
2851 * g := c and f common vert ^
2856 for( int j
=0; j
<5; j
++ ) grid
[j
] = dispedge
[j
];
2857 for( int j
=1; j
<5; j
++ ) grid
[j
*5+4] = dispedge
[j
+4];
2858 for( int j
=0; j
<4; j
++ ) grid
[4*5+3-j
] = dispedge
[j
+9];
2859 for( int j
=1; j
<4; j
++ ) grid
[j
*5] = dispedge
[16-j
];
2862 for( int j
=1; j
<4; j
++ )
2864 for( int k
=1; k
<4; k
++ )
2866 int s0
= grid
[(j
-1)*5+k
],
2869 struct vertinfo
*va
= &vertinfo
[s0
],
2870 *vb
= &vertinfo
[s1
];
2872 /* Find common non-used vertex */
2873 for( int l
=0; l
<va
->con_count
; l
++ )
2875 for( int m
=0; m
<vb
->con_count
; m
++ )
2877 int cona
= graph
[va
->con_start
+l
],
2878 conb
= graph
[vb
->con_start
+m
];
2882 if( vertinfo
[cona
].used
|| vertinfo
[cona
].boundary
)
2885 grid
[ j
*5+k
] = cona
;
2886 vertinfo
[cona
].used
= 1;
2894 cxr_log( "Broken displacement!\n" );
2905 * Create V reference based on first displacement.
2906 * TODO(harry): This is not the moststable selection method!
2907 * faces can come in any order, so the first disp will of
2908 * course always vary. Additionaly the triangle can be oriented
2911 * Improvement can be made by selecting a first disp/triangle
2912 * based on deterministic factors.
2914 if( disp_count
== 0 )
2918 v3_copy( verts
[dispedge
[0]], tri_ref
[0] );
2919 v3_copy( verts
[dispedge
[4]], tri_ref
[1] );
2920 v3_copy( verts
[dispedge
[8]], tri_ref
[2] );
2921 cxr_calculate_axis( &tx
, tri_ref
, corner_uvs
, (v2f
){512,512} );
2923 v3_muls( tx
.vaxis
, -1.0, refv
);
2924 int v_cardinal
= cxr_cardinal( refv
, -1 );
2926 v3_cross( tx
.vaxis
, tx
.uaxis
, refn
);
2927 v3_muls( refn
, -tx
.winding
, refn
);
2929 /* Computing new reference vectors */
2930 int n1_cardinal
= cxr_cardinal( refn
, v_cardinal
);
2934 for( int j
=0; j
<2; j
++ )
2935 if( u_cardinal
== n1_cardinal
|| u_cardinal
== v_cardinal
)
2939 refu
[u_cardinal
] = tx
.uaxis
[u_cardinal
] > 0.0? 1.0: -1.0;
2943 v3_copy( face_center
, p0
);
2944 v3_muladds( face_center
, refn
, 1.5, pn
);
2945 v3_muladds( face_center
, refv
, 1.5, pv
);
2946 v3_muladds( face_center
, refu
, 1.5, pu
);
2949 /* Create world coordinates */
2950 v3f world_corners
[8];
2953 for( int j
=0; j
<4; j
++ )
2956 v2_sub( corner_uvs
[j
], uv_center
, local_uv
);
2957 v2_copy( corner_uvs
[j
], world_uv
[j
] );
2958 v2_muls( local_uv
, sf
, local_uv
);
2960 v3_muls( refu
, local_uv
[0], world_corners
[j
] );
2961 v3_muladds( world_corners
[j
],refv
,local_uv
[1],world_corners
[j
] );
2962 v3_add( face_center
, world_corners
[j
], world_corners
[j
] );
2965 double *colour
= colours_random
[cxr_range(disp_count
,8)];
2967 for( int j
=0; j
<4; j
++ )
2968 v3_muladds( world_corners
[j
], refn
, -1.0, world_corners
[j
+4] );
2970 /* Apply world transform */
2971 for( int j
=0; j
<8; j
++ )
2973 double *p0
= world_corners
[j
];
2974 v3_muls( p0
, ctx
->scale
, p0
);
2975 v3_add( p0
, ctx
->offset
, p0
);
2978 cxr_texinfo texinfo_shared
;
2979 cxr_calculate_axis( &texinfo_shared
, world_corners
, world_uv
,
2980 (v2f
){ matptr
->res
[0], matptr
->res
[1] } );
2983 cxr_vdf_node( output
, "solid" );
2984 cxr_vdf_ki32( output
, "id", ++ ctx
->brush_count
);
2995 double distances
[25];
2997 v3f lside0
, lside1
, lref
, vdelta
, vworld
;
3000 for( int j
=0; j
<5; j
++ )
3002 ty
= (double)j
/(double)(5-1);
3004 v3_lerp( world_corners
[0], world_corners
[3], ty
, lside0
);
3005 v3_lerp( world_corners
[1], world_corners
[2], ty
, lside1
);
3007 for( int k
=0; k
<5; k
++ )
3011 tx
= (double)k
/(double)(5-1);
3012 v3_lerp( lside0
, lside1
, tx
, lref
);
3013 v3_muls( verts
[grid
[index
]], ctx
->scale
, vworld
);
3014 v3_add( ctx
->offset
, vworld
, ctx
->offset
);
3016 v3_sub( vworld
, lref
, vdelta
);
3017 v3_copy( vdelta
, normals
[index
] );
3018 v3_normalize( normals
[index
] );
3019 distances
[index
] = v3_dot( vdelta
, normals
[index
] );
3023 for( int j
=0; j
<6; j
++ )
3025 int *side
= sides
[j
];
3027 cxr_vdf_node( output
, "side" );
3028 cxr_vdf_ki32( output
, "id", ++ ctx
->face_count
);
3029 cxr_vdf_plane( output
, "plane", world_corners
[side
[2]],
3030 world_corners
[side
[1]],
3031 world_corners
[side
[0]] );
3033 cxr_vdf_kv( output
, "material", matptr
->name
);
3035 cxr_vdf_kaxis( output
, "uaxis",
3036 texinfo_shared
.uaxis
,
3037 texinfo_shared
.offset
[0],
3038 texinfo_shared
.scale
[0] );
3039 cxr_vdf_kaxis( output
, "vaxis",
3040 texinfo_shared
.vaxis
,
3041 texinfo_shared
.offset
[1],
3042 texinfo_shared
.scale
[1] );
3044 cxr_vdf_kdouble( output
, "rotation", 0.0 );
3045 cxr_vdf_ki32( output
, "lightmapscale", ctx
->lightmap_scale
);
3046 cxr_vdf_ki32( output
, "smoothing_groups", 0 );
3050 cxr_vdf_node( output
, "dispinfo" );
3051 cxr_vdf_ki32( output
, "power", 2 );
3052 cxr_vdf_kv3f( output
, "startposition", world_corners
[0] );
3053 cxr_vdf_ki32( output
, "flags", 0 );
3054 cxr_vdf_kdouble( output
, "elevation", 0.0 );
3055 cxr_vdf_ki32( output
, "subdiv", 0 );
3057 cxr_vdf_node( output
, "normals" );
3058 for( int k
=0; k
<5; k
++ )
3059 cxr_vdf_karrv3f( output
, "row", k
, &normals
[k
*5], 5 );
3060 cxr_vdf_edon( output
);
3062 cxr_vdf_node( output
, "distances" );
3063 for( int k
=0; k
<5; k
++ )
3064 cxr_vdf_karrdouble( output
, "row", k
, &distances
[k
*5], 5 );
3065 cxr_vdf_edon( output
);
3068 * TODO: This might be needed for the compilers. Opens fine in
3073 cxr_vdf_node( output, "offsets" );
3074 for( int k=0; k<5; k++ )
3075 cxr_vdf_printf( output,
3076 "\"row%d\" \"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\"\n", k );
3077 cxr_vdf_edon( output );
3079 cxr_vdf_node( output, "offset_normals" );
3080 for( int k=0; k<5; k++ )
3081 cxr_vdf_printf( output,
3082 "\"row%d\" \"0 0 1 0 0 1 0 0 1 0 0 1 0 0 1\"\n", k );
3083 cxr_vdf_edon( output );
3085 cxr_vdf_node( output, "alphas" );
3086 for( int k=0; k<5; k++ )
3087 cxr_vdf_printf( output, "\"row%d\" \"0 0 0 0 0\"\n", k );
3088 cxr_vdf_edon( output );
3090 cxr_vdf_node( output, "triangle_tags" );
3091 for( int k=0; k<5-1; k++ )
3092 cxr_vdf_printf( output,
3093 "\"row%d\" \"9 9 9 9 9 9 9 9\"\n", k );
3094 cxr_vdf_edon( output );
3096 cxr_vdf_node( output, "allowed_verts" );
3097 cxr_vdf_printf( output,
3098 "\"10\" \"-1 -1 -1 -1 -1 -1 -1 -1 -1 -1\"\n" );
3099 cxr_vdf_edon( output );
3102 cxr_vdf_edon( output
);
3105 cxr_vdf_edon( output
);
3108 cxr_vdf_node( output
, "editor");
3109 cxr_vdf_colour255( output
, "color",
3110 colours_random
[cxr_range(ctx
->brush_count
,8)]);
3112 cxr_vdf_ki32( output
, "visgroupshown",1);
3113 cxr_vdf_ki32( output
, "visgroupautoshown",1);
3114 cxr_vdf_edon( output
);
3116 cxr_vdf_edon( output
);
3128 * Write header information for a vmf to vdf
3130 CXR_API
void cxr_begin_vmf( cxr_vmf_context
*ctx
, cxr_vdf
*output
)
3132 cxr_vdf_node( output
, "versioninfo" );
3133 cxr_vdf_ki32( output
, "editorversion", 400 );
3134 cxr_vdf_ki32( output
, "editorbuild", 8456 );
3135 cxr_vdf_ki32( output
, "mapversion", ctx
->mapversion
);
3136 cxr_vdf_ki32( output
, "formatversion", 100 );
3137 cxr_vdf_ki32( output
, "prefab", 0 );
3138 cxr_vdf_edon( output
);
3140 cxr_vdf_node( output
, "visgroups" );
3141 cxr_vdf_edon( output
);
3143 cxr_vdf_node( output
, "viewsettings" );
3144 cxr_vdf_ki32( output
, "bSnapToGrid", 1 );
3145 cxr_vdf_ki32( output
, "bShowGrid", 1 );
3146 cxr_vdf_ki32( output
, "bShowLogicalGrid", 0 );
3147 cxr_vdf_ki32( output
, "nGridSpacing", 64 );
3148 cxr_vdf_ki32( output
, "bShow3DGrid", 0 );
3149 cxr_vdf_edon( output
);
3151 cxr_vdf_node( output
, "world" );
3152 cxr_vdf_ki32( output
, "id", 1 );
3153 cxr_vdf_ki32( output
, "mapversion", 1 ); /* ?? */
3154 cxr_vdf_kv( output
, "classname", "worldspawn" );
3155 cxr_vdf_kv( output
, "skyname", ctx
->skyname
);
3156 cxr_vdf_ki32( output
, "maxpropscreenwidth", -1 );
3157 cxr_vdf_kv( output
, "detailvbsp", ctx
->detailvbsp
);
3158 cxr_vdf_kv( output
, "detailmaterial", ctx
->detailmaterial
);
3161 /* Fairly useless but might need in the future */
3162 CXR_API
void cxr_vmf_begin_entities( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
)
3164 cxr_vdf_edon( vdf
);
3167 CXR_API
void cxr_end_vmf( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
)
3172 * Write solids (and displacements) to VMF file
3174 CXR_API
void cxr_push_world_vmf( cxr_world
*world
, cxr_vmf_context
*ctx
,
3177 v3f
*verts
= cxr_ab_ptr( &world
->abverts
, 0 );
3179 /* Write all solids as VMF brushes */
3180 for( int i
=0; i
<world
->absolids
.count
; i
++ )
3182 cxr_solid
*solid
= cxr_ab_ptr(&world
->absolids
,i
);
3184 if( solid
->displacement
)
3186 cxr_write_disp( solid
->pmesh
, world
, ctx
, output
);
3190 cxr_vdf_node( output
, "solid" );
3191 cxr_vdf_ki32( output
, "id", ++ ctx
->brush_count
);
3193 for( int j
=0; j
<solid
->pmesh
->abpolys
.count
; j
++ )
3195 cxr_polygon
*poly
= &solid
->pmesh
->polys
[j
];
3196 cxr_loop
*ploops
= &solid
->pmesh
->loops
[poly
->loop_start
];
3198 cxr_material
*matptr
=
3199 poly
->material_id
< 0 || !world
->materials
?
3201 &world
->materials
[ poly
->material_id
];
3203 cxr_vdf_node( output
, "side" );
3204 cxr_vdf_ki32( output
, "id", ++ ctx
->face_count
);
3206 v3f tri
[3]; v2f uvs
[3];
3208 int i0
= ploops
[0].index
,
3209 i1
= ploops
[1].index
,
3210 i2
= ploops
[2].index
;
3212 v3_muls( verts
[i0
], ctx
->scale
, tri
[0] );
3213 v3_muls( verts
[i1
], ctx
->scale
, tri
[1] );
3214 v3_muls( verts
[i2
], ctx
->scale
, tri
[2] );
3216 v3_add( ctx
->offset
, tri
[0], tri
[0] );
3217 v3_add( ctx
->offset
, tri
[1], tri
[1] );
3218 v3_add( ctx
->offset
, tri
[2], tri
[2] );
3220 v2_copy( ploops
[0].uv
, uvs
[0] );
3221 v2_copy( ploops
[1].uv
, uvs
[1] );
3222 v2_copy( ploops
[2].uv
, uvs
[2] );
3224 cxr_vdf_plane( output
, "plane", tri
[2], tri
[1], tri
[0] );
3225 cxr_vdf_kv( output
, "material", matptr
->name
);
3228 cxr_calculate_axis( &tx
, tri
, uvs
,
3229 (double[2]){ matptr
->res
[0], matptr
->res
[1] });
3231 cxr_vdf_kaxis( output
, "uaxis", tx
.uaxis
, tx
.offset
[0], tx
.scale
[0]);
3232 cxr_vdf_kaxis( output
, "vaxis", tx
.vaxis
, tx
.offset
[1], tx
.scale
[1]);
3234 cxr_vdf_kdouble( output
, "rotation", 0.0 );
3235 cxr_vdf_ki32( output
, "lightmapscale", ctx
->lightmap_scale
);
3236 cxr_vdf_ki32( output
, "smoothing_groups", 0);
3238 cxr_vdf_edon( output
);
3241 cxr_vdf_node( output
, "editor" );
3242 cxr_vdf_colour255( output
, "color",
3243 colours_random
[cxr_range(ctx
->brush_count
,8)]);
3245 cxr_vdf_ki32( output
, "visgroupshown", 1 );
3246 cxr_vdf_ki32( output
, "visgroupautoshown", 1 );
3247 cxr_vdf_edon( output
);
3249 cxr_vdf_edon( output
);
3254 * Valve Source SDK 2015 CS:GO
3256 #define HEADER_LUMPS 64
3257 #define LUMP_WORLDLIGHTS 54
3259 #pragma pack(push,1)
3268 int fileofs
, filelen
;
3273 lumps
[ HEADER_LUMPS
];
3283 float shadow_cast_offset
[3];
3291 float constant_attn
;
3293 float quadratic_attn
;
3301 * Utility for patching BSP tools to remove -1 distance lights (we set them
3302 * like that, because we want these lights to go away)
3304 * Yes, there is no way to do this in hammer
3305 * Yes, the distance KV is unused but still gets compiled to this lump
3306 * No, Entities only compile will not do this for you
3308 CXR_API
int cxr_lightpatch_bsp( const char *path
)
3310 printf( "Lightpatch: %s\n", path
);
3312 FILE *fp
= fopen( path
, "r+b" );
3317 cxr_log( "Could not open BSP file for editing (r+b)\n" );
3323 struct header header
;
3324 fread( &header
, sizeof(struct header
), 1, fp
);
3325 struct lump
*lump
= &header
.lumps
[ LUMP_WORLDLIGHTS
];
3327 /* Read worldlight array */
3328 struct worldlight
*lights
= malloc( lump
->filelen
);
3329 fseek( fp
, lump
->fileofs
, SEEK_SET
);
3330 fread( lights
, lump
->filelen
, 1, fp
);
3332 /* Remove all marked lights */
3333 int light_count
= lump
->filelen
/ sizeof(struct worldlight
);
3336 for( int i
= 0; i
< light_count
; i
++ )
3337 if( lights
[i
].radius
>= 0.0f
)
3338 lights
[new_count
++] = lights
[i
];
3340 lump
->filelen
= new_count
*sizeof(struct worldlight
);
3342 /* Write changes back to file */
3343 fseek( fp
, lump
->fileofs
, SEEK_SET
);
3344 fwrite( lights
, lump
->filelen
, 1, fp
);
3345 fseek( fp
, 0, SEEK_SET
);
3346 fwrite( &header
, sizeof(struct header
), 1, fp
);
3349 cxr_log( "removed %d marked lights\n", light_count
-new_count
);
3357 #endif /* CXR_VALVE_MAP_FILE */
3358 #endif /* CXR_IMPLEMENTATION */