Li, Rui-ZengGuo, Jia-PengWang, QiChai, ShuangmingLiu, LigangFu, Xiao-MingChaine, RaphaëlleKim, Min H.2022-04-222022-04-2220221467-8659https://doi.org/10.1111/cgf.14462https://diglib.eg.org:443/handle/10.1111/cgf14462We propose an interactive method to edit a discrete Chebyshev net, which is a quad mesh with edges of the same length. To ensure that the edited mesh is always a discrete Chebyshev net, the maximum difference of all edge lengths should be zero during the editing process. Hence, we formulate an objective function using lp-norm (p > 2) to force the maximum length deviation to approach zero in practice. To optimize the nonlinear and non-convex objective function interactively and efficiently, we develop a novel second-order solver. The core of the solver is to construct a new convex majorizer for our objective function to achieve fast convergence. We present two acceleration strategies to further reduce the optimization time, including adaptive p change and adaptive variables reduction. A large number of experiments demonstrate the capability and feasibility of our method for interactively editing complex discrete Chebyshev nets.CCS Concepts: Computing methodologies --> Shape modelingComputing methodologiesShape modeling10.1111/cgf.14462111-12010 pages