@article{60314, abstract = {{A method for the construction of bijective volumetric maps between 3D shapes is presented. Arbitrary shapes of ball-topology are supported, overcoming restrictions of previous methods to convex or star-shaped targets. In essence, the mapping problem is decomposed into a set of simpler mapping problems, each of which can be solved with previous methods for discrete star-shaped mapping problems. Addressing the key challenges in this endeavor, algorithms are described to reliably construct structurally compatible partitions of two shapes with constraints regarding star-shapedness and to compute a parsimonious common refinement of two triangulations.}}, author = {{Hinderink, Steffen and Brückler, Hendrik and Campen, Marcel}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{6}}, pages = {{1--11}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Bijective Volumetric Mapping via Star Decomposition}}}, doi = {{10.1145/3687950}}, volume = {{43}}, year = {{2024}}, } @article{60331, abstract = {{ We present a novel algorithm to map ball-topology tetrahedral meshes onto star-shaped domains with guarantees regarding bijectivity. Our algorithm is based on the recently introduced idea of Shrink-and-Expand, where images of interior vertices are initially clustered at one point (Shrink-), before being sequentially moved to non-degenerate positions yielding a bijective map (-and-Expand). In this context, we introduce the concept of the cluster mesh , i.e. the unexpanded interior mesh consisting of geometrically degenerate simplices. Using local, per-vertex connectivity information solely from the cluster mesh, we show that a viable expansion sequence guaranteed to produce a bijective map can always be found as long as the mesh is shellable. In addition to robustness guarantees for this ubiquitous class of inputs, other practically relevant benefits include improved parsimony and reduced algorithmic complexity. While inheriting some of the worst-case high run time requirements of the state of the art, significant acceleration for the average case is experimentally demonstrated. }}, author = {{Nigolian, Valentin Zénon and Campen, Marcel and Bommes, David}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{6}}, pages = {{1--14}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{A Progressive Embedding Approach to Bijective Tetrahedral Maps driven by Cluster Mesh Topology}}}, doi = {{10.1145/3687992}}, volume = {{43}}, year = {{2024}}, } @article{60355, abstract = {{We present a method for the generation of higher-order tetrahedral meshes. In contrast to previous methods, the curved tetrahedral elements are guaranteed to be free of degeneracies and inversions while conforming exactly to prescribed piecewise polynomial surfaces, such as domain boundaries or material interfaces. Arbitrary polynomial order is supported. Algorithmically, the polynomial input surfaces are first covered by a single layer of carefully constructed curved elements using a recursive refinement procedure that provably avoids degeneracies and inversions. These tetrahedral elements are designed such that the remaining space is bounded piecewise linearly. In this way, our method effectively reduces the curved meshing problem to the classical problem of linear mesh generation (for the remaining space).}}, author = {{Khanteimouri, Payam and Campen, Marcel}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{6}}, pages = {{1--19}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{3D Bézier Guarding: Boundary-Conforming Curved Tetrahedral Meshing}}}, doi = {{10.1145/3618332}}, volume = {{42}}, year = {{2023}}, } @article{60337, abstract = {{ Volumetric mapping is a ubiquitous and difficult problem in Geometry Processing and has been the subject of research in numerous and various directions. While several methods show encouraging results, the field still lacks a general approach with guarantees regarding map bijectivity. Through this work, we aim at opening the door to a new family of methods by providing a novel framework based on the concept of progressive expansion. Starting from an initial map of a tetrahedral mesh whose image may contain degeneracies but no inversions, we incrementally adjust vertex images to expand degenerate elements. By restricting movement to so-called expansion cones , it is done in such a way that the number of degenerate elements decreases in a strictly monotonic manner, without ever introducing any inversion. Adaptive local refinement of the mesh is performed to facilitate this process. We describe a prototype algorithm in the realm of this framework for the computation of maps from ball-topology tetrahedral meshes to convex or star-shaped domains. This algorithm is evaluated and compared to state-of-the-art methods, demonstrating its benefits in terms of bijectivity. We also discuss the associated cost in terms of sometimes significant mesh refinement to obtain the necessary degrees of freedom required for establishing a valid mapping. Our conclusions include that while this algorithm is only of limited immediate practical utility due to efficiency concerns, the general framework has the potential to inspire a range of novel methods improving on the efficiency aspect. }}, author = {{Nigolian, Valentin Zénon and Campen, Marcel and Bommes, David}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{4}}, pages = {{1--19}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Expansion Cones: A Progressive Volumetric Mapping Framework}}}, doi = {{10.1145/3592421}}, volume = {{42}}, year = {{2023}}, } @article{60354, abstract = {{We present a set of operators to perform modifications, in particular collapses and splits, in volumetric cell complexes which are discretely embedded in a background mesh. Topological integrity and geometric embedding validity are carefully maintained. We apply these operators strategically to volumetric block decompositions, so-called T-meshes or base complexes, in the context of hexahedral mesh generation. This allows circumventing the expensive and unreliable global volumetric remapping step in the versatile meshing pipeline based on 3D integer-grid maps. In essence, we reduce this step to simpler local cube mapping problems, for which reliable solutions are available. As a consequence, the robustness of the mesh generation process is increased, especially when targeting coarse or block-structured hexahedral meshes. We furthermore extend this pipeline to support feature alignment constraints, and systematically respect these throughout, enabling the generation of meshes that align to points, curves, and surfaces of special interest, whether on the boundary or in the interior of the domain.}}, author = {{Brückler, Hendrik and Campen, Marcel}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{6}}, pages = {{1--24}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Collapsing Embedded Cell Complexes for Safer Hexahedral Meshing}}}, doi = {{10.1145/3618384}}, volume = {{42}}, year = {{2023}}, } @article{60335, abstract = {{A method is presented to compute volumetric maps and parametrizations of objects over 3D domains. As a key feature, continuity and bijectivity are ensured by construction. Arbitrary objects of ball topology, represented as tetrahedral meshes, are supported. Arbitrary convex as well as star-shaped domains are supported. Full control over the boundary mapping is provided. The method is based on the technique of simplicial foliations, generalized to a broader class of domain shapes and applied adaptively in a novel localized manner. This increases flexibility as well as efficiency over the state of the art, while maintaining reliability in guaranteeing map bijectivity.}}, author = {{Hinderink, Steffen and Campen, Marcel}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{4}}, pages = {{1--16}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Galaxy Maps: Localized Foliations for Bijective Volumetric Mapping}}}, doi = {{10.1145/3592410}}, volume = {{42}}, year = {{2023}}, } @article{60371, abstract = {{We describe a method for the generation of seamless surface parametrizations with guaranteed local injectivity and full control over holonomy. Previous methods guarantee only one of the two. Local injectivity is required to enable these parametrizations' use in applications such as surface quadrangulation and spline construction. Holonomy control is crucial to enable guidance or prescription of the parametrization's isocurves based on directional information, in particular from cross-fields or feature curves, and more generally to constrain the parametrization topologically. To this end we investigate the relation between cross-field topology and seamless parametrization topology. Leveraging previous results on locally injective parametrization and combining them with insights on this relation in terms of holonomy, we propose an algorithm that meets these requirements. A key component relies on the insight that arbitrary surface cut graphs, as required for global parametrization, can be homeomorphically modified to assume almost any set of turning numbers with respect to a given target cross-field.}}, author = {{Shen, Hanxiao and Zhu, Leyi and Capouellez, Ryan and Panozzo, Daniele and Campen, Marcel and Zorin, Denis}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{4}}, pages = {{1--12}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Which cross fields can be quadrangulated?}}}, doi = {{10.1145/3528223.3530187}}, volume = {{41}}, year = {{2022}}, } @article{60372, abstract = {{Developments in the field of parametrization-based quad mesh generation on surfaces have been impactful over the past decade. In this context, an important advance has been the replacement of error-prone rounding in the generation of integer-grid maps, by robust quantization methods. In parallel, parametrization-based hex mesh generation for volumes has been advanced. In this volumetric context, however, the state-of-the-art still relies on fragile rounding, not rarely producing defective meshes, especially when targeting a coarse mesh resolution. We present a method to robustly quantize volume parametrizations, i.e., to determine guaranteed valid choices of integers for 3D integer-grid maps. Inspired by the 2D case, we base our construction on a non-conforming cell decomposition of the volume, a 3D analogue of a T-mesh. In particular, we leverage the motorcycle complex, a recent generalization of the motorcycle graph, for this purpose. Integer values are expressed in a differential manner on the edges of this complex, enabling the efficient formulation of the conditions required to strictly prevent forcing the map into degeneration. Applying our method in the context of hexahedral meshing, we demonstrate that hexahedral meshes can be generated with significantly improved flexibility.}}, author = {{Brückler, Hendrik and Bommes, David and Campen, Marcel}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{4}}, pages = {{1--19}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Volume parametrization quantization for hexahedral meshing}}}, doi = {{10.1145/3528223.3530123}}, volume = {{41}}, year = {{2022}}, } @article{60334, abstract = {{In this article, we provide a detailed survey of techniques for hexahedral mesh generation. We cover the whole spectrum of alternative approaches to mesh generation, as well as post-processing algorithms for connectivity editing and mesh optimization. For each technique, we highlight capabilities and limitations, also pointing out the associated unsolved challenges. Recent relaxed approaches, aiming to generate not pure-hex but hex-dominant meshes, are also discussed. The required background, pertaining to geometrical as well as combinatorial aspects, is introduced along the way.}}, author = {{Pietroni, Nico and Campen, Marcel and Sheffer, Alla and Cherchi, Gianmarco and Bommes, David and Gao, Xifeng and Scateni, Riccardo and Ledoux, Franck and Remacle, Jean and Livesu, Marco}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{2}}, pages = {{1--44}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Hex-Mesh Generation and Processing: A Survey}}}, doi = {{10.1145/3554920}}, volume = {{42}}, year = {{2022}}, } @article{60377, abstract = {{We present a guaranteed quality mesh generation algorithm for the curvilinear triangulation of planar domains with piecewise polynomial boundary. The resulting mesh consists of higher-order triangular elements which are not only regular (i.e., with injective geometric map) but respect strict bounds on quality measures like scaled Jacobian and MIPS distortion. This also implies that the curved triangles' inner angles are bounded from above and below. These are key quality criteria, for instance, in the field of finite element analysis. The domain boundary is reproduced exactly, without geometric approximation error. The central idea is to transform the curvilinear meshing problem into a linear meshing problem via a carefully constructed transformation of bounded distortion, enabling us to leverage key results on guaranteed-quality straight-edge triangulation. The transformation is based on a simple yet general construction and observations about convergence properties of curves under subdivision. Our algorithm can handle arbitrary polynomial order, arbitrarily sharp corners, feature and interface curves, and can be executed using rational arithmetic for strict reliability.}}, author = {{Mandad, Manish and Campen, Marcel}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{4}}, pages = {{1--14}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Guaranteed-quality higher-order triangular meshing of 2D domains}}}, doi = {{10.1145/3450626.3459673}}, volume = {{40}}, year = {{2021}}, } @article{60378, abstract = {{We describe an efficient algorithm to compute a discrete metric with prescribed Gaussian curvature at all interior vertices and prescribed geodesic curvature along the boundary of a mesh. The metric is (discretely) conformally equivalent to the input metric. Its construction is based on theory developed in [Gu et al. 2018b] and [Springborn 2020], relying on results on hyperbolic ideal Delaunay triangulations. Generality is achieved by considering the surface's intrinsic triangulation as a degree of freedom, and particular attention is paid to the proper treatment of surface boundaries. While via a double cover approach the case with boundary can be reduced to the case without boundary quite naturally, the implied symmetry of the setting causes additional challenges related to stable Delaunay-critical configurations that we address explicitly. We furthermore explore the numerical limits of the approach and derive continuous maps from the discrete metrics.}}, author = {{Campen, Marcel and Capouellez, Ryan and Shen, Hanxiao and Zhu, Leyi and Panozzo, Daniele and Zorin, Denis}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{6}}, pages = {{1--16}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Efficient and robust discrete conformal equivalence with boundary}}}, doi = {{10.1145/3478513.3480557}}, volume = {{40}}, year = {{2021}}, } @article{60386, abstract = {{We propose a novel approach to represent maps between two discrete surfaces of the same genus and to minimize intrinsic mapping distortion. Our maps are well-defined at every surface point and are guaranteed to be continuous bijections (surface homeomorphisms). As a key feature of our approach, only the images of vertices need to be represented explicitly, since the images of all other points (on edges or in faces) are properly defined implicitly. This definition is via unique geodesics in metrics of constant Gaussian curvature. Our method is built upon the fact that such metrics exist on surfaces of arbitrary topology, without the need for any cuts or cones (as asserted by the uniformization theorem). Depending on the surfaces' genus, these metrics exhibit one of the three classical geometries: Euclidean, spherical or hyperbolic. Our formulation handles constructions in all three geometries in a unified way. In addition, by considering not only the vertex images but also the discrete metric as degrees of freedom, our formulation enables us to simultaneously optimize the images of these vertices and images of all other points.}}, author = {{Schmidt, Patrick and Campen, Marcel and Born, Janis and Kobbelt, Leif}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{4}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Inter-surface maps via constant-curvature metrics}}}, doi = {{10.1145/3386569.3392399}}, volume = {{39}}, year = {{2020}}, } @article{60385, abstract = {{We present a mesh generation algorithm for the curvilinear triangulation of planar domains with piecewise polynomial boundary. The resulting mesh consists of regular, injective higher-order triangular elements and precisely conforms with the domain's curved boundary. No smoothness requirements are imposed on the boundary. Prescribed piecewise polynomial curves in the interior, like material interfaces or feature curves, can be taken into account for precise interpolation by the resulting mesh's edges as well. In its core, the algorithm is based on a novel explicit construction of guaranteed injective Bézier triangles with certain edge curves and edge parametrizations prescribed. Due to the use of only rational arithmetic, the algorithm can optionally be performed using exact number types in practice, so as to provide robustness guarantees.}}, author = {{Mandad, Manish and Campen, Marcel}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{4}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Bézier guarding}}}, doi = {{10.1145/3386569.3392372}}, volume = {{39}}, year = {{2020}}, } @article{60390, abstract = {{ The problem of discrete surface parametrization, i.e. mapping a mesh to a planar domain, has been investigated extensively. We address the more general problem of mapping between surfaces. In particular, we provide a formulation that yields a map between two disk-topology meshes, which is continuous and injective by construction and which locally minimizes intrinsic distortion. A common approach is to express such a map as the composition of two maps via a simple intermediate domain such as the plane, and to independently optimize the individual maps. However, even if both individual maps are of minimal distortion, there is potentially high distortion in the composed map. In contrast to many previous works, we minimize distortion in an end-to-end manner, directly optimizing the quality of the composed map. This setting poses additional challenges due to the discrete nature of both the source and the target domain. We propose a formulation that, despite the combinatorial aspects of the problem, allows for a purely continuous optimization. Further, our approach addresses the non-smooth nature of discrete distortion measures in this context which hinders straightforward application of off-the-shelf optimization techniques. We demonstrate that, despite the challenges inherent to the more involved setting, discrete surface-to-surface maps can be optimized effectively. }}, author = {{Schmidt, Patrick and Born, Janis and Campen, Marcel and Kobbelt, Leif}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{6}}, pages = {{1--15}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Distortion-minimizing injective maps between surfaces}}}, doi = {{10.1145/3355089.3356519}}, volume = {{38}}, year = {{2019}}, } @article{60389, abstract = {{The generation of quad meshes based on surface parametrization techniques has proven to be a versatile approach. These techniques quantize an initial seamless parametrization so as to obtain an integer grid map implying a pure quad mesh. State-of-the-art methods following this approach have to assume that the surface to be meshed either has no boundary, or has a boundary which the resulting mesh is supposed to be aligned to. In a variety of applications this is not desirable and non-boundary-aligned meshes or grid-parametrizations are preferred. We thus present a technique to robustly generate integer grid maps which are either boundary-aligned, non-boundary-aligned, or partially boundary-aligned, just as required by different applications. We thereby generalize previous work to this broader setting. This enables the reliable generation of trimmed quad meshes with partial elements along the boundary, preferable in various scenarios, from tiled texturing over design and modeling to fabrication and architecture, due to fewer constraints and hence higher overall mesh quality and other benefits in terms of aesthetics and flexibility.}}, author = {{Lyon, Max and Campen, Marcel and Bommes, David and Kobbelt, Leif}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{4}}, pages = {{1--14}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Parametrization quantization with free boundaries for trimmed quad meshing}}}, doi = {{10.1145/3306346.3323019}}, volume = {{38}}, year = {{2019}}, } @article{60384, abstract = {{Seamless global parametrization of surfaces is a key operation in geometry processing, e.g., for high-quality quad mesh generation. A common approach is to prescribe the parametric domain structure, in particular, the locations of parametrization singularities (cones), and solve a non-convex optimization problem minimizing a distortion measure, with local injectivity imposed through either constraints or barrier terms. In both cases, an initial valid parametrization is essential to serve as a feasible starting point for obtaining an optimized solution. While convexified versions of the constraints eliminate this initialization requirement, they narrow the range of solutions, causing some problem instances that actually do have a solution to become infeasible. We demonstrate that for arbitrary given sets of topologically admissible parametric cones with prescribed curvature, a global seamless parametrization always exists (with the exception of one well-known case). Importantly, our proof is constructive and directly leads to a general algorithm for computing such parametrizations. Most distinctively, this algorithm is bootstrapped with a convex optimization problem (solving for a conformal map), in tandem with a simple linear equation system (determining a seamless modification of this map). This initial map can then serve as a valid starting point and be optimized for low distortion using existing injectivity preserving methods.}}, author = {{Campen, Marcel and Shen, Hanxiao and Zhou, Jiaran and Zorin, Denis}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{1}}, pages = {{1--19}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Seamless Parametrization with Arbitrary Cones for Arbitrary Genus}}}, doi = {{10.1145/3360511}}, volume = {{39}}, year = {{2019}}, } @article{60399, abstract = {{A variety of techniques were proposed to model smooth surfaces based on tensor product splines (e.g. subdivision surfaces, free-form splines, T-splines). Conversion of an input surface into such a representation is commonly achieved by constructing a global seamless parametrization, possibly aligned to a guiding cross-field (e.g. of principal curvature directions), and using this parametrization as domain to construct the spline-based surface. One major fundamental difficulty in designing robust algorithms for this task is the fact that for common types, e.g. subdivision surfaces (requiring a conforming domain mesh) or T-spline surfaces (requiring a globally consistent knot interval assignment) reliably obtaining a suitable parametrization that has the same topological structure as the guiding field poses a major challenge. Even worse, not all fields do admit suitable parametrizations, and no concise conditions are known as to which fields do. We present a class of surface constructions (T-splines with halfedge knots ) and a class of parametrizations ( seamless similarity maps ) that are, in a sense, a perfect match for the task: for any given guiding field structure, a compatible parametrization of this kind exists and a smooth piecewise rational surface with exactly the same structure as the input field can be constructed from it. As a byproduct, this enables full control over extraordinary points. The construction is backward compatible with classical NURBS. We present efficient algorithms for building discrete conformal similarity maps and associated T-meshes and T-spline surfaces. }}, author = {{Campen, Marcel and Zorin, Denis}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{4}}, pages = {{1--16}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Similarity maps and field-guided T-splines}}}, doi = {{10.1145/3072959.3073647}}, volume = {{36}}, year = {{2017}}, } @article{60437, abstract = {{Parametrization based methods have recently become very popular for the generation of high quality quad meshes. In contrast to previous approaches, they allow for intuitive user control in order to accommodate all kinds of application driven constraints and design intentions. A major obstacle in practice, however, are the relatively long computations that lead to response times of several minutes already for input models of moderate complexity. In this paper we introduce a novel strategy to handle highly complex input meshes with up to several millions of triangles such that quad meshes can still be created and edited within an interactive workflow. Our method is based on representing the input model on different levels of resolution with a mechanism to propagate parametrizations from coarser to finer levels. The major challenge is to guarantee consistent parametrizations even in the presence of charts, transition functions, and singularities. Moreover, the remaining degrees of freedom on coarser levels of resolution have to be chosen carefully in order to still achieve low distortion parametrizations. We demonstrate a prototypic system where the user can interactively edit quad meshes with powerful high-level operations such as guiding constraints, singularity repositioning, and singularity connections.}}, author = {{Ebke, Hans-Christian and Schmidt, Patrick and Campen, Marcel and Kobbelt, Leif}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{6}}, pages = {{1--13}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Interactively controlled quad remeshing of high resolution 3D models}}}, doi = {{10.1145/2980179.2982413}}, volume = {{35}}, year = {{2016}}, } @article{60436, abstract = {{This paper presents a method for bijective parametrization of 2D and 3D objects over canonical domains. While a range of solutions for the two-dimensional case are well-known, our method guarantees bijectivity of mappings also for a large, combinatorially-defined class of tetrahedral meshes (shellable meshes). The key concept in our method is the piecewise-linear (PL) foliation, decomposing the mesh into one-dimensional submanifolds and reducing the mapping problem to parametrization of a lower-dimensional manifold (a foliation section). The maps resulting from these foliations are proved to be bijective and continuous, and shown to have provably bijective PL approximations. We describe exact, numerically robust evaluation methods and demonstrate our implementation's capabilities on a large variety of meshes.}}, author = {{Campen, Marcel and Silva, Cláudio T. and Zorin, Denis}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{4}}, pages = {{1--15}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Bijective maps from simplicial foliations}}}, doi = {{10.1145/2897824.2925890}}, volume = {{35}}, year = {{2016}}, } @article{60442, abstract = {{Global surface parametrization often requires the use of cuts or charts due to non-trivial topology. In recent years a focus has been on so-calledseamlessparametrizations, where the transition functions across the cuts are rigid transformations with a rotation about some multiple of 90°. Of particular interest, e.g. for quadrilateral meshing, paneling, or texturing, are those instances where in addition the translational part of these transitions is integral (or more generally: quantized). We show that finding not even the optimal, but just an arbitrary valid quantization (one that does not imply parametric degeneracies), is a complex combinatorial problem. We present a novel method that allows us to solve it, i.e. to find valid as well as good quality quantizations. It is based on an original approach to quickly construct solutions to linear Diophantine equation systems, exploiting the specific geometric nature of the parametrization problem. We thereby largely outperform the state-of-the-art, sometimes by several orders of magnitude.}}, author = {{Campen, Marcel and Bommes, David and Kobbelt, Leif}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{6}}, pages = {{1--12}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Quantized global parametrization}}}, doi = {{10.1145/2816795.2818140}}, volume = {{34}}, year = {{2015}}, }