Segmentationofthree-dimensional(3D)complicatedstructuresisofgreatimportanceformanyrealapplications.Inthisworkwecombinegraphcutminimizationmethodwithavariantofthelevelsetideafor3DsegmentationbasedontheMumford-Shahmodel.ComparedwiththetraditionalapproachforsolvingtheEuler-Lagrangeequationwedonotneedtosolveanypartialdifferentialequations.Instead,theminimumcutonaspecialdesignedgraphneedtobecomputed.Themethodistestedondatawithcomplicatedstructures.Itisratherstablewithrespecttoinitialvalueandthealgorithmisnearlyparameterfree.Experimentsshowthatitcansolvelargeproblemsmuchfasterthantraditionalapproaches.