Adaptively subdivides geometry using proximity look ups to another geometry.
Subdivision depth: 14
6.5M vs 26.8B polygons (about 4K less)
To avoid having holes in the geometry, use the Houdini-Catmull Clark algorithm. However this will be significantly slower, and prohibitively expensive at these subdivision levels.
EDIT: Improved the curve look up to be resolution independent.