Pages that link to "Item:Q3336711"
From MaRDI portal
The following pages link to Optimal algorithms to compute the closure of a set of iso-rectangles (Q3336711):
Displayed 14 items.
- Deadlock-freedom (and safety) of transactions in a distributed database (Q579973) (← links)
- Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles (Q790614) (← links)
- On the power of safe locking (Q909495) (← links)
- Optimization on directionally convex sets (Q1022414) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Fast dynamic intersection searching in a set of isothetic line segments (Q1065550) (← links)
- Partitioning and separating sets of orthogonal polygons (Q1097030) (← links)
- Generalized halfspaces in restricted-orientation convexity (Q1266488) (← links)
- Fundamentals of restricted-orientation convexity (Q1373390) (← links)
- Visibility in semi-convex spaces (Q1375948) (← links)
- A decompositin theorem for convexity spaces (Q1826114) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- Divide-and-conquer in planar geometry (Q3802611) (← links)
- PLANAR STRONG VISIBILITY (Q4818579) (← links)