Comparing two sets of polygons

International Journal of Geographical Information Science

Volumn 17, Issue 5, 2003, Pages 431-443

  Gomboši, Matej ^a   Žalik, Borut ^a   Krivograd, Sebastian ^a  

^a UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; CADASTRE; GIS; POLYGON;

EID: 0037593639     PISSN: 13658816     EISSN: None     Source Type: Journal    
DOI: 10.1080/1365881031000072627     Document Type: Article

References (12)

1. BENTLEY, J., WEIDE, B., and ANDREW, C., 1980, Optimal expected-time algorithms for the closest point problems. ACM Transaction on Mathematical Software, 6, 563-580.
2. BROBST, S., GRANT, S., and THOMPSON, F., 1999, Partitioning very large database tables with Oracle8. Oracle Magazine, 2, 123-126, http://www.esri.com/library/whitepapers/pdfs/ shapefile.pdf
3. FANG, T., and PIEGL, L., 1993, Delaunay Triangulation using a uniform grid. IEEE Computer Graphics & Applications, 3, 36-47.
4. FUJIMOTO, A., TANAKA, T., and IWATA, K., 1986, ARTS: Accelerated Ray-Tracing System. IEEE Computer Graphics & Applications, 1, 65-83.
5. HOFFMAN, C., 1989, Geometric & Solid Modelling. An Introduction (San Mateo: Morgan Kaufman). http://www.xs4all.nl/~kholwerd/bool.html
6. MORTENSON, M., 1985, Geometric Modelling (New York: John Wiley).
7. O'ROURKE, J., 1993, Computational Geometry in C (Cambridge: Cambridge University Press).
8. PREPARATA, F., and SHAMOS, M., 1985, Computational Geometry: An Introduction (New York: Springer).
9. SAMET, H., 1989, The Design and Analysis of Spatial Data Structures (Reading: Addison Wesley).
10. SAMET, H., 1990, Applications of Spatial Data Structures (Reading: Addison Wesley).
11. VATTI, B., 1992, A generic solution to polygon clipping. Communications of the ACM, 7, 56-63.
12. ŽALIK, B., 2001, Merging a set of polygons. Computers and Graphics, 1, 77-88.