Topological Relations Between Convex Regions

Abstract

Topological relations between spatial objects are the most important kind of qualitative spatial information. Dozens of relation models have been proposed in the past two decades. These models usually make a small number of distinctions and therefore can only cope with spatial information at a fixed granularity of spatial knowledge. In this paper, we propose a topological relation model in which the topological relation between two convex plane regions can be uniquely represented as a circular string over the alphabet u; v; x; y. A linear algorithm is given to compute the topological relation between two convex polygons. The infinite relation calculus could be used in hierarchical spatial reasoning as well as in qualitative shape description.

Cite

Text

Li and Liu. "Topological Relations Between Convex Regions." AAAI Conference on Artificial Intelligence, 2010. doi:10.1609/AAAI.V24I1.7586

Markdown

[Li and Liu. "Topological Relations Between Convex Regions." AAAI Conference on Artificial Intelligence, 2010.](https://mlanthology.org/aaai/2010/li2010aaai-topological/) doi:10.1609/AAAI.V24I1.7586

BibTeX

@inproceedings{li2010aaai-topological,
  title     = {{Topological Relations Between Convex Regions}},
  author    = {Li, Sanjiang and Liu, Weiming},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2010},
  pages     = {321-326},
  doi       = {10.1609/AAAI.V24I1.7586},
  url       = {https://mlanthology.org/aaai/2010/li2010aaai-topological/}
}