Topological relations between convex regions

Li, S; Liu, W

Topological relations between convex regions

Li, S

Liu, W

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings of the National Conference on Artificial Intelligence, 2010, 1 pp. 321 - 326
Issue Date:: 2010-01-01

Closed Access

	Filename	Description	Size
	2009006634OK.pdf		676.68 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Li, S https://orcid.org/0000-0002-3332-2546	en_US
dc.contributor.author	Liu, W	en_US
dc.date.issued	2010-01-01	en_US
dc.identifier.citation	Proceedings of the National Conference on Artificial Intelligence, 2010, 1 pp. 321 - 326	en_US
dc.identifier.isbn	9781577354642	en_US
dc.identifier.uri	http://hdl.handle.net/10453/16112
dc.description.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. Copyright © 2010, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.	en_US
dc.relation.ispartof	Proceedings of the National Conference on Artificial Intelligence	en_US
dc.title	Topological relations between convex regions	en_US
dc.type	Conference Proceeding
utslib.citation.volume	1	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
dc.location.activity	Atlanta, Georgia, USA	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	1	en_US

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. Copyright © 2010, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/16112