Embedding into the rectilinear plane in optimal O(n2) time
نویسندگان
چکیده
In this paper, we present an optimal O(n) time algorithm for deciding if a metric space (X, d) on n points can be isometrically embedded into the plane endowed with the l1-metric. It improves the O(n 2 log n) time algorithm of J. Edmonds (2008). Together with some ingredients introduced by Edmonds, our algorithm uses the concept of tight span and the injectivity of the l1-plane. A different O(n ) time algorithm was recently proposed by D. Eppstein (2009).
منابع مشابه
Embedding into the rectilinear plane in optimal O*(n^2)
In this paper, we present an optimal O(n) time algorithm for deciding if a metric space (X, d) on n points can be isometrically embedded into the plane endowed with the l1-metric. It improves the O(n 2 log n) time algorithm of J. Edmonds (2008). Together with some ingredients introduced by Edmonds, our algorithm uses the concept of tight span and the injectivity of the l1-plane. A different O(n...
متن کاملOn Parallel Rectilinear Obstacle-avoiding Paths
We give improved space and processor complexities for the problem of computing, in parallel, a data structure that supports queries about shortest rectilinear obstacleavoiding paths in the plane, where the obstacles are disjoint rectangles. That is, a query specifies any source and destination in the plane, and the data structure enables efficient processing of the query. We now can build the d...
متن کاملAn Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
We consider the problem of finding minimum-link rectilinear paths in rectilinear polygonal domains in the plane. A path or a polygon is rectilinear if all its edges are axis-parallel. Given a set P of h pairwise-disjoint rectilinear polygonal obstacles with a total of n vertices in the plane, a minimumlink rectilinear path between two points is a rectilinear path that avoids all obstacles with ...
متن کاملOn the Rectilinear Convex Layers of a Planar Set
In this paper we give an optimal O(n log n) time and O(n) space algorithm to compute the rectilinear convex layers of a set S of n points on the plane. We also compute the rotation of S that minimizes the number of rectilinear convex layers in O(n log n) time and O(n) space.
متن کاملComputing the Rectilinear Center of Uncertain Points in the Plane
In this paper, we consider the rectilinear one-center problem on uncertain points in the plane. In this problem, we are given a set P of n (weighted) uncertain points in the plane and each uncertain point has m possible locations each associated with a probability for the point appearing at that location. The goal is to find a point q∗ in the plane which minimizes the maximum expected rectiline...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 412 شماره
صفحات -
تاریخ انتشار 2011