stream order

Conn Copas cvc at itd.dsto.gov.au
Tue May 2 08:00:00 EDT 1995


aeger??at?May?1??95?02?22?37?pm at bnr.ca>
content-type: text/plain; charset=US-ASCII
organization: University of Illinois at Urbana
mime-version: 1.0
reply-to: grassu-list at max.cecer.army.mil
newsgroups: info.grass.user
originator: daemon at ux1.cso.uiuc.edu


Stefan writes:

"Sorry for posting this to you directly but my NNTP server does not allow
posting for some reason. Straem ordering is not a trivial thing to do from a
programming point of view. There was a fortran program listed in ... "

At the risk of starting a tedious controversy over programming languages, I
would argue that stream ordering is only daunting if one feels obliged to
seek an algorithmic solution via imperative languages. If however, one is
willing to employ recursion and backtracking, then I would hazard a guess and
say that the task could be done in less than a page of logic programming code.
OK, I know that interpreted languages don't run fast, but then, last time I
looked, most of the Grass code which involves serious search algorithms
doesn't run particularly fast either. It is interesting that a number of GIS
functions, such as network analysis and raster-to-vector conversion, are
textbook cases of logic programming problems.

-- 
Conn V Copas
Information Technology Division
Defence Science and Technology Organisation
PO Box 1500
Salisbury            tel: +61 (0)8 25 95349
SA  5108             fax: +61 (0)8 25 96781
Australia       e-mail: cvc at itd.dsto.gov.au
-------------------------------------------          





More information about the grass-user mailing list