The chords' problem

Theoretical Computer Science

Volumn 282, Issue 2, 2002, Pages 319-336

  Daurat, Alain ^a   Gérard, Yan ^a   Nivat, Maurice ^b  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Chords' multiset; Minkowski's sum; Symmetrical polynomials

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

POLYNOMIAL ALGORITHMS; SYMMETRICAL POLYNOMIALS;

COMPUTER SCIENCE;

EID: 0037054423     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00073-1     Document Type: Conference Paper

References (5)

1. Multiplicities of interpoints distances in finite planar sets
2. Intervertex ditances in convex polygons
3. Factorizing polynomials with rational coefficients
4. Reconstructing sets from interpoint distance
5. An exponential example for a partial digest mapping algorithm