Validation and automatic repair of planar partitions using a constrained triangulation

Photogrammetrie, Fernerkundung, Geoinformation

Volumn 2012, Issue 5, 2012, Pages 613-630

  Ohori, Ken Arroyo ^a   Ledoux, Hugo ^a   Meijers, Martijn ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Planar partition; Polygonal coverage; Repair; Topological data structure; Triangulation

Indexed keywords

EID: 84868035098     PISSN: 14328364     EISSN: None     Source Type: Journal    
DOI: 10.1127/1432-8364/2012/0143     Document Type: Conference Paper

References (43)

1. SPATIAL, 2012: www.1spatial.com (24.5.2012).
2. AMENTA, N., CHOI, S. & ROTE, G., 2003: Incremental constructions con BRIO. - 19th Annual Symposium on Computational Geometry: 211-219, ACM Press.
3. ARCGIS, 2012: www.esri.com/software/arcgis/index.html (24.5.2012).
4. BADAWY, W.M. & AREF, W.G., 1999: On local heuristics to speed up polygon-polygon intersection tests. - 7th ACM International Symposium on Advances in Geographic Information Systems: 97-102, ACM Press.
5. BADER, M. & WEIBEL, R., 1997: Detecting and resolving size and proximity conflicts in the generalization of polygonal maps. - 18th International Cartographic Conference: 1525-1532, Stockholm.
6. BLANDFORD, D.K., BLELLOCH, G.E., CARDOZE, D.E. & KADOW, C., 2005: Compact representations of simplicial meshes in two and three dimensions - International Journal of Computational Geometry and Applications 15 (1): 3-24. (Pubitemid 40550645)
7. CGAL, 2012: Computational Geometry Algorithms Library: www.cgal.org/(24.5.2012).
8. CLARKSON, K.L.,MEHLHORN, K. & SEIDEL, R. 1992: Four results on randomized incremental constructions - FINKEL, A. & JANTZEN, M. (eds.): 9th Annual Symposium on Theoretical Aspects of Computer Science 577: 461-474, Lecture Notes in Computer Science, Springer.
9. CORINE, 2000: www.eea.europa.eu/data-and-maps/data/corine-land-cover- 2000-clc2000-seamlessvector-database (24.5.2012).
10. DE BERG, M., HALPERIN, D. & OVERMARS, M. 2007: An intersection-sensitive algorithm for snap rounding. - Computational Geometry 36 (3): 159-165. (Pubitemid 44821973)
11. DE BERG, M., VAN KREVELD, M., OVERMARS, M. & SCHWARZKOPF, O., 2008: Computational Geometry: Algorithms and Applications. - 3rd ed., Springer.
12. ESRI, 1998: Shapefile technical description. -White paper, Esri.
13. FACELLO, M.A., 1995: Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions. - Computer Aided Geometric Design 12 (4): 349-370.
14. FME, 2012:www.safe.com (24.5.2012).
15. GDAL, 2012: gdal.org/org (11.8.2012)
16. GEOS, 2012: Geometry Engine Open Source. -http://trac.osgeo.org/geos/(24. 5.2012).
17. GRASS, 2012: http://grass.osgeo.org (24.5.2012).
18. GTS, 2006: GTS Library Reference Manual, gts.sourceforge.net/reference/ book1.html (24.5.2012).
19. GUIBAS, L. & STOLFI, J., 1985: Primitives for the manipulation of general subdivisions and the computation of Voronoi. - ACM Transactions on Graphics 4 (2): 74-123.
20. HOBBY, J.D., 1999: Practical segment intersection with finite precision output. - Computational Geometry 13 (4): 199-214. (Pubitemid 129550155)
21. HOFFMANN, C.M.,HOPCROFT, J.E. & KARASICK, M.S., 1988: Towards implementing robust geometric computations. - 4th Annual Symposium on Computational Geometry: 106-117.
22. INSPIRE, 2009: D2.5: Generic conceptual model, version 3.2. - Technical report, Drafting Team "Data Specifications", http://inspire.jrc.ec. europa.eu/documents/Data-Specifications/D2.5-v3.2.pdf, (24.5.2012).
23. ISO, 2003: ISO 19107, Geographic information -Spatial schema.
24. KIRKPATRICK, D., SNOEYINK, J. & SPECKMANN, B., 2002: Kinetic collision detection for simple polygons - International Journal of Computational Geometry and Applications 12 (1-2): 3-27.
25. LAURINI, R. & MILLERET-RAFFORT, F., 1994: Topological reorganization of inconsistent geographical databases: A step towards their certification - Computers & Graphics 18 (6): 803-813.
26. LEDOUX, H. & MEIJERS, M., 2010: Validation of planar partitions using constrained triangulations - Joint International Conference on Theory, Data Handling and Modelling in GeoSpatial Information Science: 51-55, Hong Kong.
27. LEDOUX, H., OHORI, K.A. & MEIJERS, M., 2012: Automatically repairing invalid polygons with a constrained triangulation. - 15th AGILE International Conference on Geographic Information Science.
28. LIU, Y. & SNOEYINK, J., 2006: Faraway point: A sentinel point for Delaunay computation. - International Journal of Computational Geometry and Applications 18 (4): 343-355.
29. MARGALIT, A. & KNOTT, G.D., 1989: An algorithm for computing the union, intersection or difference of two polygons, Computers & Graphics 13 (2): 167-183. (Pubitemid 20621088)
30. MÜCKE, E.P., SAIAS, I. & ZHU, B., 1999: Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations - Computational Geometry. - Theory and Applications 12: 63-83. (Pubitemid 129550135)
31. OGC, 2006: OpenGIS Implementation Specification for Geographic Information -Simple feature access - Part 1: Common architecture, 1.2.0 ed.
32. PLÜMER, L. & GRÖGER, G., 1997: Achieving integrity in geographic information systems - maps and nested maps. - GeoInformatica 1 (4): 345-367. (Pubitemid 127507524)
33. POSTGIS, 2012: http://postgis.refractions.net/(24.5.2012).
34. RIVERO, M. & FEITO, F.R., 2000: Boolean operations on general planar polygons. - Computers & Graphics 24 (6): 881-896. (Pubitemid 32034356)
35. SCHIRRA, S., 1997: Precision and Robustness in Geometric Computations. - Algorithmic Foundations of Geographic Information 9: 255-287, Lecture Notes in Computer Science, Springer.
36. SHAMOS, M.I. & HOEY, D., 1976: Geometric intersection problems. - IEEE, FOCS: 208-215.
37. SHEWCHUK, J.R., 1997a: Delaunay Refinement Mesh Generation. - PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburg.
38. SHEWCHUK, J.R., 1997b: Adaptive precision floating-point arithmetic and fast robust geometric predicates. - Discrete & Computational Geometry 18: 305-363.
39. SI, H., 2008: Three Dimensional Boundary Conforming Delaunay Mesh Generation. - PhD thesis, Technische Universität Berlin.
40. TOMLIN, C.D., 1994: Map algebra: One perspective - Landscape and Urban Planning 30 (1-2): 3-12.
41. VAN OOSTEROM, P., QUAK, W. & TIJSSEN, T., 2004: About invalid, valid and clean polygons. -FISHER, P.F. (ed.): Developments in Spatial Data Handling. - 11th International Symposium on Spatial Data Handling: 1-16.
42. VAN ROESSEL, J.W., 1991: A new approach to planesweep overlay: Topological structuring and linesegment classification. - Cartography and Geographic Information Science 18 (1): 49-67.
43. VIVID SOLUTIONS, 2012: Java Topology Suite. -http://www.vividsolutions. com/jts/jtshome.htm (24.5.2012).