Titlebook: Algorithms and Computation; 4th International Sy K. W. Ng,P. Raghavan,F. Y. L. Chin Conference proceedings 1993 Springer-Verlag Berlin Heid

cauda-equina

BILIO

exostosis

https://doi.org/10.1007/978-3-8350-5467-7re given this is the well known lattice approximation problem. We call the general version the quadratic lattice approximation problem. In this paper we construct via derandomization lattice points with small linear and quadratic discrepancies. Unfortunately the known derandomization methods do not

nostrum

https://doi.org/10.1007/978-3-642-75831-7We study two problems related to planar motion planning for robots with imperfect control, where, if the robot starts a linear movement in a certain commanded direction, we only know that its actual movement will be confined in a cone of angle . centered around the specified direction.

Obverse

avulsion

Gossamer

Reaching a goal with directional uncertainty,We study two problems related to planar motion planning for robots with imperfect control, where, if the robot starts a linear movement in a certain commanded direction, we only know that its actual movement will be confined in a cone of angle . centered around the specified direction.

本能

Finding the shortest watchman route in a simple polygon,We present the first polynomial-time algorithm that finds the shortest route in a simple polygon such that all points of the polygon is visible from some point on the route. This route is sometimes called the shortest watchman route, and it does not allow any restrictions on the route or on the simple polygon. Our algorithm runs in ..) time.

取回

Constructing shortest watchman routes by divide-and-conquer,We study the problem of finding shortest watchman routes in simple polygons from which polygons are visible. We develop a divide-and-conquer algorithm that constructs the shortest watchman route in ..) time for a simple polygon with . edges. This improves the previous ..) bound [8] and confirms a conjecture due to Chin and Ntafos [4].

阻塞