On the number of intersections of two polygons
نویسندگان
چکیده
We study the maximum possible number f(k, l) of intersections of the boundaries of a simple k-gon with a simple l-gon in the plane for k, l ≥ 3. To determine the number f(k, l) is quite easy and known when k or l is even but still remains open for k and l both odd. We improve (for k ≤ l) the easy upper bound kl − l to kl − ⌈k/6⌉ − l and obtain exact bounds for k = 5 (f(5, l) = 4l − 2) in this case.
منابع مشابه
A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملThe maximum number of intersections of two polygons
We determine the maximum number of intersections between two polygons with p and q vertices, respectively, in the plane. The cases where p or q is even or the polygons do not have to be simple are quite easy and already known, but when p and q are both odd and both polygons are simple, the problem is more difficult. We prove that the conjectured maximum (p− 1)(q− 1)+ 2 is correct for all odd p ...
متن کاملDeveloping an Analytical Model and Simulation of The Contraflow Left-Turn Lane at Signalized Intersections
At some intersections, excessive queue lengths may spill out of the left-turn bay and block the through lanes, jeopardizing level of service for the entire intersection. One of the most effective plans recently presented by the researchers is the "Contraflow left-turn lane" (CLL) In this method, left-turn vehicles will use the nearest lane in the opposite direction in addition to the usual left...
متن کاملToward Spatial Joins for Polygons
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr) of the spatial objects (mbr-filter) and evaluate the actual join of the objects using the results of the join on approximations. Improvements to add additional filtering using more accurate approximations were also consi...
متن کاملE cient Algorithms for Counting and Reporting Pairwise Intersections between Convex Polygons
Let S be a set of convex polygons in the plane with a total of n vertices, where a polygon consists of the boundary as well as the interior. E cient algorithms are presented for the problem of reporting output-sensitively (resp. counting) the I pairs of polygons that intersect. The algorithm for the reporting (resp. counting) problem runs in time O(n4=3+ +I) (resp. O(n4=3+ )), where > 0 is an a...
متن کامل