Quad-mesh based isogonal nets and computational design

We propose a quad-mesh-based framework for discrete isogonal nets using checkerboard patterns with inscribed parallelograms derived from quad meshes. By controlling the angles, similarity, or congruence of these parallelograms, we obtain three classes of isogonal nets on diagonal or control meshes. These nets admit simple explicit representations, enable diverse shape exploration related to conformal mappings with preserved pattern shapes, and are formulated using explicit, at-most-quadratic constraints for numerical computation and optimization. The third class serves as a discrete model of developable surfaces, grounded in our analysis of smooth isogonal Chebyshev nets and verified through discrete differential geometric quantities. We demonstrate the effectiveness of the three proposed nets through pattern designs for shell structures and interactive paper-cutting models, both fabricated with repetitive similar elements.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Graphics
Published
2026-11-09
DOI
https://doi.org/10.1145/3842568
Primary Topic
Computational Geometry and Mesh Generation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Quad-mesh based isogonal nets and computational design

Hui Wang, Yongxiang Tan
ACM Transactions on Graphics
Computational Geometry and Mesh Generation
article

Quad-mesh based isogonal nets and computational design

Hui Wang, Yongxiang Tan
article en

Abstract

We propose a quad-mesh-based framework for discrete isogonal nets using checkerboard patterns with inscribed parallelograms derived from quad meshes. By controlling the angles, similarity, or congruence of these parallelograms, we obtain three classes of isogonal nets on diagonal or control meshes. These nets admit simple explicit representations, enable diverse shape exploration related to conformal mappings with preserved pattern shapes, and are formulated using explicit, at-most-quadratic constraints for numerical computation and optimization. The third class serves as a discrete model of developable surfaces, grounded in our analysis of smooth isogonal Chebyshev nets and verified through discrete differential geometric quantities. We demonstrate the effectiveness of the three proposed nets through pattern designs for shell structures and interactive paper-cutting models, both fabricated with repetitive similar elements.

ACM Transactions on GraphicsVol. 45(6)
Xi'an Jiaotong University (CN)
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon