Arbitrary Polygon Oscillator: Generalizing Polygonal Synthesis to Arbitrary Shapes, Morphing, and Three-Dimensional Polyhedra

• URL: http://arxiv.org/abs/2608.24726v1
• Date: Tue, 25 Aug 2026 15:38:41 GMT
• Title: Arbitrary Polygon Oscillator: Generalizing Polygonal Synthesis to Arbitrary Shapes, Morphing, and Three-Dimensional Polyhedra
• Abstract summary: Existing formulations operate on regular, parametrically defined polygons.<n>This paper generalizes polygonal synthesis around a unified arc-length engine.<n>The system runs in RNBO (Cycling'74) with a geometry caching strategy that avoids per-sample recomputation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Polygonal synthesis generates audio by traversing the perimeter of a polygon with a phasor; prior work uses a constant angular velocity, whereas the proposed system adopts constant arc-length (perimeter) velocity. Existing formulations operate on regular, parametrically defined polygons, producing smooth timbral transitions within a single family of shapes. This paper generalizes polygonal synthesis around a unified arc-length engine: vertex data of any origin feed the same DSP pipeline. First, we adapt the oscillator to accept arbitrary vertex configurations from an external buffer, opening the possibility for a broad class of closed polygons -- regular, irregular, or star-shaped -- to function as a waveform generator. Second, a hybrid interpolation algorithm enables smooth morphing between polygons with unequal vertex counts, passing through intermediate shapes that have no parametric description. Third, we extend the paradigm to three dimensions: a convex polyhedron rotated about three axes is sliced by a fixed horizontal plane, and the resulting cross-section yields a continuously variable polygon controlled by the solid's orientation. The system runs in RNBO (Cycling~'74) with a geometry caching strategy that avoids per-sample recomputation. Antialiasing combines a four-point polyBLAMP correction derived from runtime Bézier tangents with adaptive oversampling, adapting the correction geometrically to general vertex configurations without per-shape analytical derivation.

Related papers

• Deformable Triangle Splatting: Flexible Primitives for Real-Time Radiance Field Rendering [18.633528239379483]
  Recent radiance field methods represent 2D primitives that offer surface alignment and efficientization.<n>We introduce Deformable Splatting Triangle, which augments each scene with versatility.
  arXiv  Detail & Related papers  (2026-07-24T16:08:26Z)
• SCOPE: Scale-Consistent One-Pass Estimation of 3D Geometry [69.89196162649091]
  SCOPE (Scale-Consistent One-Pass Estimation of 3D Geometry) is a novel approach for estimating 3D geometry from extended monocular video sequences.<n>Our approach generates affine-invariant 3D point maps with shared parameters across entire sequences, enabling consistent scale-invariant representations.
  arXiv  Detail & Related papers  (2026-06-19T10:23:25Z)
• Differentiable Convex Polyhedra Optimization from Multi-view Images [29.653374825428614]
  This paper presents a novel approach for the differentiable rendering of convex polyhedra. It addresses the limitations of recent methods that rely on implicit field supervision.
  arXiv  Detail & Related papers  (2024-07-22T14:53:29Z)
• Spectral Meets Spatial: Harmonising 3D Shape Matching and Interpolation [50.376243444909136]
  We present a unified framework to predict both point-wise correspondences and shape between 3D shapes. We combine the deep functional map framework with classical surface deformation models to map shapes in both spectral and spatial domains.
  arXiv  Detail & Related papers  (2024-02-29T07:26:23Z)
• PolyDiff: Generating 3D Polygonal Meshes with Diffusion Models [15.846449180313778]
  PolyDiff is the first diffusion-based approach capable of directly generating realistic and diverse 3D polygonal meshes. Our model is capable of producing high-quality 3D polygonal meshes, ready for integration into downstream 3D.
  arXiv  Detail & Related papers  (2023-12-18T18:19:26Z)
• Geometrically Consistent Partial Shape Matching [50.29468769172704]
  Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics. An often neglected but essential property of matching geometrics is consistency. We propose a novel integer linear programming partial shape matching formulation.
  arXiv  Detail & Related papers  (2023-09-10T12:21:42Z)
• CCuantuMM: Cycle-Consistent Quantum-Hybrid Matching of Multiple Shapes [62.45415756883437]
  Jointly matching multiple, non-rigidly deformed 3D shapes is a challenging, $mathcalNP$-hard problem. Existing quantum shape-matching methods do not support multiple shapes and even less cycle consistency. This paper introduces the first quantum-hybrid approach for 3D shape multi-matching.
  arXiv  Detail & Related papers  (2023-03-28T17:59:55Z)
• A Scalable Combinatorial Solver for Elastic Geometrically Consistent 3D Shape Matching [69.14632473279651]
  We present a scalable algorithm for globally optimizing over the space of geometrically consistent mappings between 3D shapes. We propose a novel primal coupled with a Lagrange dual problem that is several orders of magnitudes faster than previous solvers.
  arXiv  Detail & Related papers  (2022-04-27T09:47:47Z)
• Hybrid Trilinear and Bilinear Programming for Aligning Partially Overlapping Point Sets [85.71360365315128]
  In many applications, we need algorithms which can align partially overlapping point sets are invariant to the corresponding corresponding RPM algorithm. We first show that the objective is a cubic bound function. We then utilize the convex envelopes of trilinear and bilinear monomial transformations to derive its lower bound. We next develop a branch-and-bound (BnB) algorithm which only branches over the transformation variables and runs efficiently.
  arXiv  Detail & Related papers  (2021-01-19T04:24:23Z)
• Instant recovery of shape from spectrum via latent space connections [33.83258865005668]
  We introduce the first learning-based method for recovering shapes from Laplacian spectra. Given an auto-encoder, our model takes the form of a cycle-consistent module to map latent vectors to sequences of eigenvalues. Our data-driven approach replaces the need for ad-hoc regularizers required by prior methods, while providing more accurate results at a fraction of the computational cost.
  arXiv  Detail & Related papers  (2020-03-14T00:48:34Z)
• PUGeo-Net: A Geometry-centric Network for 3D Point Cloud Upsampling [103.09504572409449]
  We propose a novel deep neural network based method, called PUGeo-Net, to generate uniform dense point clouds. Thanks to its geometry-centric nature, PUGeo-Net works well for both CAD models with sharp features and scanned models with rich geometric details.
  arXiv  Detail & Related papers  (2020-02-24T14:13: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.