Algorithms for Generating Motion Trajectories Described by Prepositions

Authors:
Yilun Dianna Xu;Norman I. Badler
Affiliations:
-;-
Venue:
CA '00 Proceedings of the Computer Animation
Year:
2000

Citing 0
Cited 4

Computational properties of environment-based disambiguation

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Decision trees for sense disambiguation of prepositions: case of over

CLS '04 Proceedings of the HLT-NAACL Workshop on Computational Lexical Semantics
Prepositions in applications: A survey and introduction to the special issue

Computational Linguistics
Handling of prepositions in English to Bengali machine translation

Prepositions '06 Proceedings of the Third ACL-SIGSEM Workshop on Prepositions

Quantified Score

Hi-index	0.00

Visualization

Abstract

A list of representative directional prepositions of the English language is investigated to develop computation models that output some general motion trajectory or goal direction, given instructions involving prepositional phrases. Computation models are implemented through geometric definitions and procedures such as: centroid, quasi-centroid, convex-hull, closest, nearest neighbor, and next-to. All algorithms are defined by or derived from standard computational geometry concepts.