Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments

DOI10.1016/J.COMGEO.2006.11.009MaRDI QIDQ2371337zbMATH OpenOpenAlexFDO

Authors Peter Hachenberger, Lutz Kettner, K. Mehlhorn

Publication date 4 July 2007

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2006.11.009

zbMATH Keywords

algorithmscomputational geometryBoolean operationsexactnessboundary representationNef polyhedraNef complexestopological operations

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Boolean operations on 3D selective Nef complexes: data structure, algorithms, and implementation
• scientific article; zbMATH DE number 850272
• scientific article; zbMATH DE number 1304965
• Exact, robust, and efficient regularized Booleans on general 3D meshes
• Topological operators and Boolean operations for complex-based nonmanifold geometric models

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 4110185 (Why is no real title available?)
• scientific article; zbMATH DE number 51258 (Why is no real title available?)
• scientific article; zbMATH DE number 3592563 (Why is no real title available?)
• scientific article; zbMATH DE number 1368469 (Why is no real title available?)
• scientific article; zbMATH DE number 850272 (Why is no real title available?)
• A complete and efficient algorithm for the intersection of a general and a convex polyhedron
• An exact, complete and efficient implementation for computing planar maps of quadric intersection curves: exploiting a little more geometry and a little less algebra
• Boolean operations on 3D selective Nef complexes: data structure, algorithms, and implementation
• Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
• Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
• Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic. II: Computation
• FAST SOFTWARE FOR BOX INTERSECTIONS
• Infimaximal Frames: A Technique for Making Lines Look Like Segments
• Multidimensional binary search trees used for associative searching
• Offsetting operations in solid modelling
• On the design of CGAL a computational geometry algorithms library
• Set-combinations of the mixed-dimension cellular objects of the Djinn API.
• Shortest path geometric rounding
• Towards exact geometric computation
• Using generic programming for designing a data structure for polyhedral surfaces
• Vertex-rounding a three-dimensional polyhedral subdivision

Cited in

(9)

• Arrangements on parametric surfaces. II: Concretizations and applications
• Exact Fast Parallel Intersection of Large 3-D Triangular Meshes
• An efficient local approach to convexity testing of piecewise-linear hypersurfaces
• Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
• Boolean operations on 3D selective Nef complexes: data structure, algorithms, and implementation
• Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
• Exact, robust, and efficient regularized Booleans on general 3D meshes
• Boolean algebra of two-dimensional continua with arbitrarily complex topology
• Unstructured un-split geometrical volume-of-fluid methods - a review

Describes a project that uses

Uses Software

• CGAL
• LEDA
• Traits

This page was built for publication: Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371337)