Algorithm (Workflow)

This function, VLcrossingSG, calculates the crossing points of two solid geometries, SGA and SGB. It is designed to be extremely fast and powerful, supporting both individual solids and cell lists of solids.

Input Parameters

• SGA: This is either a single solid or a cell list of solids representing Solid A.
• SGB: This is either a single solid or a cell list of solids representing Solid B.

Output Results

• VL: A vertex list of all crossing points between the two solids.

Algorithm Steps

1. Check if SGA is a cell array. If true, initialize empty vertex list VL and face list FL. Iterate over each solid in SGA, concatenating their vertex and face lists using VLFLcat2. Convert the combined lists into a solid using SGofVLFL.
2. Check if SGB is a cell array. If true, perform the same operations as in step 1 for SGB.
3. Check if the vertex lists of SGA and SGB are collocated using iscollofVLBB. If they are, calculate the crossing points using mesh2meshTL with the face and vertex lists of both solids.
4. If the vertex lists are not collocated, set VL to an empty array.
5. If no output arguments are specified, plot the results. Close all figures, create a new figure with SGfigure, and set the view angle. Plot SGA in red and SGB in green. Remove duplicate rows from VL and plot the unique crossing points in blue. Use VLFLplotlight to adjust lighting.

Example

To find the crossing points of two boxes:

A = SGbox([30,20,10]); 
VLcrossingSG(A, SGtrans(A, rotdeg(90)));