36 search results - page 2 / 8 » Visiting a Polygon on the Optimal Way to a Query Point |
COMGEO
2006
ACM
13 years 4 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
ATAL
2008
Springer
13 years 6 months ago
2008
Springer
There is growing interest in multi-robot frequency-based patrolling, in which a team of robots optimizes its frequency of point visits, for every point in a target work area. In p...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
GIS
2006
ACM
14 years 5 months ago
2006
ACM
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
APPT
2003
Springer
13 years 10 months ago
2003
Springer
The increase number of mobile users in wireless environment affects query access time substantially. To minimise the query access time, one possible way is to employ data broadcast...