Pages that link to "Item:Q1274672"
From MaRDI portal
The following pages link to The widest k-dense corridor problems (Q1274672):
Displaying 8 items.
- Improved algorithm for the widest empty 1-corner corridor (Q989575) (← links)
- The widest k-dense corridor problems (Q1274672) (← links)
- An efficient \(k\) nearest neighbors searching algorithm for a query line. (Q1874395) (← links)
- Locating an obnoxious plane (Q2496077) (← links)
- Improved Algorithm for a Widest 1-Corner Corridor (Q3605487) (← links)
- LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS (Q5300001) (← links)
- Dynamically maintaining the widest \(k\)-dense corridor (Q5941092) (← links)
- Minimum-width double-slabs and widest empty slabs in high dimensions (Q6547941) (← links)
