Rearranging a sequence of points onto a line
From MaRDI portal
Publication:2144451
DOI10.1016/J.COMGEO.2022.101887zbMATH Open1502.68296OpenAlexW3204290128WikidataQ114195510 ScholiaQ114195510MaRDI QIDQ2144451FDOQ2144451
Chaeyoon Chung, Sang Won Bae, Jong Min Choi, Sang Duk Yoon, Hee-Kap Ahn, Taehoon Ahn
Publication date: 13 June 2022
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2022.101887
Recommendations
Cites Work
- An efficient algorithm for determining the convex hull of a finite planar set
- Computational geometry. Algorithms and applications.
- Farthest line segment Voronoi diagrams
- Slowing down sorting networks to obtain faster sorting algorithms
- Sorting in \(c \log n\) parallel steps
- 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
- Curve Fitting by Segmented Straight Lines
- Efficient randomized algorithms for some geometric optimization problems
- Applications of Parametric Searching in Geometric Optimization
- Title not available (Why is that?)
- Computing the width of a set
- Title not available (Why is that?)
- Geometric applications of a randomized optimization technique
- Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming
- The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
Cited In (1)
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)