Algorithms for a simple point placement problem
From MaRDI portal
Recommendations
- Approximation algorithms for aligning points
- Approximation algorithms for aligning points
- Algorithms for the orthographic-\(n\)-point problem
- Optimal algorithm for a special point-labeling problem
- scientific article; zbMATH DE number 2089214
- Algorithms for the solution of the problem of placing rectangles in a rectangular area
- An Algorithm for the p-Center Problem in the Plane
- Efficient expected-case algorithms for planar point location
- A Simplicial Algorithm for Stationary Point Problems on Polytopes
Cited in
(11)- Algorithms of placing recovery points
- Point placement on the line by distance data.
- Construction of component tapes for radial placement machines
- Randomized vs. deterministic distance query strategies for point location on the line
- Fitting points on the real line and its application to RH mapping
- scientific article; zbMATH DE number 569959 (Why is no real title available?)
- Fitting points on the real line and its application to RH mapping
- RECONSTRUCTING THE SPATIAL ORDER OF CHROMOSOMES BY A CONVEX HULL ALGORITHM
- Three paths to point placement
- More on generalized jewels and the point placement problem
- Anonymous self-stabilising localisation via spatial population protocols
This page was built for publication: Algorithms for a simple point placement problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2728891)