{"language":[{"iso":"eng"}],"date_updated":"2025-07-14T12:47:35Z","year":"2021","title":"Quad Layouts via Constrained T‐Mesh Quantization","volume":40,"page":"305-314","intvolume":"        40","type":"journal_article","status":"public","_id":"60374","publication":"Computer Graphics Forum","publisher":"Wiley","user_id":"117512","publication_status":"published","citation":{"chicago":"Lyon, Max, Marcel Campen, and Leif Kobbelt. “Quad Layouts via Constrained T‐Mesh Quantization.” <i>Computer Graphics Forum</i> 40, no. 2 (2021): 305–14. <a href=\"https://doi.org/10.1111/cgf.142634\">https://doi.org/10.1111/cgf.142634</a>.","bibtex":"@article{Lyon_Campen_Kobbelt_2021, title={Quad Layouts via Constrained T‐Mesh Quantization}, volume={40}, DOI={<a href=\"https://doi.org/10.1111/cgf.142634\">10.1111/cgf.142634</a>}, number={2}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Lyon, Max and Campen, Marcel and Kobbelt, Leif}, year={2021}, pages={305–314} }","ieee":"M. Lyon, M. Campen, and L. Kobbelt, “Quad Layouts via Constrained T‐Mesh Quantization,” <i>Computer Graphics Forum</i>, vol. 40, no. 2, pp. 305–314, 2021, doi: <a href=\"https://doi.org/10.1111/cgf.142634\">10.1111/cgf.142634</a>.","mla":"Lyon, Max, et al. “Quad Layouts via Constrained T‐Mesh Quantization.” <i>Computer Graphics Forum</i>, vol. 40, no. 2, Wiley, 2021, pp. 305–14, doi:<a href=\"https://doi.org/10.1111/cgf.142634\">10.1111/cgf.142634</a>.","apa":"Lyon, M., Campen, M., &#38; Kobbelt, L. (2021). Quad Layouts via Constrained T‐Mesh Quantization. <i>Computer Graphics Forum</i>, <i>40</i>(2), 305–314. <a href=\"https://doi.org/10.1111/cgf.142634\">https://doi.org/10.1111/cgf.142634</a>","short":"M. Lyon, M. Campen, L. Kobbelt, Computer Graphics Forum 40 (2021) 305–314.","ama":"Lyon M, Campen M, Kobbelt L. Quad Layouts via Constrained T‐Mesh Quantization. <i>Computer Graphics Forum</i>. 2021;40(2):305-314. doi:<a href=\"https://doi.org/10.1111/cgf.142634\">10.1111/cgf.142634</a>"},"issue":"2","publication_identifier":{"issn":["0167-7055","1467-8659"]},"extern":"1","department":[{"_id":"969"}],"date_created":"2025-06-25T09:17:15Z","author":[{"last_name":"Lyon","first_name":"Max","full_name":"Lyon, Max"},{"first_name":"Marcel","full_name":"Campen, Marcel","orcid":"0000-0003-2340-3462","last_name":"Campen","id":"114904"},{"last_name":"Kobbelt","first_name":"Leif","full_name":"Kobbelt, Leif"}],"doi":"10.1111/cgf.142634","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>We present a robust and fast method for the creation of conforming quad layouts on surfaces. Our algorithm is based on the quantization of a T‐mesh, i.e. an assignment of integer lengths to the sides of a non‐conforming rectangular partition of the surface. This representation has the benefit of being able to encode an infinite number of layout connectivity options in a finite manner, which guarantees that a valid layout can always be found. We carefully construct the T‐mesh from a given seamless parametrization such that the algorithm can provide guarantees on the results' quality. In particular, the user can specify a bound on the angular deviation of layout edges from prescribed directions. We solve an integer linear program (ILP) to find a coarse quad layout adhering to that maximal deviation. Our algorithm is guaranteed to yield a conforming quad layout free of T‐junctions together with bounded angle distortion. Our results show that the presented method is fast, reliable, and achieves high quality layouts.</jats:p>"}]}