Pages that link to "Item:Q833568"
From MaRDI portal
The following pages link to An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width (Q833568):
Displaying 18 items.
- Minimum-width rectangular annulus (Q388105) (← links)
- Locating an axis-parallel rectangle on a Manhattan plane (Q458948) (← links)
- Minimum-width double-strip and parallelogram annulus (Q784485) (← links)
- On the minimum-area rectangular and square annulus problem (Q827319) (← links)
- Computing a minimum-width square or rectangular annulus with outliers (Q1624585) (← links)
- Computing a minimum-width square annulus in arbitrary orientation (Q1705772) (← links)
- Minimum width color spanning annulus (Q1748988) (← links)
- Computing a minimum-width cubic and hypercubic shell (Q2294346) (← links)
- Locating a minisum annulus: a new partial coverage distance model (Q2408523) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- Computing a Minimum-Width Square Annulus in Arbitrary Orientation (Q2803818) (← links)
- Minimum Width Color Spanning Annulus (Q2817884) (← links)
- Computing a Minimum-Width Square or Rectangular Annulus with Outliers (Q2817885) (← links)
- Minimum Width Rectangular Annulus (Q3004689) (← links)
- Minimum-width annulus with outliers: circular, square, and rectangular cases (Q5915962) (← links)
- Maximum-width empty square and rectangular annulus (Q5918102) (← links)
- Red-blue rectangular annulus cover problem (Q6535815) (← links)
- An optimal algorithm for the minimum-width cubic shell problem (Q6556161) (← links)