The following pages link to Scanline algorithms on a grid (Q1111020):
Displayed 10 items.
- On building the transitive reduction of a two-dimensional poset (Q287116) (← links)
- Computing minimum-area rectilinear convex hull and \(L\)-shape (Q833717) (← links)
- The weighted maximum independent set problem in permutation graphs (Q1195927) (← links)
- Parallel algorithms for permutation graphs (Q1314630) (← links)
- A new algorithm for rectangle enclosure reporting (Q1607019) (← links)
- Geometric separability using orthogonal objects (Q2122791) (← links)
- A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set (Q2242054) (← links)
- A fast and efficient algorithm for determining the connected orthogonal convex hulls (Q2671859) (← links)
- Ranking intervals under visibility constraints<sup>∗</sup> (Q3477956) (← links)
- Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations (Q5387812) (← links)