Kuijper, ArjanUrban, PhilippDennstädt, MarcoFina, KentenKentenFina2022-03-072022-03-072020https://publica.fraunhofer.de/handle/publica/283081In this thesis various optimizations for the ray-marching algorithm are introduced to efficiently render CSG-operations on high resolution meshes. By using a 2- pass render method and CSG-node memory method, speed-ups of factor 2 to 3 can be achieved in contrast to standard ray marching. We implement a oct-tree based data structure to compress the high resolution SDF (signed distance function) as well as color data. For raw data at a resolution 10243, our compressed data requires on average 1.69% of the raw data. Lastly we compare our performance against the openCSG implementations of the well-known Goldfeather and SCS algorithm.enLead Topic: Digitized WorkResearch Line: Computer graphics (CG)Constructive Solid Geometry (CSG)Voxel objects3D printing006master thesis