Pages that link to "Item:Q3956420"
From MaRDI portal
The following pages link to An improved algorithm for the rectangle enclosure problem (Q3956420):
Displaying 14 items.
- Computing a poset from its realizer (Q287260) (← links)
- In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) (← links)
- Optimal algorithms for some polygon enclosure problems for VLSI layout analysis (Q864923) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Geometric containment and vector dominance (Q1093914) (← links)
- The expected size of some graphs in computational geometry (Q1106021) (← links)
- The space-optimal version of a known rectangle enclosure reporting algorithm (Q1391959) (← links)
- A new algorithm for rectangle enclosure reporting (Q1607019) (← links)
- A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids (Q1894952) (← links)
- Computing rectangle enclosures (Q2365809) (← links)
- An optimal time and minimal space algorithm for rectangle intersection problems (Q3318126) (← links)
- Some Results for Elementary Operations (Q3644718) (← links)
- Divide-and-conquer in planar geometry (Q3802611) (← links)
- Direct dominance of points (Q3802650) (← links)
