Searching for "On Rectilinear Link Distance." – sorted by Relevance.
-
Optimal Parallel Algorithms for Rectilinear Link Distance Problems
- Optimal Parallel Algorithms for Rectilinear Link Distance Problems Andrzej Lingas Department
- Cited by 1 (0 self) – Add To MetaCart
-
Company AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
- arbitrary points inside a polygon, the rectilinear link distance and the L1-distance between the two points
- Add To MetaCart
-
An optimal algorithm for the rectilinear link center of a rectilinear polygon
- rectilinear link distance between any two points in P. In [2], de Berg also gives an O(n log n) algorithm
- Cited by 6 (1 self) – Add To MetaCart
-
An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon
- rectilinear link distance between any two points in P. In [2], de Berg also gives an O(n log n) algorithm
- Add To MetaCart
-
An Optimal Data Structure for Shortest Rectilinear Path Queries in a Simple Rectilinear Polygon
- arbitrary points inside a polygon, the rectilinear link distance and the L 1 -distance between the two
- Cited by 5 (0 self) – Add To MetaCart
-
Computing the L1-Diameter and Center of a Simple Rectilinear Polygon in Parallel
- on a CREW-PRAM using O(n2) processors [5]. Lingas et al. considered the rectilinear link distance
- Add To MetaCart
-
An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
- is to modify the objective function, for example, rectilinear link distance metric [2] or combined L1 and link
- Cited by 3 (0 self) – Add To MetaCart
-
[Extended Abstract]
- has been rediscovered by [36]). It was also shown in [11, 12] that for rectilinear link distance after
- Add To MetaCart
-
Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons in the Presence
- for rectilinear link distance are respectively given by de Berg [8] 1 and Lingas et al. [20]. De Berg et al. [9
- Cited by 1 (1 self) – Add To MetaCart

