Skip to main content

Hierarchical Topological Inference on Planar Disc Maps

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1858))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

  2. Z.-Z. Chen, X. He, and M.-Y. Kao. Nonplanar topological inference and politicalmap graphs. Proc. 10th SODA (1999) 195–204.

    Google Scholar 

  3. G. Di Battista and R. Tamassia. On-line maintenance of triconnected components with spqr-trees. Algorithmica 15 (1996) 302–318.

    Article  MATH  MathSciNet  Google Scholar 

  4. G. Di Battista and R. Tamassia. On-line planarity testing. SIAM J. Comput. 25 (1996) 956–997.

    Article  MATH  MathSciNet  Google Scholar 

  5. M.J. Egenhofer. Reasoning about binary topological relations. In: O. Gunther and H.J. Schek (eds.): Proc. Advances in Spatial Database (1991) 143–160.

    Google Scholar 

  6. M.J. Egenhofer and J. Sharma. Assessing the consistency of complete and incomplete topological information. Geographical Systems 1 (1993) 47–68.

    Google Scholar 

  7. M. Grigni, D. Papadias, and C.H. Papadimitriou. Topological inference. Proc. 14th IJCAI (1995) 901–906.

    Google Scholar 

  8. D. Papadias and T. Sellis. The qualitative representation of spatial knowledge in two-dimensional space. Very Large Data Bases Journal 4 (1994) 479–516.

    Article  Google Scholar 

  9. T.R. Smith and K.K. Park. Algebraic approach to spatial reasoning. Int. J. on Geographical Information Systems 6 (1992) 177–192.

    Article  Google Scholar 

  10. M. Thorup. Map graphs in polynomial time. Proc. 39th FOCS (1998) 396–405.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics