Scanline algorithms on a grid
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- A new approach to rectangle intersections
- A priority queue in which initialization and queue operations takeO(loglogD) time
- Algorithms for Reporting and Counting Geometric Intersections
- An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem
- Efficient data structures for range searching on a grid
- Log-logarithmic worst-case range queries are possible in space theta(N)
- New trie data structures which support very fast search operations
- On Finding the Maxima of a Set of Vectors
- On the identification of the convex hull of a finite set of points in the plane
- Preserving order in a forest in less than logarithmic time and linear space
- Scattering of Rayleigh-Lamb waves from a 2d-cavity in an elastic plate
- Upper bounds for sorting integers on random access machines
Cited in
(12)- A new algorithm for rectangle enclosure reporting
- The weighted maximum independent set problem in permutation graphs
- A fast and efficient algorithm for determining the connected orthogonal convex hulls
- On building the transitive reduction of a two-dimensional poset
- Ranking intervals under visibility constraints∗
- A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
- Constant-work-space image scan with a given angle
- Parallel algorithms for permutation graphs
- Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations
- Computing minimum-area rectilinear convex hull and L-shape
- Fast raster scan distance propagation on the discrete rectangular lattice
- Geometric separability using orthogonal objects
This page was built for publication: Scanline algorithms on a grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111020)
