{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:03:20Z","timestamp":1772283800917,"version":"3.50.1"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2011,7,1]],"date-time":"2011-07-01T00:00:00Z","timestamp":1309478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000147","name":"Division of Civil, Mechanical and Manufacturing Innovation","doi-asserted-by":"publisher","award":["CCF-0811373CMMI-0757106CCF-1011944"],"award-info":[{"award-number":["CCF-0811373CMMI-0757106CCF-1011944"]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0811373CMMI-0757106CCF-1011944"],"award-info":[{"award-number":["CCF-0811373CMMI-0757106CCF-1011944"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2011,7]]},"abstract":"<jats:p>We introduce Hodge-optimized triangulations (HOT), a family of well-shaped primal-dual pairs of complexes designed for fast and accurate computations in computer graphics. Previous work most commonly employs barycentric or circumcentric duals; while barycentric duals guarantee that the dual of each simplex lies within the simplex, circumcentric duals are often preferred due to the induced orthogonality between primal and dual complexes. We instead promote the use of weighted duals (\"power diagrams\"). They allow greater flexibility in the location of dual vertices while keeping primal-dual orthogonality, thus providing a valuable extension to the usual choices of dual by only adding one additional scalar per primal vertex. Furthermore, we introduce a family of functionals on pairs of complexes that we derive from bounds on the errors induced by diagonal Hodge stars, commonly used in discrete computations. The minimizers of these functionals, called HOT meshes, are shown to be generalizations of Centroidal Voronoi Tesselations and Optimal Delaunay Triangulations, and to provide increased accuracy and flexibility for a variety of computational purposes.<\/jats:p>","DOI":"10.1145\/2010324.1964998","type":"journal-article","created":{"date-parts":[[2011,7,26]],"date-time":"2011-07-26T14:17:46Z","timestamp":1311689866000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["HOT"],"prefix":"10.1145","volume":"30","author":[{"given":"Patrick","family":"Mullen","sequence":"first","affiliation":[{"name":"Caltech"}]},{"given":"Pooran","family":"Memari","sequence":"additional","affiliation":[{"name":"Caltech"}]},{"given":"Fernando","family":"de Goes","sequence":"additional","affiliation":[{"name":"Caltech"}]},{"given":"Mathieu","family":"Desbrun","sequence":"additional","affiliation":[{"name":"Caltech"}]}],"member":"320","published-online":{"date-parts":[[2011,7,25]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073238"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2006.870932"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01639.x"},{"key":"e_1_2_2_4_1","volume-title":"Computational Electromagnetism","author":"Bossavit A.","unstructured":"Bossavit, A. 1998. Computational Electromagnetism. Academic Press, Boston."},{"key":"e_1_2_2_5_1","unstructured":"CGAL 2010. Computational Geometry Algorithms Library (release 3.8). http:\/\/www.cgal.org."},{"key":"e_1_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Cheng S.-W. Dey T. K. and Levine J. 2008. Theory of a practical Delaunay meshing algorithm for a large class of domains. In Algorithms Architecture and Information Systems Security B. Bhattacharya S. Sur-Kolay S. Nandy and A. Bagchi Eds. vol. 3 of World Scientific Review 17--41.","DOI":"10.1142\/9789812836243_0002"},{"key":"e_1_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Desbrun M. Kanso E. and Tong Y. 2007. Discrete differential forms for computational modeling. In Discrete Differential Geometry A. Bobenko and P. Schr\u00f6der Eds. Springer.","DOI":"10.1145\/1185657.1185665"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144599352836"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/28905"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1189762.1189766"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","unstructured":"Fisher M. Springborn B. Bobenko A. I. and Schr\u00f6der P. 2006. An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing. In ACM SIGGRAPH Courses 69--74. 10.1145\/1185657.1185668","DOI":"10.1145\/1185657.1185668"},{"key":"e_1_2_2_12_1","unstructured":"Glickenstein D. 2005. Geometric triangulations and discrete Laplacians on manifolds. Arxiv preprint math\/0508188."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855058"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1992"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778856"},{"key":"e_1_2_2_17_1","unstructured":"Lipman Y. and Daubechies I. 2010. Surface Comparison With Mass Transportation. In ArXiv preprint 0912.3488."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559755.1559758"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.09.005"},{"key":"e_1_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Meyer M. Desbrun M. Schr\u00f6der P. and Barr A. H. 2003. Discrete differential-geometry operators for triangulated 2-manifolds. In Visualization and Mathematics III Springer-Verlag H.-C. Hege and K. Polthier Eds. 35--57.","DOI":"10.1007\/978-3-662-05105-4_2"},{"key":"e_1_2_2_21_1","volume-title":"Elements of Algebraic Topology","author":"Munkres J. R.","unstructured":"Munkres, J. R. 1984. Elements of Algebraic Topology. Addison-Wesley."},{"key":"e_1_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Nocedal J. and Wright S. J. 1999. Numerical optimization. Springer Verlag.","DOI":"10.1007\/b98874"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","unstructured":"Okabe A. Boots B. Sugihara K. and Chiu S. N. 2000. Spatial tessellations: Concepts and applications of Voronoi diagrams 2nd ed. Probability and Statistics. Wiley.","DOI":"10.5555\/135734"},{"key":"e_1_2_2_24_1","volume-title":"a comprehensive course","author":"Pedoe D.","unstructured":"Pedoe, D. 1988. Geometry, a comprehensive course, 2nd ed. Dover Publications.","edition":"2"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2006.12.022"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1080\/10586458.1993.10504266"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574375"},{"key":"e_1_2_2_28_1","volume-title":"Proc. of the 11th Int. Meshing Roundtable, 115--126","author":"Shewchuk J.","year":"2002","unstructured":"Shewchuk, J. 2002. What is a Good Linear Element? Interpolation, Conditioning, and Quality Measures. In Proc. of the 11th Int. Meshing Roundtable, 115--126."},{"key":"e_1_2_2_29_1","volume-title":"Proceedings of the 19th International Meshing Roundtable. 335--350","author":"Sieger D.","unstructured":"Sieger, D., Alliez, P., and Botsch, M. 2010. Optimizing voronoi diagrams for polygonal finite element computations. In Proceedings of the 19th International Meshing Roundtable. 335--350."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531381"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/090748214"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71050-9"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1281991.1281995"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10444-005-9008-6"},{"key":"e_1_2_2_35_1","volume-title":"Cochain algebra on manifolds and convergence under refinement. Topology and its Applications 154, 9","author":"Wilson S. O.","year":"1898","unstructured":"Wilson, S. O. 2007. Cochain algebra on manifolds and convergence under refinement. Topology and its Applications 154, 9, 1898--1920."}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2010324.1964998","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2010324.1964998","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2010324.1964998","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:23Z","timestamp":1750244783000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2010324.1964998"}},"subtitle":["Hodge-optimized triangulations"],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["10.1145\/2010324.1964998"],"URL":"https:\/\/doi.org\/10.1145\/2010324.1964998","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7]]},"assertion":[{"value":"2011-07-25","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}