{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T07:59:48Z","timestamp":1768723188310,"version":"3.49.0"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T00:00:00Z","timestamp":1543881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Deutsche Forschungsgemeinschaft-Collaborative Research Center","award":["TRR 109"],"award-info":[{"award-number":["TRR 109"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2018,12,31]]},"abstract":"<jats:p>Discrete orthogonal geodesic nets (DOGs) are a quad mesh analogue of developable surfaces. In this work we study continuous deformations on these discrete objects. Our main theoretical contribution is the characterization of the shape space of DOGs for a given net connectivity. We show that generally, this space is locally a manifold of a fixed dimension, apart from a set of singularities, implying that DOGs are continuously deformable. Smooth flows can be constructed by a smooth choice of vectors on the manifold's tangent spaces, selected to minimize a desired objective function under a given metric. We show how to compute such vectors by solving a linear system, and we use our findings to devise a geometrically meaningful way to handle singular points. We base our shape space metric on a novel DOG Laplacian operator, which is proved to converge under sampling of an analytical orthogonal geodesic net. We further show how to extend the shape space of DOGs by supporting creases and curved folds and apply the developed tools in an editing system for developable surfaces that supports arbitrary bending, stretching, cutting, (curved) folds, as well as smoothing and subdivision operations.<\/jats:p>","DOI":"10.1145\/3272127.3275088","type":"journal-article","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T19:16:10Z","timestamp":1543432570000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["The shape space of discrete orthogonal geodesic nets"],"prefix":"10.1145","volume":"37","author":[{"given":"Michael","family":"Rabinovich","sequence":"first","affiliation":[{"name":"ETH Zurich, Switzerland"}]},{"given":"Tim","family":"Hoffmann","sequence":"additional","affiliation":[{"name":"TU Munich"}]},{"given":"Olga","family":"Sorkine-Hornung","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2018,12,4]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964997"},{"key":"e_1_2_2_2_1","volume-title":"Proc. Symposium on Geometry Processing. http:\/\/dl.acm.org\/citation.cfm?id=1281920","author":"Bobenko A. I.","year":"1937","unstructured":"A. I. Bobenko and P. Schr\u00f6der . 2005. Discrete Willmore Flow . In Proc. Symposium on Geometry Processing. http:\/\/dl.acm.org\/citation.cfm?id=1281920 .128 1937 A. I. Bobenko and P. Schr\u00f6der. 2005. Discrete Willmore Flow. In Proc. Symposium on Geometry Processing. http:\/\/dl.acm.org\/citation.cfm?id=1281920.1281937"},{"key":"e_1_2_2_3_1","doi-asserted-by":"crossref","unstructured":"A. I. Bobenko and Y. B. Suris. 2008. Discrete differential geometry: integrable structure. Graduate studies in mathematics Vol. 98. American Mathematical Society Providence (R.I.).  A. I. Bobenko and Y. B. Suris. 2008. Discrete differential geometry: integrable structure. Graduate studies in mathematics Vol. 98. American Mathematical Society Providence (R.I.).","DOI":"10.1090\/gsm\/098"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03171.x"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601116"},{"key":"e_1_2_2_6_1","unstructured":"R. Burgoon Z. J. Wood and E. Grinspun. 2006. Discrete Shells Origami. In Computers and Their Applications.  R. Burgoon Z. J. Wood and E. Grinspun. 2006. Discrete Shells Origami. In Computers and Their Applications."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461986"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049670"},{"key":"e_1_2_2_9_1","first-page":"543","article-title":"Needles","volume":"203","author":"De Coninck A.","year":"2016","unstructured":"A. De Coninck , B. De Baets , D. Kourounis , F. Verbosio , O. Schenk , S. Maenhout , and J. Fostier . 2016 . Needles : Toward Large-Scale Genomic Prediction with Marker-by-Environment Interaction. Genetics 203 , 1 (2016), 543 -- 555 . arXiv:http:\/\/www.genetics.org\/content\/203\/1\/543.full.pdf A. De Coninck, B. De Baets, D. Kourounis, F. Verbosio, O. Schenk, S. Maenhout, and J. Fostier. 2016. Needles: Toward Large-Scale Genomic Prediction with Marker-by-Environment Interaction. Genetics 203, 1 (2016), 543--555. arXiv:http:\/\/www.genetics.org\/content\/203\/1\/543.full.pdf","journal-title":"Toward Large-Scale Genomic Prediction with Marker-by-Environment Interaction. Genetics"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-011-1025-2"},{"key":"e_1_2_2_11_1","volume-title":"Proceedings of the IABSE-IASS Symposium: Taller, Longer, Lighter. 20--23","author":"Demaine E. D.","unstructured":"E. D. Demaine , M. L. Demaine , D. Koschitz , and T. Tachi . 2011b. Curved crease folding: a review on art, design and mathematics . In Proceedings of the IABSE-IASS Symposium: Taller, Longer, Lighter. 20--23 . E. D. Demaine, M. L. Demaine, D. Koschitz, and T. Tachi. 2011b. Curved crease folding: a review on art, design and mathematics. In Proceedings of the IABSE-IASS Symposium: Taller, Longer, Lighter. 20--23."},{"key":"e_1_2_2_12_1","volume-title":"Origami, Polyhedra","author":"Demaine E. D.","unstructured":"E. D. Demaine and J. O'Rourke . 2007. Geometric Folding Algorithms: Linkages , Origami, Polyhedra . Cambridge University Press . E. D. Demaine and J. O'Rourke. 2007. Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/311535.311576"},{"key":"e_1_2_2_14_1","volume-title":"Differential Geometry of Curves and Surfaces","author":"do Carmo M. P.","unstructured":"M. P. do Carmo . 1976. Differential Geometry of Curves and Surfaces . Prentice-Hall . M. P. do Carmo. 1976. Differential Geometry of Curves and Surfaces. Prentice-Hall."},{"key":"e_1_2_2_15_1","volume-title":"Proc. Symposium on Geometry Processing. 183--192","author":"Eckstein I.","unstructured":"I. Eckstein , J.-P. Pons , Y. Tong , C.-C. Kuo , and M. Desbrun . 2007. Generalized surface flows for mesh processing . In Proc. Symposium on Geometry Processing. 183--192 . I. Eckstein, J.-P. Pons, Y. Tong, C.-C. Kuo, and M. Desbrun. 2007. Generalized surface flows for mesh processing. In Proc. Symposium on Geometry Processing. 183--192."},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.01974.x"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1999.12005003"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.2307\/2007118"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2012.08.004"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12450"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12968"},{"key":"e_1_2_2_22_1","volume-title":"Discrete differential geometry of curves and surfaces. COE Lecture Notes 18","author":"Hoffmann T.","year":"2009","unstructured":"T. Hoffmann . 2009. Discrete differential geometry of curves and surfaces. COE Lecture Notes 18 ( 2009 ). T. Hoffmann. 2009. Discrete differential geometry of curves and surfaces. COE Lecture Notes 18 (2009)."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1976.1674542"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03179.x"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360674"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276457"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3015460"},{"key":"e_1_2_2_28_1","first-page":"1","article-title":"Towards the Next Generation of Multiperiod Optimal Power Flow Solvers","volume":"99","author":"Kourounis D.","year":"2018","unstructured":"D. Kourounis , A. Fuchs , and O. Schenk . 2018 . Towards the Next Generation of Multiperiod Optimal Power Flow Solvers . IEEE Transactions on Power Systems PP , 99 (2018), 1 -- 10 . D. Kourounis, A. Fuchs, and O. Schenk. 2018. Towards the Next Generation of Multiperiod Optimal Power Flow Solvers. IEEE Transactions on Power Systems PP, 99 (2018), 1--10.","journal-title":"IEEE Transactions on Power Systems PP"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141941"},{"key":"e_1_2_2_30_1","volume-title":"Proc. Pacific Graphics, Short Papers.","author":"Mitani J.","unstructured":"J. Mitani and T. Igarashi . 2011. Interactive design of planar curved folding by reflection . In Proc. Pacific Graphics, Short Papers. J. Mitani and T. Igarashi. 2011. Interactive design of planar curved folding by reflection. In Proc. Pacific Graphics, Short Papers."},{"key":"e_1_2_2_31_1","unstructured":"MOSEK ApS. 2017. The MOSEK optimization toolbox for MATLAB manual. Version 8.1. http:\/\/docs.mosek.com\/8.1\/toolbox\/index.html  MOSEK ApS. 2017. The MOSEK optimization toolbox for MATLAB manual. Version 8.1. http:\/\/docs.mosek.com\/8.1\/toolbox\/index.html"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2462010"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1980-0572855-7"},{"key":"e_1_2_2_34_1","unstructured":"J. Nocedal and S. J. Wright. 2006. Sequential quadratic programming. Springer.  J. Nocedal and S. J. Wright. 2006. Sequential quadratic programming. Springer."},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201290"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1080\/10586458.1993.10504266"},{"key":"e_1_2_2_37_1","doi-asserted-by":"crossref","unstructured":"H. Pottmann and J. Wallner. 2001. Computational line geometry. Springer Berlin Heidelberg New York.   H. Pottmann and J. Wallner. 2001. Computational line geometry. Springer Berlin Heidelberg New York.","DOI":"10.1007\/978-3-642-04018-4"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180494"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/166117.166118"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03162.x"},{"key":"e_1_2_2_41_1","volume-title":"Proc. Symposium on Geometry Processing. 109--116","author":"Sorkine O.","unstructured":"O. Sorkine and M. Alexa . 2007. As-rigid-as-possible surface modeling . In Proc. Symposium on Geometry Processing. 109--116 . O. Sorkine and M. Alexa. 2007. As-rigid-as-possible surface modeling. In Proc. Symposium on Geometry Processing. 109--116."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201303"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-006-0635-2"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1201\/b10653-20"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2832906"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2017.08.013"},{"key":"e_1_2_2_48_1","volume-title":"Proc. Symposium on Geometry Processing. 33--37","author":"Wardetzky M.","unstructured":"M. Wardetzky , S. Mathur , F. K\u00e4lberer , and E. Grinspun . 2007. Discrete Laplace operators: no free lunch . In Proc. Symposium on Geometry Processing. 33--37 . M. Wardetzky, S. Mathur, F. K\u00e4lberer, and E. Grinspun. 2007. Discrete Laplace operators: no free lunch. In Proc. Symposium on Geometry Processing. 33--37."},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024158"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3272127.3275088","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3272127.3275088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:44:05Z","timestamp":1750207445000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3272127.3275088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,4]]},"references-count":48,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12,31]]}},"alternative-id":["10.1145\/3272127.3275088"],"URL":"https:\/\/doi.org\/10.1145\/3272127.3275088","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,4]]},"assertion":[{"value":"2018-12-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}