Hefetz, Eden FedidaChien, EdwardWeber, OfirBærentzen, Jakob Andreas and Hildebrandt, Klaus2017-07-022017-07-0220171467-8659https://doi.org/10.1111/cgf.13255https://diglib.eg.org:443/handle/10.1111/cgf13255We present a planar harmonic cage-based deformation method with local injectivity and bounded distortion guarantees, that is significantly faster than state-of-the-art methods with similar guarantees, and allows for real-time interaction. With a convex proxy for a near-convex characterization of the bounded distortion harmonic mapping space from [LW16], we utilize a modified alternating projection method (referred to as ATP) to project to this proxy. ATP draws inspiration from [KABL15] and restricts every other projection to lie in a tangential hyperplane. In contrast to [KABL15], our convex setting allows us to show that ATP is provably convergent (and is locally injective). Compared to the standard alternating projection method, it demonstrates superior convergence in fewer iterations, and it is also embarrassingly parallel, allowing for straightforward GPU implementation. Both of these factors combine to result in unprecedented speed. The convergence proof generalizes to arbitrary pairs of intersecting convex sets, suggesting potential use in other applications. Additional theoretical results sharpen the near-convex characterization that we use and demonstrate that it is homeomorphic to the bounded distortion harmonic mapping space (instead of merely being bijective).I.3.5 [Computer Graphics]Computational Geometry and Object ModelingGeometric algorithmslanguagesand systemsHierarchy and geometric transformationsI.3.7 [Computer Graphics]Three Dimensional Graphics and RealismAnimation G.1.6 [Numerical Analysis]OptimizationConvex programming10.1111/cgf.13255175-188