Abstract
We present two robust and direct algorithms for both voxelization and polygonization of solids constructed as Boolean combinations of free-form solids (free-form CSG solids). These algorithms are based on the extended simplicial chain (ESC) model; they are robust as they are fully based on a point in solid test (derived from the ESC model) that does not need either solving of equation systems or dealing with complex special cases. Final results are directly obtained from CSG expression, without evaluating Boolean operations. Both algorithms have been developed by looking for an agreement between the result precision and the computation cost.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
