We need some help

[Wookey]

On Tue 28 Mar, Jos=E9_Luis_Casta=F1eda_Lorenzo wrote:
> We are two Cuban students in Computer science, and our thesis is a
> program that map caves and we need some information about polygonal
> closures algorithms. We try to find some information on internet but
> we can find anything.

Welcome.

> Please if you can help us, we appreciate your help.

There are a couple of resources I am aware of.

By far the best is John Halleck's (unfunished, but still useful) work:
http://www.cc.utah.edu/~nahaj/cave/survey/changes.html
which starts with the basics and principles and describes the
corresponding maths. Some example programs are also provided.

The only other info on-line is a few old (and probably rather outdated)
bits and bobs used in the authouring of survex on the Cave Surveying
Groups site at: http://www.sat.dundee.ac.uk/~arb/surveying/ This gives a
basic reduction algorithm, and some instrument error sums.

The Survex source provides a useful engine for processing data which you
may find useful as either a reference or a starting point. It is the only
existing survey reduction engine that uses co-variance info (apart from
John Halleck's demo code).

You might find some stuff of interest in the Cave Surveying Groups
journals' which are online up to about a year ago.
http://www.chaos.org.uk/survex/cp/index.htm

You might also want to join the Cave surveying Group, as we are keen to
have interested members from all nations. Details are on the web page.

One other resource is the cave-surveying mailing list, which has a more
technical and wider-based readership than the survex mailing list which
you posted to. They are both hosted on the same site.

Wookey
--=20
Aleph One Ltd, Bottisham, CAMBRIDGE, CB5 9BA, UK  Tel (00 44) 1223 811679
work: http://www.aleph1.co.uk/     play: http://www.chaos.org.uk/~wookey/