References

1

B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. In Foundations of Computer Science - 29th Annual Symposium, White Plains, NY, Oct 1988.

2

W. R. Franklin. Calculating map overlay polygon' areas without explicitly calculating the polygons -- implementation. In 4th International Symposium on Spatial Data Handling, pages 151-160, Zürich, 23-27 July 1990.

3

W. R. Franklin. Compressing elevation data. In Fourth International Symposium on Large Spatial Databases - SSD '95. Portland, Maine, USA, 6-9 Aug 1995.

4

W. R. Franklin and M. S. Kankanhalli. Volumes from overlaying 3-D triangulations in parallel. In D. Abel and B. Ooi, editors, Advances in Spatial Databases: Third Intl. Symp., SSD'93, volume 692 of Lecture Notes in Computer Science, pages 477-489. Springer-Verlag, June 1993.

5

W. R. Franklin and C. Ray. Higher isn't necessarily better: Visibility algorithms and experiments. In T. C. Waugh and R. G. Healey, editors, Advances in GIS Research: Sixth International Symposium on Spatial Data Handling, pages 751-770, Edinburgh, 5-9 Sept 1994. Taylor & Francis.

6

W. R. Franklin and A. Said. Lossy compression of elevation data. (submitted for publication, available from: ftp://ftp.cs.rpi.edu:/pub/franklin/compress/lossy*.% -ps.gz), aug 1995.

7

C. K. Ray. Representing Visibility for Siting Problems. PhD thesis, Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute, May 1994.

Q: What's the difference between a computer salesman and an auto salesman?
A: The auto salesman probably knows how to drive.

Tue Mar 19 22:08:28 EST 1996 , /dept/ecse/compeom/ho5 .tex