Conference paper
Convergence properties of multi-dimensional stack filters
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990
Two algorithms are presented and analyzed, which compute the distance between any pair of leaves of a complete tree. The first algorithm is quite efficient, running in time 0(log2 distance) on a uniform-cost RAM. The second algorithm is somewhat less efficient, though it too runs on a uniform-cost RAM in time O(log2 distance); it is presented mainly because its validity depends on an interesting numerological descriptor of complete trees. © 1980, Taylor & Francis Group, LLC
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
Charles A Micchelli
Journal of Approximation Theory