Robust and Efficient Cartesian Mesh Generation for Component-Based Geometry

This work documents a new method for rapid and robust Cartesian mesh generation for componentbased geometry. The new algorithm adopts a novel strategy which first intersects the components to extract the wetted surface before proceeding with volume mesh generation in a second phase. The intersection scheme is based on a robust geometry engine that uses adaptive precision arithmetic and which automatically and consistently handles geometric degeneracies with an algorithmic tie-breaking routine. The intersection procedure has worse case computational complexity of O(N logN) and is demonstrated on test cases with up to 121 overlapping and intersecting components including a variety of geometric degeneracies.