Faster Polyhedral Intersections in 3D
The operation of intersecting two polyhedra, which can be reduced to clipping one polyhedron with a series of planes formed from another polyhedron, is central to intersection based mesh interpolation and material interface reconstruction. R3D is a robust library for such operation which implements the algorithm of Sugihara. In this paper, we present J3D, a new implementation of the clipping algorithm of Sugihara that provides substantial performance improvements over R3D.
Authors
- Rao Garimella
- Daniel Shevitz
- Joseph Donato
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-10-26
- DOI
- https://doi.org/10.48550/arxiv.2610.34702
- Primary Topic
- Computational Geometry and Mesh Generation
- Type
- preprint