The aim of this work is to create a library for Boolean operations on 3D polygonal meshes. Resulting library has to support open models, its memory requirements shouldn't exceed those of existing solutions and it should, ideally, support multiple models. Most of the existing solutions are vulnerable to arithmetic inaccuracies, or do not support open meshes. The solution is based on Adaptive Mesh Booleans method which treats input models as adaptive surfaces. This method assumes that input models can be arbitrarily refined and no individual polygon is particularly important. Instead of computing exact polygon intersections, the input meshes are refined in intersection regions, intersecting polygons are discarded and created holes are closed. Advantages of this approach are robustness against numerical errors, support for open meshes, possibility to trade accuracy for computation time and ability to solve cases like co-planar and near-coincident regions. The resulting library offers three Boolean operations: union, difference and intersection.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:385953 |
| Date | January 2018 |
| Creators | Čižmarik, Roman |
| Contributors | Matýšek, Michal, Španěl, Michal |
| Publisher | Vysoké učení technické v Brně. Fakulta informačních technologií |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0022 seconds