This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on average less comparisons than the total number of elements of both inputs (n and m respectively) when n = αm (α > 1). We can find applications of this algorithm on query processing in Web search engines, where large intersection...

‎for a set of non-negative integers~$l$‎, ‎the $l$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $a_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|a_u cap a_v|in l$‎. ‎the bipartite $l$-intersection number is defined similarly when the conditions are considered only for the ver...

We present a new and efficient method to compute the intersection point between a convex planar quadrilateral and a ray. Contrary to other methods, the bilinear coordinates of the intersection point are computed only for rays that hit the quadrilateral. Rays that do not hit the quadrilateral are rejected early. Our method is up to 40% faster compared to previous approaches.