https://hal.inria.fr/hal-00862648Bommes, DavidDavidBommesTITANE - Geometric Modeling of 3D Environments - CRISAM - Inria Sophia Antipolis - Méditerranée - Inria - Institut National de Recherche en Informatique et en AutomatiqueCampen, MarcelMarcelCampenACG - Computer Graphics Group - RWTH - Rheinisch-Westfälische Technische Hochschule Aachen UniversityEbke, Hans-ChristianHans-ChristianEbkeACG - Computer Graphics Group - RWTH - Rheinisch-Westfälische Technische Hochschule Aachen UniversityAlliez, PierrePierreAlliezTITANE - Geometric Modeling of 3D Environments - CRISAM - Inria Sophia Antipolis - Méditerranée - Inria - Institut National de Recherche en Informatique et en AutomatiqueKobbelt, LeifLeifKobbeltACG - Computer Graphics Group - RWTH - Rheinisch-Westfälische Technische Hochschule Aachen UniversityInteger-Grid Maps for Reliable Quad MeshingHAL CCSD2013[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]Bommes, DavidRobust Geometry Processing - IRON - - EC:FP7:ERC2011-01-01 - 2015-12-31 - 257474 - VALID - 2013-09-17 11:12:512023-03-15 08:58:092013-09-17 13:47:10enJournal articlesapplication/pdf1Quadrilateral remeshing approaches based on global parametrization enable many desirable mesh properties. Two of the most important ones are (1) high regularity due to explicit control over irregular vertices and (2) smooth distribution of distortion achieved by convex variational formulations. Apart from these strengths, state-of-the-art techniques suffer from limited reliability on real-world input data, i.e. the determined map might have degeneracies like (local) non-injectivities and consequently often cannot be used directly to generate a quadrilateral mesh. In this paper we propose a novel convex Mixed-Integer Quadratic Programming (MIQP) formulation which ensures by construction that the resulting map is within the class of so called Integer-Grid Maps that are guaranteed to imply a quad mesh. In order to overcome the NP-hardness of MIQP and to be able to remesh typical input geometries in acceptable time we propose two additional problem specific optimizations: a complexity reduction algorithm and singularity separating conditions. While the former decouples the dimension of the MIQP search space from the input complexity of the triangle mesh and thus is able to dramatically speed up the computation without inducing inaccuracies, the latter improves the continuous relaxation, which is crucial for the success of modern MIQP optimizers. Our experiments show that the reliability of the resulting algorithm does not only annihilate the main drawback of parametrization based quad-remeshing but moreover enables the global search for high-quality coarse quad layouts - a difficult task solely tackled by greedy methodologies before.