On the time complexity for circumscribing a convex polygon
نویسندگان
چکیده
منابع مشابه
On the time complexity for circumscribing a convex polygon
A recent article "Circumscribing a Convex Polygon by a Polygon of Fewer Sides with Minimal Area Addition" by Dori and Ben-Bassat, Comput. Vision Graph. Image Process. 24, 1983, 131-159, raised several interesting questions including the time complexity of their algorithm. In this paper, the time complexity on circumscribing an n-gon by an m-gon, where m < n, is analyzed to be O(n lg n). © 1985 ...
متن کاملMinimum Area All-flush Triangles Circumscribing a Convex Polygon
In this paper, we consider the problem of computing the minimum area triangle that circumscribes a given n-sided convex polygon touching edge-to-edge. In other words, we compute the minimum area triangle that is the intersection of 3 half-planes out of n half-planes defined by a given convex polygon. Previously, O(n logn) time algorithms were known which are based on the technique for computing...
متن کاملthe effects of time planning and task complexity on accuracy of narrative task performance
هدف اصلی این تحقیق بررسی تاثیر برنامه ریزی زمانی، هم چنین افزایش میزان پیچیدگی تکالیف در نظر گرفته شده بصورت همزمان، بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 16 الی 18 سال به عنوان شرکت کنندگان در این زمینه ی تحقیق در نظر گرفته شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی هر دو تکلیف ساده و پی...
On unit distances in a convex polygon
For any convex quadrilateral, the sum of the lengths of the diagonals is greater than the corresponding sum of a pair of opposite sides, and all four of its interior angles cannot be simultaneously acute. In this article, we use these two properties to estimate the number of unit distance edges in convex n-gons and we: (i) exhibit three large groups of cycles formed by unit distance edges that ...
متن کاملOn the Erdos-Szekeres convex polygon problem
Let ES(n) be the smallest integer such that any set of ES(n) points in the plane in general position contains n points in convex position. In their seminal 1935 paper, Erdős and Szekeres showed that ES(n) ≤ ( 2n−4 n−2 ) + 1 = 4. In 1960, they showed that ES(n) ≥ 2 + 1 and conjectured this to be optimal. In this paper, we nearly settle the Erdős-Szekeres conjecture by showing that ES(n) = 2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Vision, Graphics, and Image Processing
سال: 1985
ISSN: 0734-189X
DOI: 10.1016/0734-189x(85)90166-5