Abstract
This article presents a fast new numerical method for redistancing objective functions based on the Hopf–Lax formula [1]. The algorithm suggested here is a special case of the previous work in [2] and an extension that applies the Hopf–Lax formula for computing the signed distance to the front. We propose the split Bregman approach to solve the minimization problem as a solution of the eikonal equation obtained from Hopf–Lax formula. Our redistancing procedure is expected to be generalized and widely applied to many fields such as computational fluid dynamics, the minimal surface problem, and elsewhere.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
