Morten Bojsen-Hansen
Michael Bang Nielsen
ABSTRACT
The level set method offers many advantages over e.g. meshes for modelling and visual effects, but a naïve implementation is both computationally expensive and memory intensive. Narrow band level sets alleviate both issues but are still limited by the finest detail resolved due to uniform resolution along the surface. Voxel structures that are adaptive along the surface improve this [Frisken et al. 2000], but have not seen wide adoption. This is presumably due to difficulties matching the performance of optimized narrow band implementations like industry standard OpenVDB [Museth 2013]. We present the adaptive level set implementation in Bifrost which is competitive with OpenVDB in speed while offering lower memory usage thanks to spatial adaptivity. Our contributions include novel algorithms for adaptive sharpened B-spline interpolation of volumes in general, voxelizing meshes and points into adaptive level set volumes, and meshing adaptive level sets.
Supplemental Material
Available for Download
Supplemental Document for "Spatially Adaptive Level Set Tools in Bifrost: Sharpened Cubic B-Spline Sampling on Adaptive Grids"
- H. Edelsbrunner and E. P. Mücke. 1988. Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms. In Proc. Fourth Annual Symp. Computational Geometry. ACM, 118–133.Google Scholar
Digital Library
- Sarah F. Frisken, Ronald N. Perry, Alyn P. Rockwood, and Thouis R. Jones. 2000. Adaptively Sampled Distance Fields: A General Representation of Shape for Computer Graphics. In Proc. SIGGRAPH 2000. 249–254.Google ScholarDigital Library
- Ken Museth. 2013. VDB: High-Resolution Sparse Volumes with Dynamic Topology. ACM Trans. Graph. 32, 3, Article 27 (July 2013).Google ScholarDigital Library
- Michael B. Nielsen and Robert Bridson. 2016. Spatially Adaptive FLIP Fluid Simulations in Bifrost. In ACM SIGGRAPH 2016 Talks. ACM, Article 41.Google Scholar
- Scott Schaefer and Joe Warren. 2004. Dual Marching Cubes: Primal Contouring of Dual Grids. In Proc. 12th Pacific Conference on Computer Graphics and Applications (PG 2004).70–76.Google ScholarCross Ref
- Hongyi Xu and Jernej Barbič. 2014. Signed Distance Fields for Polygon Soup Meshes. In Proc. Graphics Interface 2014(GI ’14). CAPS, 35–41.Google ScholarDigital Library
Index Terms
Spatially Adaptive Volume Tools in Bifrost
Recommendations
Localized delaunay refinement for piecewise-smooth complexes
SoCG '13: Proceedings of the twenty-ninth annual symposium on Computational geometryDelaunay refinement, a versatile method of mesh generation, is plagued by memory thrashing when required to generate large output meshes. To address this space issue, a localized version of Delaunay refinement was proposed for generating meshes for ...
Anisotropic non-local means with spatially adaptive patch shapes
SSVM'11: Proceedings of the Third international conference on Scale Space and Variational Methods in Computer VisionThis paper is about extending the classical Non-Local Means (NLM) denoising algorithm using general shapes instead of square patches. The use of various shapes enables to adapt to the local geometry of the image while looking for pattern redundancies. A ...
Meshing Surfaces and Volumes with Centroidal Voronoi Tesselations
ISVD '11: Proceedings of the 2011 Eighth International Symposium on Voronoi Diagrams in Science and EngineeringWe present several variations on Centroidal Voronoi Tesselations. First we review the classical definition, as a stable critical point of an objective function (quantization noise power), then we propose some modifications of the objective function (...
Comments