The chords' problem

DOI10.1016/S0304-3975(01)00073-1MaRDI QIDQ1603719zbMATH OpenOpenAlexFDO

Authors Alain Daurat, M. Nivat, 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)

Recommendations

• scientific article; zbMATH DE number 2209734
• Some necessary clarifications about the chords' problem and the partial digest problem
• Reconstruction up to isometries
• On determining non-isotopic configurations of points on a circle
• RECONSTRUCTING THE SPATIAL ORDER OF CHROMOSOMES BY A CONVEX HULL ALGORITHM

Cites work

• scientific article; zbMATH DE number 2209734 (Why is no real title available?)
• Factoring polynomials with rational coefficients
• Intervertex distances in convex polygons
• Multiplicities of interpoint distances in finite planar sets

Cited in

(9)

• scientific article; zbMATH DE number 2209734 (Why is no real title available?)
• The complexity of minimum difference cover
• The minimum distance superset problem: formulations and algorithms
• scientific article; zbMATH DE number 4141985 (Why is no real title available?)
• Covariogram of non-convex sets
• On the complexity of constructing Golomb rulers
• The chords theorem recalled to life at the turn of the eighteenth century
• Some necessary clarifications about the chords' problem and the partial digest problem
• GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA

This page was built for publication: The chords' problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603719)