def marching_cubes(volume, level=None, spacing=(1.0, 1.0, 1.0), gradient_direction='descent', step_size=1, allow_degenerate=True, use_classic=False):
 try:
  nout = _expected_output_args()
 except Exception:
  nout = 0
 if (nout <= 2):
  warn(skimage_deprecation('`marching_cubes` now uses a better and faster algorithm, and returns four instead of two outputs (see docstring for details). Backwards compatibility with 0.12 and prior is available with `marching_cubes_classic`.'))
 return marching_cubes_lewiner(volume, level, spacing, gradient_direction, step_size, allow_degenerate, use_classic)

def marching_cubes ( volume , level = None , spacing = ( 1.0 , 1.0 , 1.0 ) , gradient_direction = 'descent' , step_size = 1 , allow_degenerate = True , use_classic = False ) : try : nout = _expected_output_args ( ) except Exception : nout = 0 if ( nout <= 2 ) : warn ( skimage_deprecation ( '`marching_cubes` now uses a better and faster algorithm, and returns four instead of two outputs (see docstring for details). Backwards compatibility with 0.12 and prior is available with `marching_cubes_classic`.' ) ) return marching_cubes_lewiner ( volume , level , spacing , gradient_direction , step_size , allow_degenerate , use_classic )
lewiner marching cubes algorithm to find surfaces in 3d volumetric data .