Fast and Robust Point Containment Queries on Trimmed Surface

TL;DR

This paper introduces a fast, stable, and efficient method for point containment queries on trimmed surfaces, improving robustness and speed over existing algorithms, especially for complex and periodic geometries.

Contribution

It presents a novel recursive winding number computation using ellipse bounds and a universal covering space approach for periodic surfaces, enabling linear-time, robust queries.

Findings

Achieves significant speedups over existing winding number algorithms.

Maintains high robustness under geometric noise and complex topologies.

Effective in processing real CAD models and surface tessellation.

Abstract

Point containment queries on trimmed surfaces are fundamental to CAD modeling, solid geometry processing, and surface tessellation. Existing approaches such as ray casting and generalized winding numbers often face limitations in robustness and computational efficiency. We propose a fast and numerically stable method for performing containment queries on trimmed surfaces, including those with periodic parameterizations. Our approach introduces a recursive winding number computation scheme that replaces costly curve subdivision with an ellipse-based bound for Bezier segments, enabling linear-time evaluation. For periodic surfaces, we lift trimming curves to the universal covering space, allowing accurate and consistent winding number computation even for non-contractible or discontinuous loops in parameter domain. Experiments show that our method achieves substantial speedups over existing winding-number algorithms while maintaining high robustness in the presence of geometric noise, open boundaries, and periodic topologies. We further demonstrate its effectiveness in processing real B-Rep models and in robust tessellation of trimmed surfaces.