Abstract
Given a set V and three relations ⋈ d , ⋈ m and ⋈ i , we wish to ask whether it is possible to draw the elements v ∈ V each as a closed disc homeomorph \( \mathcal{D}_u \) in the plane in such a way that (1) \( \mathcal{D}_u \) and \( \mathcal{D}_w \) are disjoint for every (v,w) ∈⋈ d , (2) \( \mathcal{D}_u \) and \( \mathcal{D}_w \) have disjoint interiors but share a point of their boundaries for every (v,w) ∈⋈ m , and (3) \( \mathcal{D}_u \) includes \( \mathcal{D}_w \) as a sub-region for every (v,w) ∈⋈ i . This problem arises from the study in geographic information systems. The problem is in NP but not known to be NP-hard or polynomial-time solvable. This paper shows that a nontrivial special case of the problem can be solved in almost linear time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Z.-Z. Chen, M. Grigni, and C.H. Papadimitriou. Planar map graphs. Proc. 30th STOC (1998) 514–523. See http://rnc2.r.dendai.ac.jp/~chen/papers/mg2.ps.gz for a full version.
Z.-Z. Chen, X. He, and M.-Y. Kao. Nonplanar topological inference and politicalmap graphs. Proc. 10th SODA (1999) 195–204.
G. Di Battista and R. Tamassia. On-line maintenance of triconnected components with spqr-trees. Algorithmica 15 (1996) 302–318.
G. Di Battista and R. Tamassia. On-line planarity testing. SIAM J. Comput. 25 (1996) 956–997.
M.J. Egenhofer. Reasoning about binary topological relations. In: O. Gunther and H.J. Schek (eds.): Proc. Advances in Spatial Database (1991) 143–160.
M.J. Egenhofer and J. Sharma. Assessing the consistency of complete and incomplete topological information. Geographical Systems 1 (1993) 47–68.
M. Grigni, D. Papadias, and C.H. Papadimitriou. Topological inference. Proc. 14th IJCAI (1995) 901–906.
D. Papadias and T. Sellis. The qualitative representation of spatial knowledge in two-dimensional space. Very Large Data Bases Journal 4 (1994) 479–516.
T.R. Smith and K.K. Park. Algebraic approach to spatial reasoning. Int. J. on Geographical Information Systems 6 (1992) 177–192.
M. Thorup. Map graphs in polynomial time. Proc. 39th FOCS (1998) 396–405.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, ZZ., He, X. (2000). Hierarchical Topological Inference on Planar Disc Maps. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_12
Download citation
DOI: https://doi.org/10.1007/3-540-44968-X_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67787-1
Online ISBN: 978-3-540-44968-3
eBook Packages: Springer Book Archive