Abstract
Ensuring the semantic and topological correctness of spatial data is an important requirement in geographical information systems and spatial database systems in order to preserve spatial data quality and enable correct operation execution. Spatial objects like complex regions are usually represented as an ordered sequence of segments (sequence view) to support and ease the computation of spatial operations by means of plane sweep algorithms. The semantic correctness of such a sequence is usually simply assumed but is not easy to see. In this paper, we present a novel and efficient algorithm to discover the cyclic structure and check for the semantic correctness of the sequence representation of a complex region by determining its cyclic structures (component view) in terms of multiple faces possibly containing holes. The algorithm producing the component view is also interesting for object construction, manipulation, and visualization.
This work was partially supported by the National Science Foundation under grant number NSF-CAREER-IIS-0347574.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Amato, N.M., Goodrich, M.T., Ramos, E.A.: Computing Faces in Segment and Simplex Arrangements. In: ACM Symposium on Theory of Computing, pp. 672–682. ACM Press, New York (1995)
Asano, T., Guibas, L.J., Tokuyama, T.: Walking on an Arrangement Topologically. In: ACM Annual Symp. on Computational Geometry, pp. 297–306. ACM Press, New York (1991)
Balaban, I.J.: An Optimal Algorithm for Finding Segments Intersections. In: ACM Annual Symp. on Computational Geometry, pp. 211–219. ACM Press, New York (1995)
Bentley, J.L., Ottmann, T.: Algorithms for Reporting and Counting Geometric Intersections. IEEE Trans. on Computers C-28, 643–647 (1979)
Edelsbrunner, H., Guibas, L.J., Sharir, M.: The Complexity of Many Faces in Arrangements of Lines of Segments. In: ACM Annual Symp. on Computational Geometry, pp. 44–55. ACM Press, New York (1988)
Ferreira, A., Fonseca, M.J., Jorge, J.A.: Polygon Detection from a Set of Lines. In: Encontro Portugues de Computacao Grafica, pp. 159–162 (2003)
Nievergelt, J., Preparata, F.P.: Plane-Sweep Algorithms for Intersecting Geometric Figures. Communications of the ACM (CACM) 25, 739–747 (1982)
Schneider, M., Behr, T.: Topological Relationships between Complex Spatial Objects. ACM Trans. on Database Systems (TODS) 31, 39–81 (2006)
Shamos, M., Hoey, D.: Geometric Intersection Problems. In: IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos (1976)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McKenney, M., Pauly, A., Praing, R., Schneider, M. (2007). Ensuring the Semantic Correctness of Complex Regions. In: Hainaut, JL., et al. Advances in Conceptual Modeling – Foundations and Applications. ER 2007. Lecture Notes in Computer Science, vol 4802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76292-8_47
Download citation
DOI: https://doi.org/10.1007/978-3-540-76292-8_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76291-1
Online ISBN: 978-3-540-76292-8
eBook Packages: Computer ScienceComputer Science (R0)