On the All-Farthest-Segments problem for a planar set of points
نویسندگان
چکیده
منابع مشابه
On the All-Farthest-Segments problem for a planar set of points
In this note, we outline a very simple algorithm for the following problem: Given a set S of n points p1, p2, p3, . . . , pn in the plane, we have O(n ) segments implicitly defined on pairs of these n points. For each point pi, find a segment from this set of implicitly defined segments that is farthest from pi. The complexity of our algorithm is in O(nh+n logn), where n is the number of input ...
متن کاملAn O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n logn) algorithm for the following proximity problem: Given a set P of n (>2) points in the plane, we have O(n2) implicitly defined segments on pairs of points. For each point p ∈ P , find a segment from this set of implicitly defined segment...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAll Approximating Segments for a Sequence of Points
In this paper, we consider the problem of approximating a sequence of n points by a line segment in such a way that the distance of each point from this segment is not greater than a given constant. Furthermore, the distance between the first(last) input point and the start(end)-point of the approximating segment must not be greater than the given constant. This is a sub-problem in solving unre...
متن کاملTHE APPENDIX, AN ACCEPTABLE SUBSTITUTE FOR ALL SEGMENTS OF BOTH URETERS: A REPORT OF TWO CASES
There are occasional reports of using the appendix to replace sections of the ureters, and to our knowledge, only a couple of them were in the left side. We used the appendix as a ureteral substitute in two cases in technically difficult parts, the upper left ureter and the first part of the right ureter. Follow-ups of8 years and 6 months in right and left side cases, respectively, are imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2006
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2006.06.015