Shortest paths in simply connected regions in R2
نویسندگان
چکیده
منابع مشابه
Approximate Shortest Homotopic Paths in Weighted Regions
Let P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted regions. Given a relative error tolerance ε ∈ (0, 1), we present the first algorithm to compute a path between s and t that can be deformed to P without passing over any obstacle and the path cost is within a factor 1+ ε of the optimum. The running time is O( 3 ε2 knpolylog(k, n, 1 ε )), where k ...
متن کاملShortest path in a simply-connected domain having curved boundary
Given two distinct points S and E on a simply-connected domain (without holes) enclosed by a closed parametric curve, this paper provides an algorithm to find the shortest interior path (SIP) between the two points in the domain. SIP consists of portions of curves along with straight line segments that are tangential to the curve. The algorithm initially computes point-curve tangents and bitang...
متن کاملApproximate shortest paths in moderately anisotropic regions
We want to find an approximate shortest path for a point robot moving in a planar subdivision. Each face of the subdivision is associated with a convex distance function that has the following property: its unit disk contains a unit Euclidean disk, and is contained in a Euclidean disk with radius ρ. Obstacles are allowed, so there can be regions that the robot is not allowed to enter. We give a...
متن کاملApproxiamte Shortest Homotopic Paths in Weighted Regions∗
Let P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted regions. Given a relative error tolerance ε ∈ (0, 1), we present the first algorithm to compute a path between s and t that can be deformed to P without passing over any obstacle and the path cost is within a factor 1 + ε of the optimum. The running time is O( 3 ε2 kn polylog(k, n, 1 ε )), where ...
متن کاملTiling simply connected regions with rectangles
Abstract. In 1995, Beauquier, Nivat, Rémila, and Robson showed that tiling of general regions with two rectangles is NP-complete, except for a few trivial special cases. In a different direction, in 2005, Rémila showed that for simply connected regions by two rectangles, the tileability can be solved in quadratic time (in the area). We prove that there is a finite set of at most 10 rectangles f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1989
ISSN: 0001-8708
DOI: 10.1016/0001-8708(89)90054-6