Faster 3D polyhedral intersections improve mesh and interface tasks
Faster Polyhedral Intersections in 3D
Computational Engineering, Finance, and Science
Summary
Intersecting two 3D shapes made of flat surfaces is important for making computer models of materials and shapes. This paper presents J3D, a new way to do these intersections faster than an older tool called R3D. The authors improved the method originally designed by Sugihara, speeding up operations that many 3D modeling and simulation tools rely on. Their work helps make these complex shape operations quicker and more efficient.
What this means in practice
- •For 3d graphics developers: Improve the speed of 3D shape intersection calculations used in rendering and modeling software by integrating the J3D clipping algorithm.
- •For computational engineers: Accelerate mesh interpolation and material interface reconstruction tasks in simulation software by using the J3D implementation.
Authors
Joseph Donato, Daniel Shevitz, Rao Garimella
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.