2012
DOI: 10.3390/ijgi1030333
|View full text |Cite
|
Sign up to set email alerts
|

Spatial Relations Using High Level Concepts

Abstract: Existing models of spatial relations do not consider that different concepts exist on different levels in a hierarchy and in turn that the spatial relations in a given scene are a function of the specific concepts considered. One approach to determining the existence of a particular spatial relation is to compute the corresponding high level concepts explicitly using map generalization before inferring the existence of the spatial relation in question. We explore this idea through the development of a model of… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0
2

Year Published

2013
2013
2022
2022

Publication Types

Select...
6
2
2

Relationship

2
8

Authors

Journals

citations
Cited by 16 publications
(10 citation statements)
references
References 54 publications
0
8
0
2
Order By: Relevance
“…The framework we have developed is ideally suited for this task and can be applied to essentially all approaches built on calculi using JEPD (jointly exhaustive and pairwise disjoint) relations. Examples are Renolen's basic types of change (Renolen 2000), approaches to defining perceptual topology (e.g., perceived connectedness such as a settlement, see Corcoran et al (2012)), or Brunet's chorematic modeling Brunet (1987). This would allow for responding to the call by Schultz and collegues Schultz et al (2011) to provide guidance on when to use a certain calculus (and when not to).…”
Section: Discussionmentioning
confidence: 99%
“…The framework we have developed is ideally suited for this task and can be applied to essentially all approaches built on calculi using JEPD (jointly exhaustive and pairwise disjoint) relations. Examples are Renolen's basic types of change (Renolen 2000), approaches to defining perceptual topology (e.g., perceived connectedness such as a settlement, see Corcoran et al (2012)), or Brunet's chorematic modeling Brunet (1987). This would allow for responding to the call by Schultz and collegues Schultz et al (2011) to provide guidance on when to use a certain calculus (and when not to).…”
Section: Discussionmentioning
confidence: 99%
“…In graph theory, there exist many algorithms, such as breadth-first search, for computing topologically inequivalent paths. How humans model the world is topological on some level and therefore topological path planning has been studied extensively in the field of spatial cognition [5,6]. Topological path planning has been demonstrated to have many applications in the robotics domain.…”
Section: Related Workmentioning
confidence: 99%
“…Strategies employed by these methods can be categorized into four types, including aggregation by displacing, aggregation by flooding, aggregation by sampling, and aggregation by connecting objects [11]. In this paper we explore the last of these strategies, which uses the triangles connecting objects as connectors to merge objects, which is by far the most commonly used methodology [22]. Triangles from the Delaunay triangulation can provide explicit spatial relationships between features, and can used be to guide the amalgamation process [3,[7][8][9]23].…”
Section: Introductionmentioning
confidence: 99%