Pages that link to "Item:Q4909535"
From MaRDI portal
The following pages link to On the Farthest Line-Segment Voronoi Diagram (Q4909535):
Displaying 8 items.
- Farthest-polygon Voronoi diagrams (Q632728) (← links)
- Farthest line segment Voronoi diagrams (Q845871) (← links)
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments (Q2248734) (← links)
- Euclidean farthest-point Voronoi diagram of a digital edge (Q2255824) (← links)
- On farthest Voronoi cells (Q2332415) (← links)
- An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points (Q2380039) (← links)
- Map of Geometric Minimal Cuts for General Planar Embedding (Q2867123) (← links)
- On farthest Bregman Voronoi cells (Q5077159) (← links)