Reconstructing sets from interpoint distances
From MaRDI portal
Recommendations
Cited in
(43)- On the complexity of constructing Golomb rulers
- Lattices with few distances
- A partial digest approach to restriction site mapping
- The chords' problem
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- The minimum distance superset problem: formulations and algorithms
- Point placement on the line by distance data.
- The restriction mapping problem revisited.
- On reconstructing \(n\)-point configurations from the distribution of distances or areas
- The number of clone orderings
- Unassigned distance geometry and molecular conformation problems
- Construction of component tapes for radial placement machines
- The complexity of minimum difference cover
- Randomized vs. deterministic distance query strategies for point location on the line
- Generalized shapes and point sets correspondence and registration
- A point set puzzle revisited
- Some necessary clarifications about the chords' problem and the partial digest problem
- An identity theorem for the Fourier-Laplace transform of polytopes on nonzero complex multiples of rationally parameterizable hypersurfaces
- Shape classification based on interpoint distance distributions
- A new dynamic programming algorithm for the simplified partial digest problem
- On homometric sets in graphs
- Homometry and direct-sum decompositions of lattice-convex sets
- Reconstructing numbers from pairwise function values
- On the reconstruction of planar lattice-convex sets from the covariogram
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- The metric space of limit laws for \(q\)-hook formulas
- A SCALABLE PARALLEL ALGORITHM FOR TURNPIKE PROBLEM
- Quantitative crystal structure descriptors from multiplicative congruential generators
- String reconstruction from substring compositions
- Distance distributions and inverse problems for metric measure spaces
- The simplified partial digest problem: approximation and a graph-theoretic model
- A fast algorithm for the partial digest problem
- Encounter at far point
- Reconstructing a point set from a random subset of its pairwise distances
- The beltway problem over orthogonal groups
- Reconstructing almost all of a point set in \(\mathbb{R}^d\) from randomly revealed pairwise distances
- A scalable optimization algorithm for solving the beltway and turnpike problems with uncertain measurements
- Computational geometric aspects of rhythm, melody, and voice-leading
- Homometric subsets of \(\mathbb{Z}_n\) with cardinality 5: classification and enumeration
- Distinguishing regular polygons, cycle graphs, and circular metric spaces by the distance multiset and magnitude
- Partial digest is hard to solve for erroneous input data
- On the approximability of the simplified partial digest problem
- On the graph turnpike problem
This page was built for publication: Reconstructing sets from interpoint distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5692717)
