← 研踪 PaperTrailarXiv:2610.34702 · v1
Faster Polyhedral Intersections in 3D
首次提交 2026-10-26 09:48
版本更新 2026-10-26 09:48
雷达观测 2026-10-29 00:36
摘要
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.
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v1 · 2026-10-26 09:48 · 最新观测版本
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.
查看此版本解读 →查看此版本原文 ↗