Pages that link to "Item:Q3659158"
From MaRDI portal
The following pages link to A new approach to rectangle intersections part I (Q3659158):
Displayed 18 items.
- Graph problems arising from parameter identification of discrete dynamical systems (Q634788) (← links)
- Optimal external memory planar point enclosure (Q834582) (← links)
- Approximate colored range and point enclosure queries (Q1018093) (← links)
- Fast dynamic intersection searching in a set of isothetic line segments (Q1065550) (← links)
- Local polyhedra and geometric graphs (Q1775780) (← links)
- Efficient splitting and merging algorithms for order decomposable problems. (Q1854311) (← links)
- I/O-efficient dynamic planar point location (Q1882856) (← links)
- Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees (Q1907033) (← links)
- Computing the depth distribution of a set of boxes (Q2049979) (← links)
- SMB: Collision detection based on temporal coherence (Q2384189) (← links)
- Algorithms for the multiple label placement problem (Q2432730) (← links)
- Ranking intervals under visibility constraints<sup>∗</sup> (Q3477956) (← links)
- Divide-and-conquer in planar geometry (Q3802611) (← links)
- A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT (Q4818541) (← links)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
- An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ<sup>3</sup> (Q5108270) (← links)
- External memory planar point location with logarithmic updates (Q5920252) (← links)
- (Q6060104) (← links)