gcherchi / FastAndRobustMeshArrangements

This is the header-only version of the code we used for the experiments in the paper "Fast and Robust Mesh Arrangements using Floating-point Arithmetic" by G. Cherchi, M. Livesu, R. Scateni and M. Attene (SIGGRAPH Asia 2020).
MIT License
146 stars 24 forks source link

[Question] Mesh booleans application #9

Closed artem-ogre closed 3 years ago

artem-ogre commented 3 years ago

I find mesh boolean operations application of mesh arrangements very interesting. In the paper you mention a custom kernel you wrote for this task. Is this kernel published, is it possible to get it? Otherwise, do you have an advice on how to utilize your mesh arrangements for boolean operations (e.g., integrating with some existing libraries)?

mlivesu commented 3 years ago

for the paper we made an ugly and dirty boolean kernel just to show some results, but was based on point coordinates after snap rounding, hence was not 100% robust. We are currently working at a nicer version of it, which fully exploits our indirect predicates. It'll be released soon... stay tuned ;)