smawk: Linear time row minima for totally monotone matrices
This implements the SMAWK algorithm by Peter Shor, Shlomo Moran, Alok Aggarwal, Robert Wilber and Maria Klawe for finding the minimum value in each row of an implicitly defined totally monotone matrix.
This has many applications in computational geometry, such as finding the farthest point from each point in a convex polygon, finding optimal enclosing polygon. It can also be used to implement paragraph line breaking in a manner analogous to Knuth and Platt, but in linear time. It also has uses in RNA secondary structure prediction, various sequence alignment problems, construction of prefix codes, image thresholding, etc.
[Skip to Readme]
|Dependencies||base (>=4.11 && <5), primitive (>=0.7 && <0.8), semigroupoids (>=5 && <6), transformers (>=0.5.5 && <0.6) [details]|
|License||(BSD-2-Clause OR Apache-2.0)|
|Copyright||Copyright (c) 2019 Edward Kmett|
|Maintainer||Edward Kmett <firstname.lastname@example.org>|
|Source repo||head: git clone https://github.com/ekmett/codex(smawk)|
|Uploaded||by EdwardKmett at 2021-03-24T02:25:35Z|
|Downloads||99 total (7 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]