Pages that link to "Item:Q790614"
From MaRDI portal
The following pages link to Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles (Q790614):
Displayed 7 items.
- The contour problem for rectilinear polygons (Q802313) (← links)
- A practical divide-and-conquer algorithm for the rectangle intersection problem (Q1098308) (← links)
- Time-and space-optimal contour computation for a set of rectangles (Q1108000) (← links)
- Parallel computational geometry of rectangles (Q1187198) (← links)
- On the parallel-decomposability of geometric problems (Q1194344) (← links)
- Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra (Q1262147) (← links)
- Divide-and-conquer in planar geometry (Q3802611) (← links)