• Publications
  • Influence
Discrete Dynamic Programming
Dynamic programming is an approach that transforms a multi variable optimization problem into a sequence of single variable optimization problems. Discrete dynamic programming requires us to defineExpand
A note on space filling curves
  • A. J. Cole
  • Mathematics, Computer Science
  • Softw. Pract. Exp.
  • 1 December 1983
TLDR
Recursive procedures for drawing Peano, Hilbert and Sierpinski polygons are discussed. Expand
Direct transformations between sets of integers and hilbert polygons
Explicit mappings from the first 22p integers into the ordered vertices of the pth Hilbert polygon and vice versa are derived. Generalisations of this result are discussed. Algorithms to achieve theExpand
Triplex: A system for interval arithmetic
Triplex is a language which supports interval arithmetic. The interval is represented by a triple. That is, the end points of the interval plus the value that real computer arithmetic wouldExpand
A note on peano polygons and gray codes
Explicit mappings from the first n2p base n Gray code integers into the ordered vertices of the pth Peano polygon and vice versa are derived. The result is generalised to r-dimensional PeanoExpand
...
1
2
3
4
...