Work

Faster Polyhedral Intersections in 3D

Year: 2026

Type: preprint

Abstract: 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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.34702

Authors: Donato, Joseph, Shevitz, Daniel, Garimella, Rao

Institutions: Dartmouth College, Los Alamos National Laboratory

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: U.S. Department of Energy, National Nuclear Security Administration, Los Alamos National Laboratory

Awards: G1017065088, G1279347439, G6410514744

OpenAlex ID: W7223894615

Cites:

Cited by:

Related to: 10