The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Path planning among polygonal obstacles is a well-known problem in robotics. In this paper, we consider the problem of planning a collision-free path for a robot in a polygonal domain from a given source point to a given target point. The robot has two basic limitations: an upper bound on the angle of rotation and a lower bound on the distance between two consecutive turns. We describe an algorithm...
In this paper, we consider the problem of computing the visibility polygon (VP) of a query point q (or VP(q)) in a scene consisting of some obstacles with total complexity of n. We show that the combinatorial representation of VP(q) can be computed in logarithmic time by preprocessing the scene in O(n4logn) time and using O(n4) space. We can also report the actual VP(q) in additional O(|VP(q)|) time...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.