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 - Bestest VTF compressor (thanks to Richgel999 and stb)
17 - Pack content automatically
21 File/folder Lang Purpose
23 __init__.py Python Blender plugin interface
26 cxr.h C Heavy lifting; brush decomp, mesh processing
27 cxr_math.h C Vector maths and other handy things
28 cxr_mem.h C Automatic resizing buffers
29 libcxr.c C Compile as SO
32 nbvtf.h C VTF processing interface
33 librgcx.h C++ Rich Geldreich's DXT1/DXT5 compressors
34 stb/ C Sean Barrets image I/O
50 #define CXR_EPSILON 0.001
51 #define CXR_PLANE_SIMILARITY_MAX 0.998
52 #define CXR_BIG_NUMBER 1e300
53 #define CXR_INTERIOR_ANGLE_MAX 0.998
56 #define CXR_IMPLEMENTATION
75 typedef unsigned int uint
;
77 typedef double v2f
[2];
78 typedef double v3f
[3];
79 typedef double v4f
[4];
87 typedef struct cxr_world cxr_world
;
88 typedef struct cxr_solid cxr_solid
;
90 typedef struct cxr_mesh cxr_mesh
;
91 typedef struct cxr_edge cxr_edge
;
92 typedef struct cxr_polygon cxr_polygon
;
93 typedef struct cxr_static_mesh cxr_static_mesh
;
94 typedef struct cxr_loop cxr_loop
;
95 typedef struct cxr_static_loop cxr_static_loop
;
96 typedef struct cxr_material cxr_material
;
97 typedef struct cxr_tri_mesh cxr_tri_mesh
;
99 #ifdef CXR_VALVE_MAP_FILE
100 typedef struct cxr_vdf cxr_vdf
;
101 typedef struct cxr_texinfo cxr_texinfo
;
102 typedef struct cxr_vmf_context cxr_vmf_context
;
103 #endif /* CXR_VALVE_MAP_FILE */
109 /* Main convexer algorithms */
110 /* Convex decomp from mesh */
111 CXR_API cxr_world
*cxr_decompose( cxr_static_mesh
*src
, i32
*perrcode
);
112 CXR_API
void cxr_free_world( cxr_world
*world
);
113 CXR_API cxr_tri_mesh
*cxr_world_preview( cxr_world
*world
);
114 CXR_API
void cxr_free_tri_mesh( cxr_tri_mesh
*mesh
);
116 #ifdef CXR_VALVE_MAP_FILE
118 CXR_API
void cxr_begin_vmf( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
);
119 CXR_API
void cxr_vmf_begin_entities( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
);
120 CXR_API
void cxr_push_world_vmf(
121 cxr_world
*world
, cxr_vmf_context
*ctx
, cxr_vdf
*vdf
);
122 CXR_API
void cxr_end_vmf( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
);
125 CXR_API cxr_vdf
*cxr_vdf_open( const char *path
);
126 CXR_API
void cxr_vdf_close( cxr_vdf
*vdf
);
127 CXR_API
void cxr_vdf_put( cxr_vdf
*vdf
, const char *str
);
128 CXR_API
void cxr_vdf_node( cxr_vdf
*vdf
, const char *str
);
129 CXR_API
void cxr_vdf_edon( cxr_vdf
*vdf
);
130 CXR_API
void cxr_vdf_kv( cxr_vdf
*vdf
, const char *strk
, const char *strv
);
133 CXR_API
int cxr_lightpatch_bsp( const char *path
);
134 #endif /* CXR_VALVE_MAP_FILE */
138 CXR_API
void cxr_set_log_function( void (*func
)(const char *str
) );
139 CXR_API
void cxr_set_line_function( void (*func
)(v3f p0
, v3f p1
, v4f colour
) );
140 CXR_API
void cxr_write_test_data( cxr_static_mesh
*src
);
141 #endif /* CXR_DEBUG */
143 struct cxr_static_mesh
150 i32 freestyle
, sharp
;
154 struct cxr_static_loop
164 i32 loop_start
, loop_total
;
167 i32 material_id
; /* -1: interior material (nodraw) */
206 cxr_material
*materials
;
217 *p_abverts
; /* This data is stored externally because the data is often
218 shared between solids. */
220 /* Valid when update() is called on this mesh,
221 * Invalid when data is appended to them */
222 struct cxr_edge
*edges
;
223 struct cxr_polygon
*polys
;
224 struct cxr_loop
*loops
;
227 /* Simple mesh type mainly for debugging */
237 #ifdef CXR_VALVE_MAP_FILE
246 * Simplified VDF writing interface. No allocations or nodes, just write to file
254 struct cxr_vmf_context
262 /* Transform settings */
272 #endif /* CXR_VALVE_MAP_FILE */
277 k_soliderr_non_manifold
,
278 k_soliderr_bad_manifold
,
279 k_soliderr_no_solids
,
280 k_soliderr_degenerate_implicit
,
281 k_soliderr_non_coplanar_vertices
,
282 k_soliderr_non_convex_poly
,
283 k_soliderr_bad_result
,
284 k_soliderr_invalid_input
289 * -----------------------------------------------------------------------------
291 #ifdef CXR_IMPLEMENTATION
293 const char *cxr_build_time
= __DATE__
" @" __TIME__
;
296 static void (*cxr_log_func
)(const char *str
);
297 static void (*cxr_line_func
)( v3f p0
, v3f p1
, v4f colour
);
299 static int cxr_range(int x
, int bound
)
302 x
+= bound
* (x
/bound
+ 1);
308 * This should be called after appending any data to those buffers
310 static void cxr_mesh_update( cxr_mesh
*mesh
)
312 mesh
->edges
= cxr_ab_ptr(&mesh
->abedges
, 0);
313 mesh
->polys
= cxr_ab_ptr(&mesh
->abpolys
, 0);
314 mesh
->loops
= cxr_ab_ptr(&mesh
->abloops
, 0);
317 static v4f colours_random
[] =
319 { 0.863, 0.078, 0.235, 0.4 },
320 { 0.000, 0.980, 0.604, 0.4 },
321 { 0.118, 0.565, 1.000, 0.4 },
322 { 0.855, 0.439, 0.839, 0.4 },
323 { 0.824, 0.412, 0.118, 0.4 },
324 { 0.125, 0.698, 0.667, 0.4 },
325 { 0.541, 0.169, 0.886, 0.4 },
326 { 1.000, 0.843, 0.000, 0.4 }
329 static v4f colours_solids
[] =
331 { 100, 143, 255, 200 },
332 { 120, 94, 240, 200 },
333 { 220, 38, 127, 200 },
338 static v4f colour_entity
= { 37, 241, 122, 255 };
339 static v4f colour_displacement_solid
= { 146, 146, 146, 120 };
340 static v4f colour_error
= { 1.0f
, 0.0f
, 0.0f
, 1.0f
};
341 static v4f colour_face_graph
= { 1.0f
, 1.0f
, 1.0f
, 0.03f
};
342 static v4f colour_success
= { 0.0f
, 1.0f
, 0.0f
, 1.0f
};
344 static void value_random(int n
, v4f colour
)
346 double val
= cxr_range(n
,8);
350 v3_muls( colour
, val
, colour
);
353 static void colour_random_brush(int n
, v4f colour
)
357 int colour_n
= cxr_range( n
, 5 );
358 v4_muls( colours_solids
[ colour_n
], 1.0/255.0, colour
);
359 value_random( value_n
, colour
);
361 int colour_n
= cxr_range( n
, 8 );
362 v4_copy( colours_random
[ colour_n
], colour
);
367 * Debugging and diagnostic utilities
368 * -----------------------------------------------------------------------------
373 static void cxr_log( const char *fmt
, ... )
378 va_start( args
, fmt
);
379 vsnprintf( buf
, sizeof(buf
)-1, fmt
, args
);
388 static void cxr_debug_line( v3f p0
, v3f p1
, v4f colour
)
391 cxr_line_func( p0
, p1
, colour
);
394 static void cxr_debug_box( v3f p0
, double sz
, v4f colour
)
398 v3_add(p0
, (v3f
){-sz
,-sz
,-sz
}, a
);
399 v3_add(p0
, (v3f
){-sz
, sz
,-sz
}, b
);
400 v3_add(p0
, (v3f
){ sz
, sz
,-sz
}, c
);
401 v3_add(p0
, (v3f
){ sz
,-sz
,-sz
}, d
);
402 v3_add(p0
, (v3f
){-sz
,-sz
,sz
}, a1
);
403 v3_add(p0
, (v3f
){-sz
, sz
,sz
}, b1
);
404 v3_add(p0
, (v3f
){ sz
, sz
,sz
}, c1
);
405 v3_add(p0
, (v3f
){ sz
,-sz
,sz
}, d1
);
407 cxr_debug_line( a
,b
, colour
);
408 cxr_debug_line( b
,c
, colour
);
409 cxr_debug_line( c
,d
, colour
);
410 cxr_debug_line( d
,a
, colour
);
411 cxr_debug_line( a1
,b1
, colour
);
412 cxr_debug_line( b1
,c1
, colour
);
413 cxr_debug_line( c1
,d1
, colour
);
414 cxr_debug_line( d1
,a1
, colour
);
415 cxr_debug_line( a
,a1
, colour
);
416 cxr_debug_line( b
,b1
, colour
);
417 cxr_debug_line( c
,c1
, colour
);
418 cxr_debug_line( d
,d1
, colour
);
422 * Draw arrow with the tips oriented along normal
424 static void cxr_debug_arrow( v3f p0
, v3f p1
, v3f normal
, double sz
, v4f colour
)
426 v3f dir
, tan
, p2
, p3
;
430 v3_cross(dir
,normal
,tan
);
431 v3_muladds( p1
,dir
, -sz
, p2
);
432 v3_muladds( p2
,tan
,sz
,p3
);
433 cxr_debug_line( p1
, p3
, colour
);
434 v3_muladds( p2
,tan
,-sz
,p3
);
435 cxr_debug_line( p1
, p3
, colour
);
436 cxr_debug_line( p0
, p1
, colour
);
440 * Draw arrows CCW around polygon, draw normal vector from center
442 static void cxr_debug_poly( cxr_mesh
*mesh
, cxr_polygon
*poly
, v4f colour
)
444 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
446 for( int i
=0; i
<poly
->loop_total
; i
++ )
448 int lp0
= poly
->loop_start
+i
,
449 lp1
= poly
->loop_start
+cxr_range(i
+1,poly
->loop_total
);
451 int i0
= mesh
->loops
[ lp0
].index
,
452 i1
= mesh
->loops
[ lp1
].index
;
456 v3_lerp( verts
[i0
], poly
->center
, 0.0075, p0
);
457 v3_lerp( verts
[i1
], poly
->center
, 0.0075, p1
);
458 v3_muladds( p0
, poly
->normal
, 0.01, p0
);
459 v3_muladds( p1
, poly
->normal
, 0.01, p1
);
461 cxr_debug_arrow( p0
, p1
, poly
->normal
, 0.05, colour
);
465 v3_muladds( poly
->center
, poly
->normal
, 0.3, nrm0
);
467 cxr_debug_line( poly
->center
, nrm0
, colour
);
470 static void cxr_debug_mesh(cxr_mesh
*mesh
, v4f colour
)
472 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
474 cxr_polygon
*poly
= &mesh
->polys
[i
];
475 cxr_debug_poly( mesh
, poly
, colour
);
479 CXR_API
void cxr_write_test_data( cxr_static_mesh
*src
)
482 "/home/harry/Documents/blender_addons_remote/addons/convexer/cxr/solid.h",
485 fprintf( fp
, "v3f test_verts[] = {\n" );
486 for( int i
=0; i
<src
->vertex_count
; i
++ )
488 fprintf( fp
, " { %f, %f, %f },\n",
491 src
->vertices
[i
][2] );
493 fprintf( fp
, "};\n" );
495 fprintf( fp
, "cxr_static_loop test_loops[] = {\n" );
496 for( int i
=0; i
<src
->loop_count
; i
++ )
498 fprintf( fp
, " {%d, %d},\n",
500 src
->loops
[i
].edge_index
);
502 fprintf( fp
, "};\n" );
504 fprintf( fp
, "cxr_polygon test_polys[] = {\n" );
505 for( int i
=0; i
<src
->poly_count
; i
++ )
507 fprintf( fp
, " {%d, %d, {%f, %f, %f}, {%f, %f, %f}},\n",
508 src
->polys
[i
].loop_start
,
509 src
->polys
[i
].loop_total
,
510 src
->polys
[i
].normal
[0],
511 src
->polys
[i
].normal
[1],
512 src
->polys
[i
].normal
[2],
513 src
->polys
[i
].center
[0],
514 src
->polys
[i
].center
[1],
515 src
->polys
[i
].center
[2] );
517 fprintf( fp
, "};\n" );
519 fprintf( fp
, "cxr_edge test_edges[] = {\n" );
520 for( int i
=0; i
<src
->edge_count
; i
++ )
522 fprintf( fp
, " {%d, %d, %d, %d},\n",
525 src
->edges
[i
].freestyle
,
529 fprintf( fp
, "};\n" );
531 fprintf( fp
, "cxr_static_mesh test_mesh = {\n" );
532 fprintf( fp
, " .vertices = test_verts,\n" );
533 fprintf( fp
, " .loops = test_loops,\n" );
534 fprintf( fp
, " .edges = test_edges,\n" );
535 fprintf( fp
, " .polys = test_polys,\n" );
536 fprintf( fp
, " .poly_count=%d,\n", src
->poly_count
);
537 fprintf( fp
, " .vertex_count=%d,\n", src
->vertex_count
);
538 fprintf( fp
, " .edge_count=%d,\n",src
->edge_count
);
539 fprintf( fp
, " .loop_count=%d\n", src
->loop_count
);
540 fprintf( fp
, "};\n" );
545 CXR_API
void cxr_set_log_function( void (*func
)(const char *str
) )
550 CXR_API
void cxr_set_line_function( void (*func
)(v3f p0
, v3f p1
, v4f colour
) )
552 cxr_line_func
= func
;
555 #endif /* CXR_DEBUG */
559 * abverts is a pointer to an existing vertex buffer
561 static cxr_mesh
*cxr_alloc_mesh( int edge_count
, int loop_count
, int poly_count
,
564 cxr_mesh
*mesh
= malloc(sizeof(cxr_mesh
));
565 cxr_ab_init(&mesh
->abedges
, sizeof(cxr_edge
), edge_count
);
566 cxr_ab_init(&mesh
->abloops
, sizeof(cxr_loop
), loop_count
);
567 cxr_ab_init(&mesh
->abpolys
, sizeof(cxr_polygon
), poly_count
);
568 mesh
->p_abverts
= abverts
;
570 cxr_mesh_update( mesh
);
575 static void cxr_free_mesh( cxr_mesh
*mesh
)
577 cxr_ab_free(&mesh
->abedges
);
578 cxr_ab_free(&mesh
->abloops
);
579 cxr_ab_free(&mesh
->abpolys
);
584 * Rebuilds edge data for mesh (useful to get rid of orphaned edges)
586 static void cxr_mesh_clean_edges( cxr_mesh
*mesh
)
588 cxr_abuffer new_edges
;
589 cxr_ab_init( &new_edges
, sizeof(cxr_edge
), mesh
->abedges
.count
);
591 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
593 cxr_polygon
*poly
= &mesh
->polys
[i
];
594 for( int j
=0; j
<poly
->loop_total
; j
++ )
597 *lp0
= &mesh
->loops
[poly
->loop_start
+j
],
598 *lp1
= &mesh
->loops
[poly
->loop_start
+cxr_range(j
+1,poly
->loop_total
)];
600 int i0
= cxr_min(lp0
->index
, lp1
->index
),
601 i1
= cxr_max(lp0
->index
, lp1
->index
);
603 /* Check if edge exists before adding */
604 for( int k
=0; k
<new_edges
.count
; k
++ )
606 cxr_edge
*edge
= cxr_ab_ptr(&new_edges
,k
);
608 if( edge
->i0
== i0
&& edge
->i1
== i1
)
611 goto IL_EDGE_CREATED
;
615 int orig_edge_id
= lp0
->edge_index
;
616 lp0
->edge_index
= new_edges
.count
;
618 cxr_edge edge
= { i0
, i1
};
621 * Copy extra information from original edges
624 if( orig_edge_id
< mesh
->abedges
.count
)
626 cxr_edge
*orig_edge
= &mesh
->edges
[ orig_edge_id
];
627 edge
.freestyle
= orig_edge
->freestyle
;
628 edge
.sharp
= orig_edge
->sharp
;
636 cxr_ab_push( &new_edges
, &edge
);
642 cxr_ab_free( &mesh
->abedges
);
643 mesh
->abedges
= new_edges
;
645 cxr_mesh_update( mesh
);
649 * Remove 0-length faces from mesh (we mark them light that for deletion
650 * Remove all unused loops as a result of removing those faces
652 static void cxr_mesh_clean_faces( cxr_mesh
*mesh
)
654 cxr_abuffer loops_new
;
655 cxr_ab_init( &loops_new
, sizeof(cxr_loop
), mesh
->abloops
.count
);
658 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
660 cxr_polygon
*src
= &mesh
->polys
[i
],
661 *dst
= &mesh
->polys
[new_length
];
663 if( src
->loop_total
> 0 )
665 int src_start
= src
->loop_start
,
666 src_total
= src
->loop_total
;
669 dst
->loop_start
= loops_new
.count
;
671 for( int j
=0; j
<src_total
; j
++ )
673 cxr_loop
*loop
= &mesh
->loops
[src_start
+j
],
674 *ldst
= cxr_ab_ptr(&loops_new
,dst
->loop_start
+j
);
676 ldst
->poly_left
= new_length
;
679 loops_new
.count
+= src_total
;
684 cxr_ab_free( &mesh
->abloops
);
685 mesh
->abloops
= loops_new
;
686 mesh
->abpolys
.count
= new_length
;
688 cxr_mesh_update( mesh
);
692 * Links loop's poly_left and poly_right
693 * Does not support more than 2 polys to one edge
695 * Returns 0 if there is non-manifold geomtry (aka: not watertight)
697 static int cxr_mesh_link_loops( cxr_mesh
*mesh
)
699 i32
*polygon_edge_map
= malloc(mesh
->abedges
.count
*2 *sizeof(i32
));
701 for( int i
= 0; i
< mesh
->abedges
.count
*2; i
++ )
702 polygon_edge_map
[i
] = -1;
704 for( int i
= 0; i
< mesh
->abpolys
.count
; i
++ )
706 cxr_polygon
*poly
= &mesh
->polys
[i
];
708 for( int j
= 0; j
< poly
->loop_total
; j
++ )
710 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
713 for( int k
= 0; k
< 2; k
++ )
715 i32
*edge
= &polygon_edge_map
[loop
->edge_index
*2+k
];
724 /* Overflowed edge mapping... Duplicated faces. */
725 free( polygon_edge_map
);
731 for( int i
= 0; i
< mesh
->abpolys
.count
; i
++ )
733 cxr_polygon
*poly
= &mesh
->polys
[i
];
735 for( int j
= 0; j
< poly
->loop_total
; j
++ )
737 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
739 i32
*face_map
= &polygon_edge_map
[ loop
->edge_index
*2 ];
741 if( face_map
[0] == loop
->poly_left
) loop
->poly_right
= face_map
[1];
742 else loop
->poly_right
= face_map
[0];
747 for( int i
=0; i
<mesh
->abedges
.count
*2; i
++ )
749 if( polygon_edge_map
[i
] == -1 )
751 free( polygon_edge_map
);
756 free( polygon_edge_map
);
761 * Create new empty polygon with known loop count
762 * Must be filled and completed by the following functions!
764 static int cxr_create_poly( cxr_mesh
*mesh
, int loop_count
)
766 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
771 cxr_log( "tried to add new poly with length %d!\n", loop_count
);
776 cxr_ab_reserve( &mesh
->abpolys
, 1 );
777 cxr_ab_reserve( &mesh
->abloops
, loop_count
);
778 cxr_mesh_update( mesh
);
780 cxr_polygon
*poly
= &mesh
->polys
[ mesh
->abpolys
.count
];
782 poly
->loop_start
= mesh
->abloops
.count
;
783 poly
->loop_total
= 0;
784 poly
->material_id
= -1;
785 v3_zero( poly
->center
);
791 * Add one index to the polygon created by the above function
793 static void cxr_poly_push_index( cxr_mesh
*mesh
, int id
)
795 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
797 int nface_id
= mesh
->abpolys
.count
;
798 cxr_polygon
*poly
= &mesh
->polys
[ nface_id
];
800 cxr_loop
*new_loop
= &mesh
->loops
[ poly
->loop_start
+ poly
->loop_total
];
802 new_loop
->poly_left
= nface_id
;
803 new_loop
->poly_right
= -1;
804 new_loop
->index
= id
;
805 new_loop
->edge_index
= 0;
806 v2_zero(new_loop
->uv
);
808 v3_add( poly
->center
, verts
[new_loop
->index
], poly
->center
);
811 mesh
->abloops
.count
++;
815 * Finalize and commit polygon into mesh
817 static void cxr_poly_finish( cxr_mesh
*mesh
)
819 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
821 int nface_id
= mesh
->abpolys
.count
;
822 cxr_polygon
*poly
= &mesh
->polys
[nface_id
];
824 /* Average center and calc normal */
826 v3_divs( poly
->center
, poly
->loop_total
, poly
->center
);
827 cxr_loop
*lp0
= &mesh
->loops
[ poly
->loop_start
],
828 *lp1
= &mesh
->loops
[ poly
->loop_start
+1 ],
829 *lp2
= &mesh
->loops
[ poly
->loop_start
+2 ];
832 verts
[lp0
->index
], verts
[lp1
->index
], verts
[lp2
->index
], poly
->normal
);
834 mesh
->abpolys
.count
++;
838 * Extract the next island from mesh
840 * Returns NULL if mesh is one contigous object
842 static cxr_mesh
*cxr_pull_island( cxr_mesh
*mesh
)
844 cxr_mesh_link_loops(mesh
);
846 int *island_current
= malloc(mesh
->abpolys
.count
*sizeof(int)),
851 island_current
[0] = 0;
854 last_count
= island_len
;
856 for( int i
=0; i
<island_len
; i
++ )
858 cxr_polygon
*poly
= &mesh
->polys
[ island_current
[i
] ];
860 for( int j
=0; j
<poly
->loop_total
; j
++ )
862 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
864 if( loop
->poly_right
!= -1 )
866 int face_present
= 0;
868 for( int k
=0; k
<island_len
; k
++ )
870 if( island_current
[k
] == loop
->poly_right
)
878 island_current
[ island_len
++ ] = loop
->poly_right
;
883 if( island_len
> last_count
)
886 /* Check for complete object */
887 if( island_len
== mesh
->abpolys
.count
)
889 free( island_current
);
893 for( int i
=0; i
<island_len
; i
++ )
895 cxr_polygon
*poly
= &mesh
->polys
[ island_current
[i
] ];
896 loop_count
+= poly
->loop_total
;
899 /* Create and update meshes */
900 cxr_mesh
*newmesh
= cxr_alloc_mesh( mesh
->abedges
.count
,
905 for( int i
=0; i
<island_len
; i
++ )
907 cxr_polygon
*src
= &mesh
->polys
[ island_current
[i
] ];
908 cxr_polygon
*dst
= cxr_ab_ptr(&newmesh
->abpolys
, i
);
911 dst
->loop_start
= newmesh
->abloops
.count
;
913 for( int j
=0; j
<src
->loop_total
; j
++ )
916 *lsrc
= &mesh
->loops
[ src
->loop_start
+j
],
917 *ldst
= cxr_ab_ptr(&newmesh
->abloops
, dst
->loop_start
+j
);
921 ldst
->poly_right
= -1;
924 newmesh
->abloops
.count
+= src
->loop_total
;
925 src
->loop_total
= -1;
928 newmesh
->abpolys
.count
= island_len
;
929 newmesh
->abedges
.count
= mesh
->abedges
.count
;
930 memcpy( cxr_ab_ptr(&newmesh
->abedges
,0),
932 mesh
->abedges
.count
* sizeof(cxr_edge
));
934 cxr_mesh_clean_faces(mesh
);
935 cxr_mesh_clean_edges(mesh
);
936 cxr_mesh_clean_edges(newmesh
);
938 free( island_current
);
943 * Invalid solid is when there are vertices that are coplanar to a face, but are
944 * outside the polygons edges.
946 static int cxr_valid_solid( cxr_mesh
*mesh
, int *solid
, int len
)
948 v3f
*verts
= cxr_ab_ptr(mesh
->p_abverts
, 0);
950 for( int i
=0; i
<len
; i
++ )
952 cxr_polygon
*polyi
= &mesh
->polys
[ solid
[i
] ];
955 normal_to_plane(polyi
->normal
, polyi
->center
, plane
);
957 for( int j
=0; j
<len
; j
++ )
961 cxr_polygon
*polyj
= &mesh
->polys
[ solid
[j
] ];
963 for( int k
=0; k
<polyj
->loop_total
; k
++ )
965 cxr_loop
*lpj
= &mesh
->loops
[ polyj
->loop_start
+k
];
967 /* Test if the vertex is not referenced by the polygon */
968 for( int l
=0; l
<polyi
->loop_total
; l
++ )
970 cxr_loop
*lpi
= &mesh
->loops
[ polyi
->loop_start
+l
];
972 if( lpi
->index
== lpj
->index
)
976 if( fabs(plane_polarity(plane
, verts
[lpj
->index
])) < 0.001 )
988 * Use when iterating the loops array, to get a unique set of edges
989 * Better than using the edges array and doing many more checks
991 static int cxr_loop_unique_edge( cxr_loop
*lp
)
993 if( lp
->poly_left
> lp
->poly_right
)
1000 * Identify edges in the mesh where the two connected face's normals
1001 * are opposing eachother (or close to identical)
1003 static int *cxr_mesh_reflex_edges( cxr_mesh
*mesh
)
1005 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
1006 int *edge_tagged
= malloc( mesh
->abedges
.count
* sizeof(int) );
1008 for( int i
=0; i
<mesh
->abloops
.count
; i
++ )
1010 cxr_loop
*lp
= &mesh
->loops
[i
];
1011 if( !cxr_loop_unique_edge( lp
) ) continue;
1013 edge_tagged
[lp
->edge_index
] = 0;
1015 cxr_polygon
*polya
= &mesh
->polys
[ lp
->poly_left
],
1016 *polyb
= &mesh
->polys
[ lp
->poly_right
];
1019 normal_to_plane(polyb
->normal
, polyb
->center
, planeb
);
1021 for( int j
=0; j
<polya
->loop_total
; j
++ )
1023 cxr_loop
*lp1
= &mesh
->loops
[ polya
->loop_start
+j
];
1025 if(( plane_polarity( planeb
, verts
[lp1
->index
] ) > 0.001 ) ||
1026 ( v3_dot(polya
->normal
,polyb
->normal
) > CXR_PLANE_SIMILARITY_MAX
))
1028 edge_tagged
[lp
->edge_index
] = 1;
1038 * Same logic as above function except it will apply it to each vertex
1040 static int *cxr_mesh_reflex_vertices( cxr_mesh
*mesh
)
1042 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
1044 int *vertex_tagged
= malloc( mesh
->p_abverts
->count
*sizeof(int) );
1045 int *connected_planes
= malloc( mesh
->abpolys
.count
*sizeof(int) );
1047 for( int i
=0; i
<mesh
->p_abverts
->count
; i
++ )
1050 int num_connected
= 0;
1052 /* Create a list of polygons that refer to this vertex */
1053 for( int j
=0; j
<mesh
->abpolys
.count
; j
++ )
1055 cxr_polygon
*poly
= &mesh
->polys
[j
];
1056 for( int k
=0; k
<poly
->loop_total
; k
++ )
1058 cxr_loop
*loop
= &mesh
->loops
[poly
->loop_start
+k
];
1059 if( loop
->index
== i
)
1061 connected_planes
[num_connected
++] = j
;
1067 /* Check all combinations for a similar normal */
1068 for( int j
=0; j
<num_connected
-1; j
++ )
1070 for( int k
=j
+1; k
<num_connected
; k
++ )
1072 cxr_polygon
*polyj
= &mesh
->polys
[connected_planes
[j
]],
1073 *polyk
= &mesh
->polys
[connected_planes
[k
]];
1075 if( v3_dot(polyj
->normal
,polyk
->normal
) > CXR_PLANE_SIMILARITY_MAX
)
1081 * Check if all connected planes either:
1083 * - Coplanar with it
1085 for( int j
=0; j
<num_connected
; j
++ )
1087 for( int k
=j
+1; k
<num_connected
; k
++ )
1089 cxr_polygon
*jpoly
= &mesh
->polys
[ connected_planes
[j
] ],
1090 *kpoly
= &mesh
->polys
[ connected_planes
[k
] ];
1093 normal_to_plane( kpoly
->normal
, kpoly
->center
, plane
);
1094 for( int l
=0; l
<jpoly
->loop_total
; l
++ )
1096 cxr_loop
*lp
= &mesh
->loops
[ jpoly
->loop_start
+l
];
1098 if( plane_polarity( plane
, verts
[lp
->index
] ) > 0.001 )
1106 vertex_tagged
[i
] = 1;
1109 free( connected_planes
);
1110 return vertex_tagged
;
1114 * Detect if potential future edges create a collision with any of the
1115 * existing edges in the mesh
1117 static int cxr_solid_overlap( cxr_mesh
*mesh
,
1120 int common_edge_index
1122 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
1123 cxr_edge
*common_edge
= &mesh
->edges
[common_edge_index
];
1125 int unique_a
= pa
->loop_total
-2,
1126 unique_b
= pb
->loop_total
-2;
1128 int *unique_verts
= malloc( (unique_a
+unique_b
)*sizeof(int) );
1129 int unique_total
= 0;
1131 for( int j
=0; j
<2; j
++ )
1133 cxr_polygon
*poly
= (cxr_polygon
*[2]){pa
,pb
}[j
];
1135 for( int i
=0; i
<poly
->loop_total
; i
++ )
1137 cxr_loop
*lp
= &mesh
->loops
[poly
->loop_start
+i
];
1139 if( lp
->index
== common_edge
->i0
|| lp
->index
== common_edge
->i1
)
1142 unique_verts
[ unique_total
++ ] = lp
->index
;
1148 for( int i
=0; i
<unique_a
; i
++ )
1150 for( int j
=unique_a
; j
<unique_total
; j
++ )
1152 int i0
= unique_verts
[i
],
1153 i1
= unique_verts
[j
];
1155 for( int k
=0; k
<mesh
->abedges
.count
; k
++ )
1157 cxr_edge
*edge
= &mesh
->edges
[k
];
1159 if( edge
->i0
== i0
|| edge
->i0
== i1
||
1160 edge
->i1
== i0
|| edge
->i1
== i1
) continue;
1162 double *a0
= verts
[i0
],
1164 *b0
= verts
[edge
->i0
],
1165 *b1
= verts
[edge
->i1
];
1167 double dist
= segment_segment_dist( a0
, a1
, b0
, b1
, ca
, cb
);
1171 free( unique_verts
);
1178 free( unique_verts
);
1183 * Creates the 'maximal' solid that originates from this faceid
1185 * Returns the number of faces used
1187 static int cxr_buildsolid(
1194 faces_tagged
[faceid
] = faceid
;
1197 solid
[solid_len
++] = faceid
;
1199 int search_start
= 0;
1204 for( int j
=search_start
; j
<solid_len
; j
++ )
1206 cxr_polygon
*poly
= &mesh
->polys
[ solid
[j
] ];
1208 for( int k
=0; k
<poly
->loop_total
; k
++ )
1210 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+k
];
1211 cxr_edge
*edge
= &mesh
->edges
[ loop
->edge_index
];
1213 if( faces_tagged
[ loop
->poly_right
] == -1 )
1215 if( !reflex_edges
[loop
->edge_index
] )
1217 /* Check for dodgy edges */
1218 cxr_polygon
*newpoly
= &mesh
->polys
[loop
->poly_right
];
1220 if( cxr_solid_overlap(mesh
,poly
,newpoly
,loop
->edge_index
))
1223 /* Looking ahead by one step gives us an early out for invalid
1224 * configurations. This might just all be handled by the new
1225 * edge overlap detector, though.
1227 for( int l
=0; l
< newpoly
->loop_total
; l
++ )
1229 cxr_loop
*lp1
= &mesh
->loops
[ newpoly
->loop_start
+l
];
1230 cxr_polygon
*future_face
= &mesh
->polys
[ lp1
->poly_right
];
1232 if( reflex_edges
[ lp1
->edge_index
]
1233 || lp1
->poly_right
== loop
->poly_right
)
1236 for( int m
=0; m
<solid_len
; m
++ )
1237 if( solid
[m
] == lp1
->poly_right
)
1240 for( int m
=0; m
<solid_len
; m
++ )
1242 cxr_polygon
*polym
= &mesh
->polys
[solid
[m
]];
1243 double pdist
= v3_dot( polym
->normal
,future_face
->normal
);
1245 if( pdist
> CXR_PLANE_SIMILARITY_MAX
)
1252 /* Check for vertices in the new polygon that exist on a current
1253 * plane. This condition is invalid */
1254 solid
[ solid_len
] = loop
->poly_right
;
1256 if( cxr_valid_solid(mesh
,solid
,solid_len
+1 ) )
1258 faces_tagged
[ loop
->poly_right
] = faceid
;
1268 search_start
= solid_len
;
1270 goto search_iterate
;
1277 int start
, count
, edge_count
;
1281 struct temp_manifold
1283 struct manifold_loop
1293 enum manifold_status
1297 k_manifold_fragmented
,
1298 k_manifold_complete
,
1304 * Create polygon from entire manifold structure.
1306 * Must be completely co-planar
1308 static void cxr_create_poly_full( cxr_mesh
*mesh
, struct temp_manifold
*src
)
1310 if( cxr_create_poly( mesh
, src
->loop_count
) )
1312 for( int l
=0; l
<src
->loop_count
; l
++ )
1313 cxr_poly_push_index( mesh
, src
->loops
[ l
].loop
.index
);
1315 cxr_poly_finish( mesh
);
1320 * Links up all edges into a potential new manifold
1322 * The return status can be:
1323 * (err): Critical programming error
1324 * none: No manifold to create
1325 * fragmented: Multiple sections exist, not just one
1326 * complete: Optimial manifold was created
1328 static void cxr_link_manifold(
1330 struct csolid
*solid
,
1332 struct temp_manifold
*manifold
1334 cxr_loop
**edge_list
= malloc( sizeof(*edge_list
) * solid
->edge_count
);
1335 int *temp_solid
= malloc( solid
->count
*sizeof(int) );
1336 int temp_solid_len
= 0;
1338 int init_reverse
= 0;
1339 int unique_edge_count
= 0;
1341 /* Try remove splitting faces first */
1343 int split_total
= 0;
1344 for( int j
=0; j
<solid
->count
; j
++ )
1346 cxr_polygon
*poly
= &mesh
->polys
[ solid_buffer
[solid
->start
+j
] ];
1347 int interior_count
= 0;
1349 for( int k
=0; k
<poly
->loop_total
; k
++ )
1351 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+k
];
1353 for( int l
=0; l
<solid
->count
; l
++ )
1354 if( loop
->poly_right
== solid_buffer
[solid
->start
+l
] )
1363 if( interior_count
< poly
->loop_total
-1 )
1369 temp_solid
[ temp_solid_len
++ ] = solid_buffer
[solid
->start
+j
];
1372 if( temp_solid_len
< 3 || (split_total
& 0x2) /* unkown reasons */ )
1377 /* Overwrite original solid */
1378 for( int j
=0; j
<temp_solid_len
; j
++ )
1379 solid_buffer
[ solid
->start
+j
] = temp_solid
[ j
];
1381 solid
->count
= temp_solid_len
;
1387 for( int j
=0; j
<solid
->count
; j
++ )
1389 cxr_polygon
*poly
= &mesh
->polys
[ solid_buffer
[solid
->start
+j
] ];
1391 /* when discarding, if a face has only one loop that points outwards,
1395 for( int k
=0; k
<poly
->loop_total
; k
++ )
1397 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+k
];
1399 for( int l
=0; l
<unique_edge_count
; l
++ )
1400 if( edge_list
[l
]->edge_index
== loop
->edge_index
)
1403 for( int l
=0; l
<solid
->count
; l
++ )
1404 if( loop
->poly_right
== solid_buffer
[solid
->start
+l
] )
1407 edge_list
[ unique_edge_count
] = loop
;
1409 if( unique_edge_count
== 0 )
1411 cxr_edge
*edgeptr
= &mesh
->edges
[ loop
->edge_index
];
1412 if( edgeptr
->i1
== loop
->index
)
1416 unique_edge_count
++;
1421 if( unique_edge_count
== 0 )
1424 manifold
->status
= k_manifold_none
;
1428 /* Link edges together to form manifold */
1429 manifold
->loops
= malloc( solid
->edge_count
*sizeof(struct manifold_loop
));
1430 manifold
->split_count
= 0;
1431 manifold
->loop_count
= 0;
1433 cxr_edge
*current
= &mesh
->edges
[ edge_list
[0]->edge_index
];
1435 int endpt
= (!init_reverse
)? current
->i0
: current
->i1
,
1437 curface
= edge_list
[0]->poly_left
;
1440 for( int j
=0; j
<unique_edge_count
; j
++ )
1442 cxr_edge
*other
= &mesh
->edges
[ edge_list
[j
]->edge_index
];
1443 if( other
== current
)
1446 if( other
->i0
== endpt
|| other
->i1
== endpt
)
1451 if( other
->i0
== endpt
) endpt
= current
->i1
;
1452 else endpt
= current
->i0
;
1454 struct manifold_loop
*ml
= &manifold
->loops
[ manifold
->loop_count
++ ];
1456 if( curface
==edge_list
[j
]->poly_left
)
1459 manifold
->split_count
++;
1464 ml
->loop
.edge_index
= edge_list
[j
]->edge_index
;
1465 ml
->loop
.poly_left
= edge_list
[j
]->poly_left
;
1466 ml
->loop
.index
= lastpt
;
1467 ml
->loop
.poly_right
= edge_list
[j
]->poly_right
;
1469 curface
= edge_list
[j
]->poly_left
;
1473 if( manifold
->loop_count
< unique_edge_count
)
1474 manifold
->status
= k_manifold_fragmented
;
1476 manifold
->status
= k_manifold_complete
;
1478 goto manifold_complete
;
1481 goto manifold_continue
;
1485 /* Incomplete links */
1486 manifold
->status
= k_manifold_err
;
1495 * Reconstruct implied internal geometry where the manifold doesn't have
1496 * enough information (vertices) to create a full result.
1498 static int cxr_build_implicit_geo( cxr_mesh
*mesh
, int new_polys
, int start
)
1500 for( int i
=0; i
<new_polys
-2; i
++ )
1502 for( int j
=i
+1; j
<new_polys
-1; j
++ )
1504 for( int k
=j
+1; k
<new_polys
; k
++ )
1506 cxr_polygon
*ptri
= &mesh
->polys
[ start
+i
],
1507 *ptrj
= &mesh
->polys
[ start
+j
],
1508 *ptrk
= &mesh
->polys
[ start
+k
];
1510 v4f planei
, planej
, planek
;
1511 normal_to_plane(ptri
->normal
,ptri
->center
,planei
);
1512 normal_to_plane(ptrj
->normal
,ptrj
->center
,planej
);
1513 normal_to_plane(ptrk
->normal
,ptrk
->center
,planek
);
1517 if( plane_intersect(planei
,planej
,planek
,intersect
) )
1519 /* Make sure the point is inside the convex region */
1521 int point_valid
= 1;
1522 for( int l
=0; l
<mesh
->abpolys
.count
; l
++ )
1524 cxr_polygon
*ptrl
= &mesh
->polys
[l
];
1527 normal_to_plane(ptrl
->normal
, ptrl
->center
, planel
);
1529 if( plane_polarity( planel
, intersect
) > 0.01 )
1532 cxr_log( "degen vert, planes %d, %d, %d [max:%d]\n",
1535 cxr_debug_poly( mesh
, ptri
, colours_random
[3] );
1536 cxr_debug_poly( mesh
, ptrj
, colours_random
[1] );
1537 cxr_debug_poly( mesh
, ptrk
, colours_random
[2] );
1544 /* Extend faces to include this vert */
1546 int nvertid
= mesh
->p_abverts
->count
;
1547 cxr_ab_push( mesh
->p_abverts
, intersect
);
1549 ptrj
->loop_start
+= 1;
1550 ptrk
->loop_start
+= 2;
1552 cxr_ab_reserve( &mesh
->abloops
, 3);
1554 int newi
= ptri
->loop_start
+ptri
->loop_total
,
1555 newj
= ptrj
->loop_start
+ptrj
->loop_total
,
1556 newk
= ptrk
->loop_start
+ptrk
->loop_total
;
1559 *lloopi
= cxr_ab_empty_at(&mesh
->abloops
, newi
),
1560 *lloopj
= cxr_ab_empty_at(&mesh
->abloops
, newj
),
1561 *lloopk
= cxr_ab_empty_at(&mesh
->abloops
, newk
);
1563 lloopi
->index
= nvertid
;
1564 lloopi
->edge_index
= 0;
1565 lloopi
->poly_left
= start
+ i
;
1566 lloopi
->poly_right
= -1;
1568 lloopj
->index
= nvertid
;
1569 lloopj
->poly_left
= start
+ j
;
1570 lloopj
->edge_index
= 0;
1571 lloopj
->poly_right
= -1;
1573 lloopk
->index
= nvertid
;
1574 lloopk
->edge_index
= 0;
1575 lloopk
->poly_left
= start
+ k
;
1576 lloopk
->poly_right
= -1;
1578 v2_zero(lloopi
->uv
);
1579 v2_zero(lloopj
->uv
);
1580 v2_zero(lloopk
->uv
);
1582 ptri
->loop_total
++;
1583 ptrj
->loop_total
++;
1584 ptrk
->loop_total
++;
1586 double qi
= 1.0/(double)ptri
->loop_total
,
1587 qj
= 1.0/(double)ptrj
->loop_total
,
1588 qk
= 1.0/(double)ptrk
->loop_total
;
1590 /* Adjust centers of faces */
1591 v3_lerp( ptri
->center
, intersect
, qi
, ptri
->center
);
1592 v3_lerp( ptrj
->center
, intersect
, qj
, ptrj
->center
);
1593 v3_lerp( ptrk
->center
, intersect
, qk
, ptrk
->center
);
1602 static int cxr_reflex_err( cxr_mesh
*mesh
)
1605 int *reflex_check
= cxr_mesh_reflex_edges( mesh
);
1607 v3f
*temp
= cxr_ab_ptr(mesh
->p_abverts
, 0);
1609 for( int i
=0; i
<mesh
->abedges
.count
; i
++ )
1611 if( reflex_check
[i
] )
1613 cxr_debug_line( temp
[mesh
->edges
[i
].i0
],
1614 temp
[mesh
->edges
[i
].i1
],
1620 free( reflex_check
);
1624 static int cxr_non_manifold_err( cxr_mesh
*mesh
)
1626 if( !cxr_mesh_link_loops(mesh
) )
1629 cxr_log( "non-manifold edges are in the mesh: "
1630 "implicit internal geometry does not have full support\n" );
1632 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
1634 for( int i
=0; i
<mesh
->abloops
.count
; i
++ )
1636 cxr_loop
*lp
= &mesh
->loops
[i
];
1637 cxr_edge
*edge
= &mesh
->edges
[lp
->edge_index
];
1638 cxr_debug_line( verts
[edge
->i0
], verts
[edge
->i1
], colours_random
[1] );
1640 if( lp
->poly_left
== -1 || lp
->poly_right
== -1 )
1642 cxr_debug_line( verts
[edge
->i0
], verts
[edge
->i1
], colour_error
);
1653 * Convexer's main algorithm
1655 * Return the best availible convex solid from mesh, and patch the existing mesh
1656 * to fill the gap where the new mesh left it.
1658 * Returns NULL if shape is already convex or empty.
1659 * This function will not preserve edge data such as freestyle, sharp etc.
1661 static cxr_mesh
*cxr_pull_best_solid(
1663 int preserve_more_edges
,
1664 enum cxr_soliderr
*err
)
1666 *err
= k_soliderr_none
;
1668 if( cxr_non_manifold_err( mesh
) )
1670 *err
= k_soliderr_non_manifold
;
1674 int *edge_tagged
= cxr_mesh_reflex_edges( mesh
);
1675 int *vertex_tagged
= cxr_mesh_reflex_vertices( mesh
);
1678 * Connect all marked vertices that share an edge
1681 int *edge_important
= malloc(mesh
->abedges
.count
*sizeof(int));
1682 for( int i
=0; i
< mesh
->abedges
.count
; i
++ )
1683 edge_important
[i
] = 0;
1685 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
1687 cxr_polygon
*poly
= &mesh
->polys
[i
];
1688 int not_tagged
= -1,
1691 for( int j
=0; j
<poly
->loop_total
; j
++ )
1693 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
1695 if( !edge_tagged
[ loop
->edge_index
] )
1697 if( not_tagged
== -1 )
1698 not_tagged
= loop
->edge_index
;
1700 goto edge_unimportant
;
1704 if( not_tagged
!= -1 )
1705 edge_important
[not_tagged
]=1;
1711 * Connect edges where both vertices are reflex, only if we are not
1714 for( int i
=0; i
<mesh
->abedges
.count
; i
++ )
1716 if( edge_important
[i
] && preserve_more_edges
) continue;
1718 cxr_edge
*edge
= &mesh
->edges
[i
];
1719 if( vertex_tagged
[edge
->i0
] && vertex_tagged
[edge
->i1
] )
1723 free( edge_important
);
1725 int *faces_tagged
= malloc(mesh
->abpolys
.count
*sizeof(int));
1726 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
1727 faces_tagged
[i
] = -1;
1729 struct csolid
*candidates
;
1730 int *solid_buffer
= malloc( mesh
->abpolys
.count
*sizeof(int) ),
1731 solid_buffer_len
= 0,
1732 candidate_count
= 0;
1734 candidates
= malloc( mesh
->abpolys
.count
*sizeof(struct csolid
) );
1737 * Create a valid, non-overlapping solid for every face present in the mesh
1739 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
1741 if( faces_tagged
[i
] != -1 ) continue;
1742 faces_tagged
[i
] = i
;
1744 int *solid
= &solid_buffer
[ solid_buffer_len
];
1745 int len
= cxr_buildsolid( mesh
, i
, solid
, edge_tagged
, faces_tagged
);
1748 struct csolid
*csolid
= &candidates
[candidate_count
++];
1749 csolid
->start
= solid_buffer_len
;
1750 csolid
->count
= len
;
1751 csolid
->edge_count
= 0;
1753 v3_zero( csolid
->center
);
1754 for( int j
=0; j
<len
; j
++ )
1756 cxr_polygon
*polyj
= &mesh
->polys
[ solid
[j
] ];
1757 v3_add( polyj
->center
, csolid
->center
, csolid
->center
);
1758 csolid
->edge_count
+= polyj
->loop_total
;
1760 v3_divs( csolid
->center
, len
, csolid
->center
);
1761 solid_buffer_len
+= len
;
1764 free( edge_tagged
);
1765 free( vertex_tagged
);
1766 free( faces_tagged
);
1769 * Choosing the best solid: most defined manifold
1771 struct csolid
*best_solid
= NULL
;
1772 int fewest_manifold_splits
= INT32_MAX
;
1774 struct temp_manifold best_manifold
= { .loops
= NULL
, .loop_count
= 0 };
1775 int max_solid_faces
= 0;
1777 for( int i
=0; i
<candidate_count
; i
++ )
1779 struct csolid
*solid
= &candidates
[i
];
1780 max_solid_faces
= cxr_max(max_solid_faces
,solid
->count
);
1782 if( solid
->count
<= 2 )
1785 struct temp_manifold manifold
;
1786 cxr_link_manifold( mesh
, solid
, solid_buffer
, &manifold
);
1788 if( manifold
.status
== k_manifold_err
)
1790 *err
= k_soliderr_bad_manifold
;
1794 free(manifold
.loops
);
1795 free(best_manifold
.loops
);
1799 if( manifold
.status
== k_manifold_complete
)
1801 if( manifold
.split_count
< fewest_manifold_splits
)
1803 fewest_manifold_splits
= manifold
.split_count
;
1806 free( best_manifold
.loops
);
1807 best_manifold
= manifold
;
1812 if( manifold
.status
!= k_manifold_none
)
1813 free( manifold
.loops
);
1816 if( max_solid_faces
< 2 )
1818 *err
= k_soliderr_no_solids
;
1821 free(best_manifold
.loops
);
1825 if( best_solid
!= NULL
)
1827 cxr_mesh
*pullmesh
= cxr_alloc_mesh( best_solid
->edge_count
,
1828 best_solid
->edge_count
,
1832 for( int i
=0; i
<best_solid
->count
; i
++ )
1834 int nface_id
= pullmesh
->abpolys
.count
;
1835 int exist_plane_id
= solid_buffer
[best_solid
->start
+i
];
1837 cxr_polygon
*exist_face
= &mesh
->polys
[ exist_plane_id
],
1838 *new_face
= cxr_ab_empty( &pullmesh
->abpolys
);
1840 *new_face
= *exist_face
;
1841 new_face
->loop_start
= pullmesh
->abloops
.count
;
1843 for( int j
=0; j
<exist_face
->loop_total
; j
++ )
1845 cxr_loop
*exist_loop
= &mesh
->loops
[ exist_face
->loop_start
+j
],
1846 *new_loop
= cxr_ab_empty(&pullmesh
->abloops
);
1848 new_loop
->index
= exist_loop
->index
;
1849 new_loop
->poly_left
= nface_id
;
1850 new_loop
->poly_right
= -1;
1851 new_loop
->edge_index
= 0;
1852 v2_copy( exist_loop
->uv
, new_loop
->uv
);
1855 exist_face
->loop_total
= -1;
1859 int pullmesh_new_start
= pullmesh
->abpolys
.count
;
1861 if( fewest_manifold_splits
!= 0 )
1863 /* Unusual observation:
1864 * If the split count is odd, the manifold can be created easily
1866 * If it is even, implicit internal geometry is needed to be
1867 * constructed. So the manifold gets folded as we create it segment
1870 * I'm not sure if this is a well defined rule of geometry, but seems
1871 * to apply to the data we care about.
1873 int collapse_used_segments
= (u32
)fewest_manifold_splits
& 0x1? 0: 1;
1877 for( int j
=0; j
< best_manifold
.loop_count
; j
++ )
1879 if( !best_manifold
.loops
[j
].split
) continue;
1881 cxr_loop
*loop
= &best_manifold
.loops
[j
].loop
;
1883 for( int k
=1; k
< best_manifold
.loop_count
; k
++ )
1885 int index1
= cxr_range(j
+k
, best_manifold
.loop_count
);
1886 cxr_loop
*loop1
= &best_manifold
.loops
[index1
].loop
;
1888 if( best_manifold
.loops
[index1
].split
)
1895 if( new_polys
> best_manifold
.loop_count
)
1898 cxr_log( "Programming error: Too many new polys!\n" );
1903 if( cxr_create_poly( pullmesh
, k
+1 ) )
1905 for( int l
=0; l
<k
+1; l
++ )
1907 int i0
= cxr_range(j
+l
, best_manifold
.loop_count
),
1908 index
= best_manifold
.loops
[ i0
].loop
.index
;
1910 cxr_poly_push_index( pullmesh
, index
);
1912 cxr_poly_finish( pullmesh
);
1915 /* Collapse down manifold */
1916 if( collapse_used_segments
)
1918 best_manifold
.loops
[j
].split
= 0;
1919 best_manifold
.loops
[index1
].split
= 0;
1921 int new_length
= (best_manifold
.loop_count
-(k
-1));
1923 struct temp_manifold new_manifold
= {
1924 .loop_count
= new_length
1926 new_manifold
.loops
=
1927 malloc( new_length
*sizeof(*new_manifold
.loops
) );
1929 for( int l
=0; l
<new_length
; l
++ )
1931 int i_src
= cxr_range( j
+k
+l
, best_manifold
.loop_count
);
1932 new_manifold
.loops
[l
] = best_manifold
.loops
[i_src
];
1935 free( best_manifold
.loops
);
1936 best_manifold
= new_manifold
;
1938 goto manifold_repeat
;
1947 if( best_manifold
.loop_count
&& collapse_used_segments
)
1949 cxr_create_poly_full( pullmesh
, &best_manifold
);
1955 cxr_create_poly_full( pullmesh
, &best_manifold
);
1959 if( new_polys
>= 3 )
1961 if( !cxr_build_implicit_geo( pullmesh
, new_polys
, pullmesh_new_start
))
1965 free(best_manifold
.loops
);
1967 cxr_free_mesh( pullmesh
);
1968 *err
= k_soliderr_degenerate_implicit
;
1974 * Copy faces from the pullmesh into original, to patch up where there
1975 * would be gaps created
1977 for( int i
=0; i
<new_polys
; i
++ )
1979 int rface_id
= mesh
->abpolys
.count
;
1980 cxr_polygon
*pface
= &pullmesh
->polys
[pullmesh_new_start
+i
],
1981 *rip_face
= cxr_ab_empty(&mesh
->abpolys
);
1983 rip_face
->loop_start
= mesh
->abloops
.count
;
1984 rip_face
->loop_total
= pface
->loop_total
;
1985 rip_face
->material_id
= -1;
1987 for( int j
=0; j
<rip_face
->loop_total
; j
++ )
1990 &pullmesh
->loops
[ pface
->loop_start
+pface
->loop_total
-j
-1 ],
1991 *rloop
= cxr_ab_empty(&mesh
->abloops
);
1993 rloop
->index
= ploop
->index
;
1994 rloop
->poly_left
= rface_id
;
1995 rloop
->poly_right
= -1;
1996 rloop
->edge_index
= 0;
1997 v2_copy( ploop
->uv
, rloop
->uv
);
2000 v3_copy( pface
->center
, rip_face
->center
);
2001 v3_negate( pface
->normal
, rip_face
->normal
);
2004 cxr_mesh_update( mesh
);
2005 cxr_mesh_update( pullmesh
);
2007 cxr_mesh_clean_faces( mesh
);
2008 cxr_mesh_clean_edges( mesh
);
2009 cxr_mesh_clean_faces( pullmesh
);
2010 cxr_mesh_clean_edges( pullmesh
);
2014 free(best_manifold
.loops
);
2017 * Do final checks on the mesh to make sure we diddn't introduce any
2020 if( cxr_non_manifold_err( pullmesh
) || cxr_reflex_err( pullmesh
) )
2022 *err
= k_soliderr_bad_result
;
2031 free(best_manifold
.loops
);
2033 if( cxr_non_manifold_err( mesh
) || cxr_reflex_err( mesh
) )
2034 *err
= k_soliderr_bad_result
;
2040 * Convert from the format we recieve from blender into our internal format
2041 * with auto buffers.
2043 static cxr_mesh
*cxr_to_internal_format(
2044 cxr_static_mesh
*src
,
2045 cxr_abuffer
*abverts
2047 cxr_mesh
*mesh
= cxr_alloc_mesh( src
->edge_count
, src
->loop_count
,
2048 src
->poly_count
, abverts
);
2050 cxr_ab_init( abverts
, sizeof(v3f
), src
->vertex_count
);
2052 memcpy( mesh
->abedges
.arr
, src
->edges
, src
->edge_count
*sizeof(cxr_edge
));
2053 memcpy( mesh
->abpolys
.arr
, src
->polys
, src
->poly_count
*sizeof(cxr_polygon
));
2054 memcpy( abverts
->arr
, src
->vertices
, src
->vertex_count
*sizeof(v3f
));
2055 mesh
->abedges
.count
= src
->edge_count
;
2056 mesh
->abloops
.count
= src
->loop_count
;
2057 mesh
->abpolys
.count
= src
->poly_count
;
2059 cxr_mesh_update( mesh
);
2061 for( int i
=0; i
<src
->loop_count
; i
++ )
2063 cxr_loop
*lp
= &mesh
->loops
[i
];
2065 lp
->index
= src
->loops
[i
].index
;
2066 lp
->edge_index
= src
->loops
[i
].edge_index
;
2067 v2_copy( src
->loops
[i
].uv
, lp
->uv
);
2070 abverts
->count
= src
->vertex_count
;
2074 static int cxr_poly_convex( cxr_mesh
*mesh
, cxr_polygon
*poly
)
2076 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
2078 for( int i
=0; i
<poly
->loop_total
; i
++ )
2080 int li0
= poly
->loop_start
+ i
,
2081 li1
= poly
->loop_start
+ cxr_range( i
+1, poly
->loop_total
),
2082 li2
= poly
->loop_start
+ cxr_range( i
+2, poly
->loop_total
);
2083 int i0
= mesh
->loops
[li0
].index
,
2084 i1
= mesh
->loops
[li1
].index
,
2085 i2
= mesh
->loops
[li2
].index
;
2089 v3_sub( verts
[i1
], verts
[i0
], v0
);
2090 v3_sub( verts
[i2
], verts
[i1
], v1
);
2092 v3_cross( v0
, v1
, c
);
2093 if( v3_dot( c
, poly
->normal
) <= 0.0 )
2096 cxr_debug_line( verts
[i0
], verts
[i1
], colour_error
);
2097 cxr_debug_box( verts
[i1
], 0.1, colour_error
);
2098 cxr_debug_line( verts
[i1
], verts
[i2
], colour_error
);
2099 cxr_debug_line( verts
[i1
], poly
->center
, colour_error
);
2108 static int cxr_solid_checkerr( cxr_mesh
*mesh
)
2110 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
2113 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
2117 cxr_polygon
*poly
= &mesh
->polys
[i
];
2120 normal_to_plane( poly
->normal
, poly
->center
, plane
);
2122 for( int j
=0; j
<poly
->loop_total
; j
++ )
2124 cxr_loop
*loop
= &mesh
->loops
[ poly
->loop_start
+j
];
2125 double *vert
= verts
[ loop
->index
];
2127 if( fabs(plane_polarity(plane
,vert
)) > 0.0025 )
2133 plane_project_point( plane
, vert
, ref
);
2136 cxr_debug_line( ref
, vert
, colour_error
);
2137 cxr_debug_box( vert
, 0.1, colour_error
);
2144 cxr_debug_poly( mesh
, poly
, colour_error
);
2151 CXR_API
void cxr_free_world( cxr_world
*world
)
2153 for( int i
=0; i
<world
->absolids
.count
; i
++ )
2155 cxr_solid
*solid
= cxr_ab_ptr( &world
->absolids
, i
);
2156 cxr_free_mesh( solid
->pmesh
);
2159 cxr_ab_free( &world
->abverts
);
2160 cxr_ab_free( &world
->absolids
);
2162 if( world
->materials
)
2164 for( int i
=0; i
<world
->material_count
; i
++ )
2165 free( world
->materials
[i
].name
);
2167 free( world
->materials
);
2172 CXR_API cxr_tri_mesh
*cxr_world_preview( cxr_world
*world
)
2174 cxr_tri_mesh
*out
= malloc( sizeof(cxr_tri_mesh
) );
2175 out
->vertex_count
= 0;
2176 out
->indices_count
= 0;
2178 for( int i
=0; i
<world
->absolids
.count
; i
++ )
2180 cxr_solid
*solid
= cxr_ab_ptr( &world
->absolids
, i
);
2181 cxr_mesh
*mesh
= solid
->pmesh
;
2183 for( int j
=0; j
<mesh
->abpolys
.count
; j
++ )
2185 cxr_polygon
*poly
= &mesh
->polys
[j
];
2187 out
->vertex_count
+= poly
->loop_total
* 3; /* Polygon, edge strip */
2188 out
->indices_count
+= (poly
->loop_total
-2) * 3; /* Polygon */
2189 out
->indices_count
+= poly
->loop_total
* 2 * 3; /* Edge strip */
2193 out
->colours
= malloc( sizeof(v4f
)*out
->vertex_count
);
2194 out
->vertices
= malloc( sizeof(v3f
)*out
->vertex_count
);
2195 out
->indices
= malloc( sizeof(i32
)*out
->indices_count
);
2197 v3f
*overts
= out
->vertices
;
2198 v4f
*colours
= out
->colours
;
2199 i32
*indices
= out
->indices
;
2204 for( int i
=0; i
<world
->absolids
.count
; i
++ )
2206 cxr_solid
*solid
= cxr_ab_ptr( &world
->absolids
, i
);
2207 cxr_mesh
*mesh
= solid
->pmesh
;
2209 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
2212 colour_random_brush( i
, colour
);
2214 for( int j
=0; j
<mesh
->abpolys
.count
; j
++ )
2216 cxr_polygon
*poly
= &mesh
->polys
[j
];
2220 for( int k
=0; k
<poly
->loop_total
-2; k
++ )
2226 indices
[ ii
++ ] = istart
+i0
;
2227 indices
[ ii
++ ] = istart
+i1
;
2228 indices
[ ii
++ ] = istart
+i2
;
2231 for( int k
=0; k
<poly
->loop_total
; k
++ )
2233 cxr_loop
*lp
= &mesh
->loops
[poly
->loop_start
+k
];
2236 i1r
= cxr_range(k
+1,poly
->loop_total
)*3+1,
2238 i1i
= cxr_range(k
+1,poly
->loop_total
)*3+2;
2240 indices
[ ii
++ ] = istart
+i0i
;
2241 indices
[ ii
++ ] = istart
+i1i
;
2242 indices
[ ii
++ ] = istart
+i1r
;
2244 indices
[ ii
++ ] = istart
+i0i
;
2245 indices
[ ii
++ ] = istart
+i1r
;
2246 indices
[ ii
++ ] = istart
+i0r
;
2249 v3_muladds( verts
[lp
->index
], poly
->normal
, 0.02, overts
[vi
] );
2250 v4_copy( colour
, colours
[ vi
] );
2255 v3_lerp( verts
[lp
->index
], poly
->center
, 0.2, inner
);
2256 v3_muladds( inner
, poly
->normal
, 0.015, overts
[ vi
] );
2257 v4_copy( colour
, colours
[ vi
] );
2258 v4_copy( (v4f
){ 0.0, 0.0, 0.0, 0.0 }, colours
[vi
] );
2261 v3_muladds(verts
[lp
->index
], poly
->normal
, 0.0, overts
[ vi
] );
2262 v4_copy( colour
, colours
[ vi
] );
2263 v4_copy( (v4f
){ 1.0, 1.0, 1.0, 0.125 }, colours
[vi
] );
2272 CXR_API
void cxr_free_tri_mesh( cxr_tri_mesh
*mesh
)
2274 free( mesh
->colours
);
2275 free( mesh
->indices
);
2276 free( mesh
->vertices
);
2280 CXR_API cxr_world
*cxr_decompose( cxr_static_mesh
*src
, i32
*perrcode
)
2282 /* Make sure data is in the mesh and isn't empty */
2283 if( !src
->edge_count
|| !src
->loop_count
|| !src
->poly_count
)
2285 cxr_log( "Error %d\n", k_soliderr_invalid_input
);
2287 *perrcode
= k_soliderr_invalid_input
;
2293 cxr_world
*world
= malloc( sizeof(*world
) );
2295 /* Copy data to internal formats */
2296 cxr_mesh
*main_mesh
= cxr_to_internal_format( src
, &world
->abverts
);
2297 cxr_ab_init( &world
->absolids
, sizeof(cxr_solid
), 2 );
2299 if( src
->material_count
)
2301 size_t dsize
= sizeof(cxr_material
) * src
->material_count
;
2302 world
->materials
= malloc( dsize
);
2303 memcpy( world
->materials
, src
->materials
, dsize
);
2305 for( int i
=0; i
<src
->material_count
; i
++ )
2307 world
->materials
[i
].name
= malloc(strlen(src
->materials
[i
].name
) +1);
2308 strcpy( world
->materials
[i
].name
, src
->materials
[i
].name
);
2310 world
->material_count
= src
->material_count
;
2312 else world
->materials
= NULL
;
2314 int invalid_count
= 0;
2317 * Preprocessor 1: Island seperation
2321 cxr_mesh
*res
= cxr_pull_island( main_mesh
);
2324 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ res
, 0, 0 });
2328 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ main_mesh
, 0, 0 } );
2331 * Preprocessor 2: Displacement processing & error checks
2333 for( int i
=0; i
<world
->absolids
.count
; i
++ )
2335 cxr_solid
*pinf
= cxr_ab_ptr(&world
->absolids
,i
);
2337 for( int j
=0; j
<pinf
->pmesh
->abpolys
.count
; j
++ )
2339 cxr_polygon
*poly
= &pinf
->pmesh
->polys
[ j
];
2341 for( int k
=0; k
<poly
->loop_total
; k
++ )
2343 cxr_loop
*lp
= &pinf
->pmesh
->loops
[ poly
->loop_start
+k
];
2344 cxr_edge
*edge
= &pinf
->pmesh
->edges
[ lp
->edge_index
];
2346 if( edge
->freestyle
)
2350 if( !cxr_poly_convex( pinf
->pmesh
, poly
) )
2354 error
= k_soliderr_non_convex_poly
;
2358 if( cxr_solid_checkerr( pinf
->pmesh
) )
2362 error
= k_soliderr_non_coplanar_vertices
;
2368 pinf
->displacement
= 1;
2372 * Main convex decomp algorithm
2374 int sources_count
= world
->absolids
.count
;
2379 for( int i
=0; i
<sources_count
; i
++ )
2381 cxr_solid pinf
= *(cxr_solid
*)cxr_ab_ptr(&world
->absolids
, i
);
2383 if( pinf
.displacement
|| pinf
.invalid
)
2388 cxr_mesh
*res
= cxr_pull_best_solid( pinf
.pmesh
, 0, &error
);
2392 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ res
, 0, 0 } );
2396 if( error
== k_soliderr_no_solids
)
2398 /* Retry if non-critical error, with extra edges */
2399 res
= cxr_pull_best_solid(pinf
.pmesh
, 1, &error
);
2402 cxr_ab_push( &world
->absolids
, &(cxr_solid
){ res
, 0, 0 } );
2418 cxr_log( "Error %d\n", error
);
2419 cxr_free_world( world
);
2428 * format specific functions: vdf, vmf, (v)bsp
2429 * ----------------------------------------------------------------------------
2431 #ifdef CXR_VALVE_MAP_FILE
2433 CXR_API cxr_vdf
*cxr_vdf_open(const char *path
)
2435 cxr_vdf
*vdf
= malloc(sizeof(cxr_vdf
));
2438 vdf
->fp
= fopen( path
, "w" );
2449 CXR_API
void cxr_vdf_close(cxr_vdf
*vdf
)
2455 CXR_API
void cxr_vdf_put(cxr_vdf
*vdf
, const char *str
)
2457 for( int i
=0; i
<vdf
->level
; i
++ )
2458 fputs( " ", vdf
->fp
);
2460 fputs( str
, vdf
->fp
);
2463 static void cxr_vdf_printf( cxr_vdf
*vdf
, const char *fmt
, ... )
2465 cxr_vdf_put(vdf
,"");
2468 va_start( args
, fmt
);
2469 vfprintf( vdf
->fp
, fmt
, args
);
2473 CXR_API
void cxr_vdf_node(cxr_vdf
*vdf
, const char *str
)
2475 cxr_vdf_put( vdf
, str
);
2476 putc( (u8
)'\n', vdf
->fp
);
2477 cxr_vdf_put( vdf
, "{\n" );
2482 CXR_API
void cxr_vdf_edon( cxr_vdf
*vdf
)
2485 cxr_vdf_put( vdf
, "}\n" );
2488 CXR_API
void cxr_vdf_kv( cxr_vdf
*vdf
, const char *strk
, const char *strv
)
2490 cxr_vdf_printf( vdf
, "\"%s\" \"%s\"\n", strk
, strv
);
2494 * Data-type specific Keyvalues
2496 static void cxr_vdf_ki32( cxr_vdf
*vdf
, const char *strk
, i32 val
)
2498 cxr_vdf_printf( vdf
, "\"%s\" \"%d\"\n", strk
, val
);
2501 static void cxr_vdf_kdouble( cxr_vdf
*vdf
, const char *strk
, double val
)
2503 cxr_vdf_printf( vdf
, "\"%s\" \"%f\"\n", strk
, val
);
2506 static void cxr_vdf_kaxis( cxr_vdf
*vdf
, const char *strk
,
2507 v3f normal
, double offset
, double scale
2509 cxr_vdf_printf( vdf
, "\"%s\" \"[%f %f %f %f] %f\"\n",
2510 strk
, normal
[0], normal
[1],normal
[2], offset
, scale
);
2513 static void cxr_vdf_kv3f( cxr_vdf
*vdf
, const char *strk
, v3f v
)
2515 cxr_vdf_printf( vdf
, "\"%s\" \"[%f %f %f]\"\n", strk
, v
[0], v
[1], v
[2] );
2518 static void cxr_vdf_karrdouble( cxr_vdf
*vdf
, const char *strk
,
2519 int id
, double *doubles
, int count
2521 cxr_vdf_put(vdf
,"");
2522 fprintf( vdf
->fp
, "\"%s%d\" \"", strk
, id
);
2523 for( int i
=0; i
<count
; i
++ )
2525 if( i
== count
-1 ) fprintf( vdf
->fp
, "%f", doubles
[i
] );
2526 else fprintf( vdf
->fp
, "%f ", doubles
[i
] );
2528 fprintf( vdf
->fp
, "\"\n" );
2531 static void cxr_vdf_karrv3f( cxr_vdf
*vdf
, const char *strk
,
2532 int id
, v3f
*vecs
, int count
2534 cxr_vdf_put(vdf
,"");
2535 fprintf( vdf
->fp
, "\"%s%d\" \"", strk
, id
);
2536 for( int i
=0; i
<count
; i
++ )
2538 const char *format
= i
== count
-1? "%f %f %f": "%f %f %f ";
2539 fprintf( vdf
->fp
, format
, vecs
[i
][0], vecs
[i
][1], vecs
[i
][2] );
2541 fprintf( vdf
->fp
, "\"\n" );
2544 static void cxr_vdf_plane( cxr_vdf
*vdf
, const char *strk
, v3f a
, v3f b
, v3f c
)
2546 cxr_vdf_printf( vdf
, "\"%s\" \"(%f %f %f) (%f %f %f) (%f %f %f)\"\n",
2547 strk
, a
[0], a
[1], a
[2], b
[0], b
[1], b
[2], c
[0], c
[1], c
[2] );
2550 static void cxr_vdf_colour255(cxr_vdf
*vdf
, const char *strk
, v4f colour
)
2553 v4_muls( colour
, 255.0, scale
);
2554 cxr_vdf_printf( vdf
, "\"%s\" \"%d %d %d %d\"\n",
2555 strk
,(int)scale
[0], (int)scale
[1], (int)scale
[2], (int)scale
[3]);
2558 static struct cxr_material cxr_nodraw
=
2560 .res
= { 512, 512 },
2561 .name
= "tools/toolsnodraw"
2565 * Find most extreme point along a given direction
2567 static double support_distance( v3f verts
[3], v3f dir
, double coef
)
2571 coef
* v3_dot( verts
[0], dir
),
2574 coef
* v3_dot( verts
[1], dir
),
2575 coef
* v3_dot( verts
[2], dir
)
2581 * Convert regular UV'd triangle int Source's u/vaxis vectors
2583 * This supports affine move, scale, rotation, parallel skewing
2585 static void cxr_calculate_axis( cxr_texinfo
*transform
, v3f verts
[3],
2586 v2f uvs
[3], v2f texture_res
2588 v2f tT
, bT
; /* Tangent/bitangent pairs for UV space and world */
2591 v2_sub( uvs
[0], uvs
[1], tT
);
2592 v2_sub( uvs
[2], uvs
[1], bT
);
2593 v3_sub( verts
[0], verts
[1], tW
);
2594 v3_sub( verts
[2], verts
[1], bW
);
2596 /* Use arbitrary projection if there is no UV */
2597 if( v2_length( tT
) < 0.0001 || v2_length( bT
) < 0.0001 )
2599 v3f uaxis
, normal
, vaxis
;
2601 v3_copy( tW
, uaxis
);
2602 v3_normalize( uaxis
);
2604 v3_cross( tW
, bW
, normal
);
2605 v3_cross( normal
, uaxis
, vaxis
);
2606 v3_normalize( vaxis
);
2608 v3_copy( uaxis
, transform
->uaxis
);
2609 v3_copy( vaxis
, transform
->vaxis
);
2610 v2_zero( transform
->offset
);
2612 v2_div( (v2f
){128.0, 128.0}, texture_res
, transform
->scale
);
2613 transform
->winding
= 1.0;
2617 /* Detect if UV is reversed */
2618 double winding
= v2_cross( tT
, bT
) >= 0.0f
? 1.0f
: -1.0f
;
2620 /* UV projection reference */
2622 v2_muls((v2f
){1,0}, winding
, vX
);
2623 v2_muls((v2f
){0,1}, winding
, vY
);
2625 /* Reproject reference into world space, including skew */
2628 v3_muls( tW
, v2_cross(vX
,bT
) / v2_cross(bT
,tT
), uaxis1
);
2629 v3_muladds( uaxis1
, bW
, v2_cross(vX
, tT
) / v2_cross(tT
,bT
), uaxis1
);
2631 v3_muls( tW
, v2_cross(vY
,bT
) / v2_cross(bT
,tT
), vaxis1
);
2632 v3_muladds( vaxis1
, bW
, v2_cross(vY
,tT
) / v2_cross(tT
,bT
), vaxis1
);
2634 v3_normalize( uaxis1
);
2635 v3_normalize( vaxis1
);
2637 /* Apply source transform to axis (yes, they also need to be swapped) */
2638 v3f norm
, uaxis
, vaxis
;
2640 v3_cross( bW
, tW
, norm
);
2642 v3_cross( vaxis1
, norm
, uaxis
);
2643 v3_cross( uaxis1
, norm
, vaxis
);
2646 v2f uvmin
, uvmax
, uvdelta
;
2647 v2_minv( uvs
[0], uvs
[1], uvmin
);
2648 v2_minv( uvmin
, uvs
[2], uvmin
);
2649 v2_maxv( uvs
[0], uvs
[1], uvmax
);
2650 v2_maxv( uvmax
, uvs
[2], uvmax
);
2652 v2_sub( uvmax
, uvmin
, uvdelta
);
2654 /* world-uv scale */
2655 v2f uvminw
, uvmaxw
, uvdeltaw
;
2656 uvminw
[0] = -support_distance( verts
, uaxis
, -1.0f
);
2657 uvmaxw
[0] = support_distance( verts
, uaxis
, 1.0f
);
2658 uvminw
[1] = -support_distance( verts
, vaxis
, -1.0f
);
2659 uvmaxw
[1] = support_distance( verts
, vaxis
, 1.0f
);
2661 v2_sub( uvmaxw
, uvminw
, uvdeltaw
);
2665 v2_div( uvdeltaw
, uvdelta
, uv_scale
);
2666 v2_div( uv_scale
, texture_res
, uv_scale
);
2668 /* Find offset via 'natural' point */
2669 v2f target_uv
, natural_uv
, tex_offset
;
2670 v2_mul( uvs
[0], texture_res
, target_uv
);
2672 natural_uv
[0] = v3_dot( uaxis
, verts
[0] );
2673 natural_uv
[1] = -v3_dot( vaxis
, verts
[0] );
2674 v2_div( natural_uv
, uv_scale
, natural_uv
);
2676 tex_offset
[0] = target_uv
[0]-natural_uv
[0];
2677 tex_offset
[1] = -(target_uv
[1]-natural_uv
[1]);
2679 /* Copy everything into output */
2680 v3_copy( uaxis
, transform
->uaxis
);
2681 v3_copy( vaxis
, transform
->vaxis
);
2682 v2_copy( tex_offset
, transform
->offset
);
2683 v2_copy( uv_scale
, transform
->scale
);
2684 transform
->winding
= winding
;
2688 * Get the maximal direction of a vector, while also ignoring an axis
2691 static int cxr_cardinal( v3f a
, int ignore
)
2694 double component_max
= -CXR_BIG_NUMBER
;
2696 for( int i
=0; i
<3; i
++ )
2698 if( i
== ignore
) continue;
2700 if( fabs(a
[i
]) > component_max
)
2702 component_max
= fabs(a
[i
]);
2706 double d
= a
[component
] >= 0.0? 1.0: -1.0;
2714 * Convert contiguous mesh to displacement patch
2716 static int cxr_write_disp( cxr_mesh
*mesh
, cxr_world
*world
,
2717 cxr_vmf_context
*ctx
, cxr_vdf
*output
2719 v3f
*verts
= cxr_ab_ptr( mesh
->p_abverts
, 0 );
2723 int con_start
, con_count
;
2731 *vertinfo
= malloc( sizeof(struct vertinfo
)*mesh
->p_abverts
->count
);
2732 int *graph
= malloc( sizeof(int) * mesh
->abedges
.count
*2 );
2735 for( int i
=0; i
<mesh
->p_abverts
->count
; i
++ )
2737 struct vertinfo
*info
= &vertinfo
[i
];
2738 info
->con_start
= con_pos
;
2739 info
->con_count
= 0;
2746 for( int j
=0; j
<mesh
->abedges
.count
; j
++ )
2748 cxr_edge
*edge
= &mesh
->edges
[j
];
2750 if( edge
->i0
== i
|| edge
->i1
== i
)
2752 graph
[ con_pos
++ ] = edge
->i0
== i
? edge
->i1
: edge
->i0
;
2755 if( edge
->freestyle
)
2761 v3f refv
, refu
, refn
;
2762 v3_zero(refv
); v3_zero(refu
); v3_zero(refn
);
2765 * Approximately match the area of the result brush faces to the actual
2768 * Necessary for accuracy and even lightmap texel allocation
2771 double uv_area
= 0.0, face_area
= 0.0, sf
;
2772 v2f uvboundmin
, uvboundmax
;
2773 v3f faceboundmin
, faceboundmax
;
2777 v2_fill( uvboundmin
, CXR_BIG_NUMBER
);
2778 v2_fill( uvboundmax
, -CXR_BIG_NUMBER
);
2779 v3_fill( faceboundmin
, CXR_BIG_NUMBER
);
2780 v3_fill( faceboundmax
, -CXR_BIG_NUMBER
);
2782 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
2784 cxr_polygon
*poly
= &mesh
->polys
[i
];
2786 for( int j
=0; j
<poly
->loop_total
; j
++ )
2788 cxr_loop
*lp0
= &mesh
->loops
[ poly
->loop_start
+j
];
2789 v2_minv( lp0
->uv
, uvboundmin
, uvboundmin
);
2790 v2_maxv( lp0
->uv
, uvboundmax
, uvboundmax
);
2791 v3_minv( verts
[lp0
->index
], faceboundmin
, faceboundmin
);
2792 v3_maxv( verts
[lp0
->index
], faceboundmax
, faceboundmax
);
2795 for( int j
=0; j
<poly
->loop_total
-2; j
++ )
2797 cxr_loop
*lp0
= &mesh
->loops
[poly
->loop_start
],
2798 *lp1
= &mesh
->loops
[poly
->loop_start
+j
+1],
2799 *lp2
= &mesh
->loops
[poly
->loop_start
+j
+2];
2802 v3_sub( verts
[lp1
->index
], verts
[lp0
->index
], va
);
2803 v3_sub( verts
[lp2
->index
], verts
[lp0
->index
], vb
);
2804 v3_cross( va
, vb
, orth
);
2806 face_area
+= v3_length( orth
) / 2.0;
2809 v2_sub( lp1
->uv
, lp0
->uv
, uva
);
2810 v2_sub( lp2
->uv
, lp0
->uv
, uvb
);
2812 uv_area
+= fabs(v2_cross( uva
, uvb
)) / 2.0;
2816 v3_add( faceboundmax
, faceboundmin
, face_center
);
2817 v3_muls( face_center
, 0.5, face_center
);
2818 v2_add( uvboundmin
, uvboundmax
, uv_center
);
2819 v2_muls( uv_center
, 0.5, uv_center
);
2821 sf
= sqrt( face_area
/ uv_area
);
2822 int corner_count
= 0;
2825 * Vertex classification
2826 * boundary vertices: they exist on a freestyle edge
2827 * corners: only connected to other boundaries
2829 for( int i
=0; i
<mesh
->p_abverts
->count
; i
++ )
2831 struct vertinfo
*info
= &vertinfo
[i
];
2832 if( !info
->boundary
) continue;
2837 for( int j
=0; j
<info
->con_count
; j
++ )
2839 int con
= graph
[info
->con_start
+j
];
2841 if( vertinfo
[con
].boundary
)
2847 if( count
> 2 || non_manifold
)
2855 * TODO(harry): This currently only supports power 2 displacements
2856 * its quite straightforward to upgrade it.
2858 * TODO(harry): Error checking is needed here for bad input data
2866 for( int i
=0; i
<mesh
->abpolys
.count
; i
++ )
2868 cxr_polygon
*basepoly
= &mesh
->polys
[i
];
2870 for( int h
=0; h
<basepoly
->loop_total
; h
++ )
2873 i1
= cxr_range(h
+1,basepoly
->loop_total
);
2875 cxr_loop
*l0
= &mesh
->loops
[ basepoly
->loop_start
+i0
],
2876 *l1
= &mesh
->loops
[ basepoly
->loop_start
+i1
];
2877 struct vertinfo
*info
= &vertinfo
[ l0
->index
];
2882 int corner_count
= 1;
2884 cxr_material
*matptr
=
2885 basepoly
->material_id
< 0 || !world
->materials
?
2887 &world
->materials
[ basepoly
->material_id
];
2890 dispedge
[0] = l0
->index
;
2891 dispedge
[1] = l1
->index
;
2892 v2_copy( l0
->uv
, corner_uvs
[0] );
2894 /* Consume (use) face from orignal mesh */
2895 basepoly
->loop_total
= -1;
2897 while( dispedge_count
< 17 )
2899 struct vertinfo
*edge_head
=
2900 &vertinfo
[dispedge
[dispedge_count
-1]];
2904 if( edge_head
->corner
)
2906 /* Find polygon that has edge C-1 -> C */
2907 for( int j
=0; j
<mesh
->abpolys
.count
&& !newvert
; j
++ )
2909 cxr_polygon
*poly
= &mesh
->polys
[j
];
2911 for( int k
=0; k
<poly
->loop_total
; k
++ )
2914 i1
= cxr_range(k
+1,poly
->loop_total
);
2916 cxr_loop
*l0
= &mesh
->loops
[ poly
->loop_start
+i0
],
2917 *l1
= &mesh
->loops
[ poly
->loop_start
+i1
];
2919 if( l0
->index
== dispedge
[dispedge_count
-2] &&
2920 l1
->index
== dispedge
[dispedge_count
-1] )
2922 /* Take the next edge */
2923 v2_copy( l1
->uv
, corner_uvs
[corner_count
++] );
2925 int i2
= cxr_range(i1
+1,poly
->loop_total
);
2926 cxr_loop
*l2
= &mesh
->loops
[ poly
->loop_start
+i2
];
2928 dispedge
[dispedge_count
++] = l2
->index
;
2930 poly
->loop_total
= -1;
2938 for( int j
=0; j
<edge_head
->con_count
; j
++ )
2940 int con
= graph
[edge_head
->con_start
+j
];
2945 if( dispedge_count
> 1 )
2946 if( con
== dispedge
[dispedge_count
-2] )
2949 struct vertinfo
*coninfo
= &vertinfo
[con
];
2951 if( !coninfo
->boundary
)
2954 dispedge
[ dispedge_count
++ ] = con
;
2967 /* All edges collected */
2970 v2_sub( corner_uvs
[1], corner_uvs
[0], va
);
2971 v2_sub( corner_uvs
[2], corner_uvs
[0], vb
);
2973 /* Connect up the grid
2981 * Example: a := common unused vertex that is connected to
2982 * by 1 and 15. Or y-1, and x-1 on the grid.
2983 * g := c and f common vert ^
2988 for( int j
=0; j
<5; j
++ ) grid
[j
] = dispedge
[j
];
2989 for( int j
=1; j
<5; j
++ ) grid
[j
*5+4] = dispedge
[j
+4];
2990 for( int j
=0; j
<4; j
++ ) grid
[4*5+3-j
] = dispedge
[j
+9];
2991 for( int j
=1; j
<4; j
++ ) grid
[j
*5] = dispedge
[16-j
];
2994 for( int j
=1; j
<4; j
++ )
2996 for( int k
=1; k
<4; k
++ )
2998 int s0
= grid
[(j
-1)*5+k
],
3001 struct vertinfo
*va
= &vertinfo
[s0
],
3002 *vb
= &vertinfo
[s1
];
3004 /* Find common non-used vertex */
3005 for( int l
=0; l
<va
->con_count
; l
++ )
3007 for( int m
=0; m
<vb
->con_count
; m
++ )
3009 int cona
= graph
[va
->con_start
+l
],
3010 conb
= graph
[vb
->con_start
+m
];
3014 if( vertinfo
[cona
].used
|| vertinfo
[cona
].boundary
)
3017 grid
[ j
*5+k
] = cona
;
3018 vertinfo
[cona
].used
= 1;
3026 cxr_log( "Broken displacement!\n" );
3037 * Create V reference based on first displacement.
3038 * TODO(harry): This is not the moststable selection method!
3039 * faces can come in any order, so the first disp will of
3040 * course always vary. Additionaly the triangle can be oriented
3043 * Improvement can be made by selecting a first disp/triangle
3044 * based on deterministic factors.
3046 if( disp_count
== 0 )
3050 v3_copy( verts
[dispedge
[0]], tri_ref
[0] );
3051 v3_copy( verts
[dispedge
[4]], tri_ref
[1] );
3052 v3_copy( verts
[dispedge
[8]], tri_ref
[2] );
3053 cxr_calculate_axis( &tx
, tri_ref
, corner_uvs
, (v2f
){512,512} );
3055 v3_muls( tx
.vaxis
, -1.0, refv
);
3056 int v_cardinal
= cxr_cardinal( refv
, -1 );
3058 v3_cross( tx
.vaxis
, tx
.uaxis
, refn
);
3059 v3_muls( refn
, -tx
.winding
, refn
);
3061 /* Computing new reference vectors */
3062 int n1_cardinal
= cxr_cardinal( refn
, v_cardinal
);
3066 for( int j
=0; j
<2; j
++ )
3067 if( u_cardinal
== n1_cardinal
|| u_cardinal
== v_cardinal
)
3071 refu
[u_cardinal
] = tx
.uaxis
[u_cardinal
] > 0.0? 1.0: -1.0;
3075 v3_copy( face_center
, p0
);
3076 v3_muladds( face_center
, refn
, 1.5, pn
);
3077 v3_muladds( face_center
, refv
, 1.5, pv
);
3078 v3_muladds( face_center
, refu
, 1.5, pu
);
3081 /* Create world coordinates */
3082 v3f world_corners
[8];
3085 for( int j
=0; j
<4; j
++ )
3088 v2_sub( corner_uvs
[j
], uv_center
, local_uv
);
3089 v2_copy( corner_uvs
[j
], world_uv
[j
] );
3090 v2_muls( local_uv
, sf
, local_uv
);
3092 v3_muls( refu
, local_uv
[0], world_corners
[j
] );
3093 v3_muladds( world_corners
[j
],refv
,local_uv
[1],world_corners
[j
] );
3094 v3_add( face_center
, world_corners
[j
], world_corners
[j
] );
3097 double *colour
= colours_random
[cxr_range(disp_count
,8)];
3099 for( int j
=0; j
<4; j
++ )
3100 v3_muladds( world_corners
[j
], refn
, -1.0, world_corners
[j
+4] );
3102 /* Apply world transform */
3103 for( int j
=0; j
<8; j
++ )
3105 double *p0
= world_corners
[j
];
3106 v3_muls( p0
, ctx
->scale
, p0
);
3107 v3_add( p0
, ctx
->offset
, p0
);
3110 cxr_texinfo texinfo_shared
;
3111 cxr_calculate_axis( &texinfo_shared
, world_corners
, world_uv
,
3112 (v2f
){ matptr
->res
[0], matptr
->res
[1] } );
3115 cxr_vdf_node( output
, "solid" );
3116 cxr_vdf_ki32( output
, "id", ++ ctx
->brush_count
);
3127 double distances
[25];
3129 v3f lside0
, lside1
, lref
, vdelta
, vworld
;
3132 for( int j
=0; j
<5; j
++ )
3134 ty
= (double)j
/(double)(5-1);
3136 v3_lerp( world_corners
[0], world_corners
[3], ty
, lside0
);
3137 v3_lerp( world_corners
[1], world_corners
[2], ty
, lside1
);
3139 for( int k
=0; k
<5; k
++ )
3143 tx
= (double)k
/(double)(5-1);
3144 v3_lerp( lside0
, lside1
, tx
, lref
);
3145 v3_muls( verts
[grid
[index
]], ctx
->scale
, vworld
);
3146 v3_add( ctx
->offset
, vworld
, vworld
);
3148 v3_sub( vworld
, lref
, vdelta
);
3149 v3_copy( vdelta
, normals
[index
] );
3150 v3_normalize( normals
[index
] );
3151 distances
[index
] = v3_dot( vdelta
, normals
[index
] );
3155 for( int j
=0; j
<6; j
++ )
3157 int *side
= sides
[j
];
3159 cxr_vdf_node( output
, "side" );
3160 cxr_vdf_ki32( output
, "id", ++ ctx
->face_count
);
3161 cxr_vdf_plane( output
, "plane", world_corners
[side
[2]],
3162 world_corners
[side
[1]],
3163 world_corners
[side
[0]] );
3165 cxr_vdf_kv( output
, "material", matptr
->name
);
3166 cxr_vdf_kaxis( output
, "uaxis",
3167 texinfo_shared
.uaxis
,
3168 texinfo_shared
.offset
[0],
3169 texinfo_shared
.scale
[0] );
3170 cxr_vdf_kaxis( output
, "vaxis",
3171 texinfo_shared
.vaxis
,
3172 texinfo_shared
.offset
[1],
3173 texinfo_shared
.scale
[1] );
3175 cxr_vdf_kdouble( output
, "rotation", 0.0 );
3176 cxr_vdf_ki32( output
, "lightmapscale", ctx
->lightmap_scale
);
3177 cxr_vdf_ki32( output
, "smoothing_groups", 0 );
3181 cxr_vdf_node( output
, "dispinfo" );
3182 cxr_vdf_ki32( output
, "power", 2 );
3183 cxr_vdf_kv3f( output
, "startposition", world_corners
[0] );
3184 cxr_vdf_ki32( output
, "flags", 0 );
3185 cxr_vdf_kdouble( output
, "elevation", 0.0 );
3186 cxr_vdf_ki32( output
, "subdiv", 0 );
3188 cxr_vdf_node( output
, "normals" );
3189 for( int k
=0; k
<5; k
++ )
3190 cxr_vdf_karrv3f( output
, "row", k
, &normals
[k
*5], 5 );
3191 cxr_vdf_edon( output
);
3193 cxr_vdf_node( output
, "distances" );
3194 for( int k
=0; k
<5; k
++ )
3195 cxr_vdf_karrdouble( output
, "row", k
, &distances
[k
*5], 5 );
3196 cxr_vdf_edon( output
);
3199 * TODO: This might be needed for the compilers. Opens fine in
3204 cxr_vdf_node( output, "offsets" );
3205 for( int k=0; k<5; k++ )
3206 cxr_vdf_printf( output,
3207 "\"row%d\" \"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\"\n", k );
3208 cxr_vdf_edon( output );
3210 cxr_vdf_node( output, "offset_normals" );
3211 for( int k=0; k<5; k++ )
3212 cxr_vdf_printf( output,
3213 "\"row%d\" \"0 0 1 0 0 1 0 0 1 0 0 1 0 0 1\"\n", k );
3214 cxr_vdf_edon( output );
3216 cxr_vdf_node( output, "alphas" );
3217 for( int k=0; k<5; k++ )
3218 cxr_vdf_printf( output, "\"row%d\" \"0 0 0 0 0\"\n", k );
3219 cxr_vdf_edon( output );
3221 cxr_vdf_node( output, "triangle_tags" );
3222 for( int k=0; k<5-1; k++ )
3223 cxr_vdf_printf( output,
3224 "\"row%d\" \"9 9 9 9 9 9 9 9\"\n", k );
3225 cxr_vdf_edon( output );
3227 cxr_vdf_node( output, "allowed_verts" );
3228 cxr_vdf_printf( output,
3229 "\"10\" \"-1 -1 -1 -1 -1 -1 -1 -1 -1 -1\"\n" );
3230 cxr_vdf_edon( output );
3233 cxr_vdf_edon( output
);
3236 cxr_vdf_edon( output
);
3239 cxr_vdf_node( output
, "editor");
3240 cxr_vdf_colour255( output
, "color",
3241 colours_random
[cxr_range(ctx
->brush_count
,8)]);
3243 cxr_vdf_ki32( output
, "visgroupshown",1);
3244 cxr_vdf_ki32( output
, "visgroupautoshown",1);
3245 cxr_vdf_edon( output
);
3247 cxr_vdf_edon( output
);
3259 * Write header information for a vmf to vdf
3261 CXR_API
void cxr_begin_vmf( cxr_vmf_context
*ctx
, cxr_vdf
*output
)
3263 cxr_vdf_node( output
, "versioninfo" );
3264 cxr_vdf_ki32( output
, "editorversion", 400 );
3265 cxr_vdf_ki32( output
, "editorbuild", 8456 );
3266 cxr_vdf_ki32( output
, "mapversion", ctx
->mapversion
);
3267 cxr_vdf_ki32( output
, "formatversion", 100 );
3268 cxr_vdf_ki32( output
, "prefab", 0 );
3269 cxr_vdf_edon( output
);
3271 cxr_vdf_node( output
, "visgroups" );
3272 cxr_vdf_edon( output
);
3274 cxr_vdf_node( output
, "viewsettings" );
3275 cxr_vdf_ki32( output
, "bSnapToGrid", 1 );
3276 cxr_vdf_ki32( output
, "bShowGrid", 1 );
3277 cxr_vdf_ki32( output
, "bShowLogicalGrid", 0 );
3278 cxr_vdf_ki32( output
, "nGridSpacing", 64 );
3279 cxr_vdf_ki32( output
, "bShow3DGrid", 0 );
3280 cxr_vdf_edon( output
);
3282 cxr_vdf_node( output
, "world" );
3283 cxr_vdf_ki32( output
, "id", 1 );
3284 cxr_vdf_ki32( output
, "mapversion", 1 ); /* ?? */
3285 cxr_vdf_kv( output
, "classname", "worldspawn" );
3286 cxr_vdf_kv( output
, "skyname", ctx
->skyname
);
3287 cxr_vdf_ki32( output
, "maxpropscreenwidth", -1 );
3288 cxr_vdf_kv( output
, "detailvbsp", ctx
->detailvbsp
);
3289 cxr_vdf_kv( output
, "detailmaterial", ctx
->detailmaterial
);
3292 /* Fairly useless but might need in the future */
3293 CXR_API
void cxr_vmf_begin_entities( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
)
3295 cxr_vdf_edon( vdf
);
3298 CXR_API
void cxr_end_vmf( cxr_vmf_context
*ctx
, cxr_vdf
*vdf
)
3303 * Write solids (and displacements) to VMF file
3305 CXR_API
void cxr_push_world_vmf( cxr_world
*world
, cxr_vmf_context
*ctx
,
3308 v3f
*verts
= cxr_ab_ptr( &world
->abverts
, 0 );
3310 /* Write all solids as VMF brushes */
3311 for( int i
=0; i
<world
->absolids
.count
; i
++ )
3313 cxr_solid
*solid
= cxr_ab_ptr(&world
->absolids
,i
);
3315 if( solid
->displacement
)
3317 cxr_write_disp( solid
->pmesh
, world
, ctx
, output
);
3321 cxr_vdf_node( output
, "solid" );
3322 cxr_vdf_ki32( output
, "id", ++ ctx
->brush_count
);
3324 for( int j
=0; j
<solid
->pmesh
->abpolys
.count
; j
++ )
3326 cxr_polygon
*poly
= &solid
->pmesh
->polys
[j
];
3327 cxr_loop
*ploops
= &solid
->pmesh
->loops
[poly
->loop_start
];
3329 cxr_material
*matptr
=
3330 poly
->material_id
< 0 || !world
->materials
?
3332 &world
->materials
[ poly
->material_id
];
3334 cxr_vdf_node( output
, "side" );
3335 cxr_vdf_ki32( output
, "id", ++ ctx
->face_count
);
3337 v3f tri
[3]; v2f uvs
[3];
3339 int i0
= ploops
[0].index
,
3340 i1
= ploops
[1].index
,
3341 i2
= ploops
[2].index
;
3343 v3_muls( verts
[i0
], ctx
->scale
, tri
[0] );
3344 v3_muls( verts
[i1
], ctx
->scale
, tri
[1] );
3345 v3_muls( verts
[i2
], ctx
->scale
, tri
[2] );
3347 v3_add( ctx
->offset
, tri
[0], tri
[0] );
3348 v3_add( ctx
->offset
, tri
[1], tri
[1] );
3349 v3_add( ctx
->offset
, tri
[2], tri
[2] );
3351 v2_copy( ploops
[0].uv
, uvs
[0] );
3352 v2_copy( ploops
[1].uv
, uvs
[1] );
3353 v2_copy( ploops
[2].uv
, uvs
[2] );
3355 cxr_vdf_plane( output
, "plane", tri
[2], tri
[1], tri
[0] );
3356 cxr_vdf_kv( output
, "material", matptr
->name
);
3359 cxr_calculate_axis( &tx
, tri
, uvs
,
3360 (double[2]){ matptr
->res
[0], matptr
->res
[1] });
3362 cxr_vdf_kaxis( output
, "uaxis", tx
.uaxis
, tx
.offset
[0], tx
.scale
[0]);
3363 cxr_vdf_kaxis( output
, "vaxis", tx
.vaxis
, tx
.offset
[1], tx
.scale
[1]);
3365 cxr_vdf_kdouble( output
, "rotation", 0.0 );
3366 cxr_vdf_ki32( output
, "lightmapscale", ctx
->lightmap_scale
);
3367 cxr_vdf_ki32( output
, "smoothing_groups", 0);
3369 cxr_vdf_edon( output
);
3372 cxr_vdf_node( output
, "editor" );
3373 cxr_vdf_colour255( output
, "color",
3374 colours_random
[cxr_range(ctx
->brush_count
,8)]);
3376 cxr_vdf_ki32( output
, "visgroupshown", 1 );
3377 cxr_vdf_ki32( output
, "visgroupautoshown", 1 );
3378 cxr_vdf_edon( output
);
3380 cxr_vdf_edon( output
);
3385 * Valve Source SDK 2015 CS:GO
3387 #define HEADER_LUMPS 64
3388 #define LUMP_WORLDLIGHTS 54
3390 #pragma pack(push,1)
3399 int fileofs
, filelen
;
3404 lumps
[ HEADER_LUMPS
];
3414 float shadow_cast_offset
[3];
3422 float constant_attn
;
3424 float quadratic_attn
;
3432 * Utility for patching BSP tools to remove -1 distance lights (we set them
3433 * like that, because we want these lights to go away)
3435 * Yes, there is no way to do this in hammer
3436 * Yes, the distance KV is unused but still gets compiled to this lump
3437 * No, Entities only compile will not do this for you
3439 CXR_API
int cxr_lightpatch_bsp( const char *path
)
3441 printf( "Lightpatch: %s\n", path
);
3443 FILE *fp
= fopen( path
, "r+b" );
3448 cxr_log( "Could not open BSP file for editing (r+b)\n" );
3454 struct header header
;
3455 fread( &header
, sizeof(struct header
), 1, fp
);
3456 struct lump
*lump
= &header
.lumps
[ LUMP_WORLDLIGHTS
];
3458 /* Read worldlight array */
3459 struct worldlight
*lights
= malloc( lump
->filelen
);
3460 fseek( fp
, lump
->fileofs
, SEEK_SET
);
3461 fread( lights
, lump
->filelen
, 1, fp
);
3463 /* Remove all marked lights */
3464 int light_count
= lump
->filelen
/ sizeof(struct worldlight
);
3467 for( int i
= 0; i
< light_count
; i
++ )
3468 if( lights
[i
].radius
>= 0.0f
)
3469 lights
[new_count
++] = lights
[i
];
3471 lump
->filelen
= new_count
*sizeof(struct worldlight
);
3473 /* Write changes back to file */
3474 fseek( fp
, lump
->fileofs
, SEEK_SET
);
3475 fwrite( lights
, lump
->filelen
, 1, fp
);
3476 fseek( fp
, 0, SEEK_SET
);
3477 fwrite( &header
, sizeof(struct header
), 1, fp
);
3480 cxr_log( "removed %d marked lights\n", light_count
-new_count
);
3488 #endif /* CXR_VALVE_MAP_FILE */
3489 #endif /* CXR_IMPLEMENTATION */