Hierarchical Topological Inference on Planar Disc Maps

Authors:
Zhi-Zhong Chen;Xin He
Affiliations:
-;-
Venue:
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Year:
2000

Citing 7
Cited 0

On-Line Planarity Testing

SIAM Journal on Computing
Planar map graphs

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Nonplanar topological inference and political-map graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Qualitative representation of spatial knowledge in two-dimensional space

The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Reasoning about Binary Topological Relations

SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Map Graphs In Polynomial Time

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Topological inference

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

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 Dv in the plane in such a way that (1) Dv and Dw are disjoint for every (v, w) ∈⋋d, (2) Dv and Dw have disjoint interiors but share a point of their boundaries for every (v, w) ∈⋋m, and (3) Dv includes Dw 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.