Object representation by means of nonminimal division quadtrees and octrees
ACM Transactions on Graphics (TOG)
Constructive solid geometry for polyhedral objects
SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
Set operations on polyhedra using binary space partitioning trees
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
A solid modelling system free from topological inconsistency
Journal of Information Processing
Approximating polyhedra with spheres for time-critical collision detection
ACM Transactions on Graphics (TOG)
A fast triangle-triangle intersection test
Journal of Graphics Tools
Vertex-rounding a three-dimensional polyhedral subdivision
Proceedings of the fourteenth annual symposium on Computational geometry
Interval arithmetic yields efficient dynamic filters for computational geometry
Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Application of binary space partitioning trees to geometric modeling and ray-tracing
Application of binary space partitioning trees to geometric modeling and ray-tracing
The Visual Computer: International Journal of Computer Graphics
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Proceedings of the 2005 ACM symposium on Solid and physical modeling
A fast triangle to triangle intersection test for collision detection: Research Articles
Computer Animation and Virtual Worlds
Efficient collision detection using a dual OBB-sphere bounding volume hierarchy
Computer-Aided Design
| Hi-index | 0.00 |
We present an algorithm for robust Boolean operations of triangulated solids, which is suitable for real-word industrial applications involving meshes with large numbers of triangles. In order to avoid potential robustness problems, which may be caused by (almost) degenerate triangles or by intersections of nearly co-planar triangles, we use filtered exact arithmetic, based on the libraries CGAL and GNU Multi Precision Arithmetic Library. The method consists of two major steps: First we compute the exact intersection of the meshes using a sweep plane algorithm. Second we apply mesh cleaning methods which allow us to generate output which can safely be represented using floating point numbers. The performance of the method is demonstrated by several examples which are taken from applications at ECS Magna Powertrain.