Rearranging a sequence of points onto a line
From MaRDI portal
(Redirected from Publication:2144451)
Recommendations
Cites work
- scientific article; zbMATH DE number 1424289 (Why is no real title available?)
- scientific article; zbMATH DE number 6472585 (Why is no real title available?)
- An efficient algorithm for determining the convex hull of a finite planar set
- Applications of Parametric Searching in Geometric Optimization
- Computational geometry. Algorithms and applications.
- Computing the width of a set
- Curve fitting by segmented straight lines
- Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming
- Efficient randomized algorithms for some geometric optimization problems
- Farthest line segment Voronoi diagrams
- Geometric applications of a randomized optimization technique
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- Linear-time algorithms for the farthest-segment Voronoi diagram and related tree structures
- Slowing down sorting networks to obtain faster sorting algorithms
- Sorting in \(c \log n\) parallel steps
- The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
This page was built for publication: Rearranging a sequence of points onto a line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144451)