Planar Symmetric Pattern Generation

• URL: http://arxiv.org/abs/2606.02073v1
• Date: Mon, 01 Jun 2026 11:01:48 GMT
• Title: Planar Symmetric Pattern Generation
• Abstract summary: We propose a symmetrization framework for arbitrary planar groups.<n>Our method transforms any 2D continuous representation into a symmetric one while preserving continuity.
• Score: 40.32465897894085
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Generating objects with specific symmetries is essential in various real-world scenarios. However, adapting existing 2D continuous representations to enforce planar group symmetry remains a challenge, as the transformation of non-reflective group elements may disrupt continuity. To overcome this limitation, we propose a symmetrization framework for arbitrary planar groups. Our method transforms any 2D continuous representation into a symmetric one while preserving continuity. We provide the mathematical formulation of this representation, demonstrate its approximation capability for symmetric functions, and detail the construction methodology. We validate our approach through three visual design tasks (pattern design, paper-cutting design and stylized topology design) and one material design task. Experiments confirm that our representation enables effective symmetry control and demonstrate its broader applicability.

Related papers

• SymTRELLIS: Symmetry-Enforced Voxel Latents for 3D Generation [10.616258272621836]
  We present SymTRELLIS, a method that enforces arbitrary finite point group symmetries during the flow-based 3D generation of TRELLIS.2.<n>On a curated benchmark of 266 strictly symmetric objects, SymTRELLIS substantially reduces all symmetry error metrics compared to TRELLIS.2, Hunyuan3D-2.1, and TripoSG.
  arXiv  Detail & Related papers  (2026-06-02T18:11:41Z)
• Intrinsic Task Symmetry Drives Generalization in Algorithmic Tasks [4.075225553131796]
  We identify a consistent three-stage training dynamic underlying grokking.<n>We show that generalization emerges during the symmetry acquisition phase.<n>We introduce a symmetry-based diagnostic that anticipates the onset of generalization and propose strategies to accelerate it.
  arXiv  Detail & Related papers  (2026-03-02T15:19:24Z)
• Global Symmetry and Orthogonal Transformations from Geometrical Moment $n$-tuples [0.304585143845864]
  This paper employs geometrical moments to identify symmetries and estimate transformations, including rotations and mirror transformations, for objects centered at the frame origin.<n>A comprehensive methodology is developed to obtain these functions in n-dimensional space, specifically moment ( n )-tuples.<n> Extensive validation tests are conducted on both 2D and 3D objects to ensure the robustness and reliability of the proposed approach.
  arXiv  Detail & Related papers  (2026-02-08T00:07:11Z)
• CSMCIR: CoT-Enhanced Symmetric Alignment with Memory Bank for Composed Image Retrieval [54.15776146365823]
  Composed Image Retrieval (CIR) enables users to search for target images using both a reference image and manipulation text.<n>We propose CSMCIR, a unified representation framework that achieves efficient query-target alignment through three synergistic components.
  arXiv  Detail & Related papers  (2026-01-07T09:21:38Z)
• Axis-level Symmetry Detection with Group-Equivariant Representation [48.813587457507786]
  Recent heatmap-based approaches can localize potential regions of symmetry axes but often lack precision in identifying individual axes.<n>We propose a novel framework for axis-level detection of the two most common symmetry types-reflection and rotation.<n>Our method achieves state-of-the-art performance, outperforming existing approaches.
  arXiv  Detail & Related papers  (2025-08-14T15:26:53Z)
• Generalized Linear Mode Connectivity for Transformers [87.32299363530996]
  A striking phenomenon is linear mode connectivity (LMC), where independently trained models can be connected by low- or zero-loss paths.<n>Prior work has predominantly focused on neuron re-ordering through permutations, but such approaches are limited in scope.<n>We introduce a unified framework that captures four symmetry classes: permutations, semi-permutations, transformations, and general invertible maps.<n>This generalization enables, for the first time, the discovery of low- and zero-barrier linear paths between independently trained Vision Transformers and GPT-2 models.
  arXiv  Detail & Related papers  (2025-06-28T01:46:36Z)
• Kennedy-Tasaki transformation and non-invertible symmetry in lattice models beyond one dimension [2.069923346979304]
  We give an explicit operator representation of Kramers-Wannier duality transformation in higher-dimensional subsystem symmetric models. We construct the Kennedy-Tasaki transformation that maps subsystem symmetry-protected topological phases to spontaneous subsystem symmetry breaking phases.
  arXiv  Detail & Related papers  (2024-02-14T19:00:19Z)
• Oracle-Preserving Latent Flows [58.720142291102135]
  We develop a methodology for the simultaneous discovery of multiple nontrivial continuous symmetries across an entire labelled dataset. The symmetry transformations and the corresponding generators are modeled with fully connected neural networks trained with a specially constructed loss function. The two new elements in this work are the use of a reduced-dimensionality latent space and the generalization to transformations invariant with respect to high-dimensional oracles.
  arXiv  Detail & Related papers  (2023-02-02T00:13:32Z)
• Recurrently Estimating Reflective Symmetry Planes from Partial Pointclouds [5.098175145801009]
  We present an alternative novel encoding that instead slices the data along the height dimension and passes it sequentially to a 2D convolutional recurrent regression scheme. We show that our approach has an accuracy comparable to state-of-the-art techniques on the task of planar reflective symmetry estimation on full synthetic objects.
  arXiv  Detail & Related papers  (2021-06-30T15:26:15Z)
• Weakly But Deeply Supervised Occlusion-Reasoned Parametric Layouts [87.370534321618]
  We propose an end-to-end network that takes a single perspective RGB image of a complex road scene as input, to produce occlusion-reasoned layouts in perspective space. The only human annotations required by our method are for parametric attributes that are cheaper and less ambiguous to obtain. We validate our approach on two public datasets, KITTI and NuScenes, to achieve state-of-the-art results with considerably lower human supervision.
  arXiv  Detail & Related papers  (2021-04-14T09:32:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.