Dey, Tamal K.Slatton, Andrew G.Mario Botsch and Scott Schaefer2015-02-272015-02-2720111467-8659https://doi.org/10.1111/j.1467-8659.2011.02016.xDelaunay refinement, recognized as a versatile tool for meshing a variety of geometries, has the deficiency that it does not scale well with increasing mesh size. The bottleneck can be traced down to the memory usage of 3D Delaunay triangulations. Recently an approach has been suggested to tackle this problem for the specific case of smooth surfaces by subdividing the sample set in an octree and then refining each subset individually while ensuring termination and consistency. We extend this to localized refinement of volumes, which brings about some new challenges. We show how these challenges can be met with simple steps while retaining provable guarantees, and that our algorithm scales many folds better than a state-of-the-art meshing tool provided by CGAL.I.3.5 [Computer Graphics]Computational Geometry and Object Modeling.CurveSurfaceSolidObject Representations