Sciweavers

553 search results - page 17 / 111
» On Planar Path Transformation
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
From direction of arrival estimates to localization of planar reflectors in a two dimensional geometry
In this paper we propose a novel technique to localize planar obstacles through the measurement of the Direction of Arrival by a microphone array. The measurement of the Direction...
Antonio Canclini, Paolo Annibale, Fabio Antonacci,...
CCCG
1993
13 years 8 months ago
Shortest Paths for a Two-robot Rendez-vous
In this paper, we consider an optimalmotionplanning problem for a pair of point robots in a planar environment with polygonal obstacles. We seek a pair of paths upon which the rob...
Erik L. Wynters, Joseph S. B. Mitchell
COMPGEOM
2007
ACM
13 years 11 months ago
Querying approximate shortest paths in anisotropic regions
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
MFCS
1998
Springer
13 years 11 months ago
Facial Circuits of Planar Graphs and Context-Free Languages
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
Bruno Courcelle, Denis Lapoire
INFORMATICALT
2006
80views more  INFORMATICALT 2006»
13 years 7 months ago
Scheduling Trajectories on a Planar Surface with Moving Obstacles
An algorithm for scheduling the trajectory of a point object, which moves on a plane surface comprising of moving obstacles, is introduced. Different quantitative criteria may be m...
Emmanuel Stefanakis