Pages that link to "Item:Q2248734"
From MaRDI portal
The following pages link to Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments (Q2248734):
Displaying 7 items.
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
- Improved algorithms for the farthest colored Voronoi diagram of segments (Q391216) (← links)
- Farthest line segment Voronoi diagrams (Q845871) (← links)
- On farthest Voronoi cells (Q2332415) (← links)
- An optimal algorithm for computing visible nearest foreign neighbors among colored line segments (Q5054843) (← links)
- On farthest Bregman Voronoi cells (Q5077159) (← links)
- Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions (Q6624198) (← links)
