Skip to content
DraconiticResearch
Search Sources API
182,460 studies31 sourcesUpdated 25 min ago
PreprintarXiv licencearXiv

Identification of generic polygonal domains by integral-geometric invariants

Abstract

We study a reconstruction problem of planar domains from non-local integral-geometric invariants. We show that a generic polygonal domain, not necessarily convex, is uniquely determined, up to Euclidean isometry, by the interpoint distance distribution (IDD), which, for convex domains, is equivalent to the chord length distribution. Using a boundary representation of the Riesz energy function, we replace the IDD of the domain by an equivalent boundary IDD weighted by the scalar product of the outer unit normals, which we call ν-weighted IDD of the boundary. It enables us to reduce the problem to a one-dimensional problem. By analyzing jumps and blow-up terms of the second and third derivatives of the ν-weighted IDD of the boundary, we recover the side lengths, their cyclic incidence, and the exterior angles of the polygon. This can be considered as extending Waksman's classical generic reconstruction theorem for convex polygons to non-convex setting, as well as extending generic polygonal reconstruction from directional covariogram data to a one-dimensional invariant in which directional information has been integrated out.

Related

  1. Graph Models of Cultural M-Grams: Polygonal Number Networks, Topological Index Partitions, and Geometric Transformations
    Ümit Sarp
    MathematicsPeer-reviewedCC BY 4.0Geometry & topologyCrossref
  2. A Finite-Geometric Obstruction and a Polytopal Separation of Buchstaber Invariants
    Suyoung Choi, Hyeontae Jang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  3. Exact Generic Exponents of Approximation for the Action of the Integral Special Linear Group on the Torus
    Faustin Adiceam, Régis Aolo
    arXivPreprintCC BY-NC-ND 4.0Full textAlgebra & number theoryDynamical systemsarXiv
  4. Mori dream fibers and the geometric generic fiber
    Dae-Won Lee, Masaru Nagaoka
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  5. Integral Invariants of Vasudeva Murthy's Relaxation Systems: Analysis and Numerical Validation
    Sudipta Sahu, Rathan Samala
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
BibTeX
@misc{ohara2026identification,
  title = {{Identification of generic polygonal domains by integral-geometric invariants}},
  author = {Jun O'Hara},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2608.02288},
  eprint = {2608.02288},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.02288},
}
RIS
TY  - UNPB
TI  - Identification of generic polygonal domains by integral-geometric invariants
AU  - Jun O'Hara
PY  - 2026
DA  - 2026/09/16
PB  - arXiv
DO  - 10.48550/arxiv.2608.02288
UR  - https://arxiv.org/abs/2608.02288
AB  - We study a reconstruction problem of planar domains from non-local integral-geometric invariants. We show that a generic polygonal domain, not necessarily convex, is uniquely determined, up to Euclidean isometry, by the interpoint distance distribution (IDD), which, for convex domains, is equivalent to the chord length distribution. Using a boundary representation of the Riesz energy function, we replace the IDD of the domain by an equivalent boundary IDD weighted by the scalar product of the outer unit normals, which we call ν-weighted IDD of the boundary. It enables us to reduce the problem to a one-dimensional problem. By analyzing jumps and blow-up terms of the second and third derivatives of the ν-weighted IDD of the boundary, we recover the side lengths, their cyclic incidence, and the exterior angles of the polygon. This can be considered as extending Waksman's classical generic reconstruction theorem for convex polygons to non-convex setting, as well as extending generic polygonal reconstruction from directional covariogram data to a one-dimensional invariant in which directional information has been integrated out.
ER  -