The chords' problem

DOI10.1016/S0304-3975(01)00073-1zbMath0996.68214OpenAlexW2010072402MaRDI QIDQ1603719

Maurice Nivat, Alain Daurat, Yan Gerard

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00073-1

zbMATH Keywords

chords' multisetMinkowski's sumsymmetrical polynomials

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA ⋮ The complexity of minimum difference cover ⋮ The minimum distance superset problem: formulations and algorithms ⋮ COVARIOGRAM OF NON‐CONVEX SETS ⋮ On the complexity of constructing Golomb rulers ⋮ Some necessary clarifications about the chords' problem and the partial digest problem

Cites Work

• Factoring polynomials with rational coefficients
• Multiplicities of interpoint distances in finite planar sets
• Intervertex distances in convex polygons
• Unnamed Item

This page was built for publication: The chords' problem