cauda-equina
发表于 2025-3-26 23:59:53
http://reply.papertrans.cn/16/1532/153120/153120_31.png
BILIO
发表于 2025-3-27 01:13:30
http://reply.papertrans.cn/16/1532/153120/153120_32.png
exostosis
发表于 2025-3-27 08:17:33
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
发表于 2025-3-27 11:58:45
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
发表于 2025-3-27 16:44:01
http://reply.papertrans.cn/16/1532/153120/153120_35.png
avulsion
发表于 2025-3-27 17:55:12
http://reply.papertrans.cn/16/1532/153120/153120_36.png
Gossamer
发表于 2025-3-27 23:26:05
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.
本能
发表于 2025-3-28 02:21:17
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.
取回
发表于 2025-3-28 08:27:24
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 and confirms a conjecture due to Chin and Ntafos .
阻塞
发表于 2025-3-28 12:46:43
http://reply.papertrans.cn/16/1532/153120/153120_40.png