Nelder's labeling algorithm

Nelder's labeling algorithm

nelder(dmin, dmax, m,
    Q = c(1, 1.2, 1.6, 2, 2.5, 3, 4, 5, 6, 8, 10))

Arguments

dmin

minimum of the data range

dmax

maximum of the data range

m

number of axis labels

Q

set of nice numbers

Value

vector of axis label locations

Author

Justin Talbot justintalbot@gmail.com

References

Nelder, J. A. (1976) AS 96. A Simple Algorithm for Scaling Graphs, Journal of the Royal Statistical Society. Series C., pp. 94-96.