Search results

Create the page "Line segment intersection problem" on this wiki! See also the search results found.

• Computational geometry
  system. In fact, when points are given in the input of a programming problem, they are almost always ==The midpoint of the line segment joining two points==
  83 KB (14,390 words) - 06:14, 11 April 2014
• Segment tree
  The '''segment tree''' is a highly versatile [[data structure]], based upon the [[Divide a ...each time that we are doing so. Bear in mind, however, that other types of segment tree exist, which are discussed later in the article.
  21 KB (3,669 words) - 02:34, 6 April 2016
• Convex hull trick
  ...s learned the [[sweep line algorithm]] for the [[line segment intersection problem]]. ==The problem==
  19 KB (3,419 words) - 02:24, 13 September 2023
• Prefix sum array and difference array
  ...d, the prefix sum array is kept on hand because the algorithm to solve the problem makes frequent reference to range sums. We will consider the problem {{SPOJ|SUBSEQ|Counting Subsequences}} from IPSC 2006. Here we are given an
  25 KB (4,594 words) - 23:35, 19 December 2023