๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Linear-time border-tracing algorithms for quadtrees

โœ Scribed by Robert E. Webber; Hanan Samet


Book ID
105301261
Publisher
Springer
Year
1992
Tongue
English
Weight
884 KB
Volume
8
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Linear time distance transforms for quad
โœ Clifford A. Shaffer; Quentin F. Stout ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science โš– 1021 KB

Linear time algorithms are given for computing the chessboard distance transform for both pointer-based and linear quadtree representations. Comparisons between algorithmic styles for the two representations are made. Both versions of the algorithm consist of a pair of tree traversals. 0 I991 Academ

Linear time algorithms for linear progra
โœ E.A. Galperin ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 557 KB

A linear time algorithm for the solution of asymmetric large scale linear programming problems is presented. (~) 1999 Elsevier Science Ltd. All rights reserved.