Pages that link to "Item:Q845871"
From MaRDI portal
The following pages link to Farthest line segment Voronoi diagrams (Q845871):
Displaying 17 items.
- The higher-order Voronoi diagram of line segments (Q261375) (← links)
- Improved algorithms for the farthest colored Voronoi diagram of segments (Q391216) (← links)
- On the central path problem (Q393050) (← links)
- All-maximum and all-minimum problems under some measures (Q396657) (← links)
- Farthest-polygon Voronoi diagrams (Q632728) (← links)
- Farthest segments and extremal triangles spanned by points in \(\mathbb R^3\) (Q990950) (← links)
- Stabbing circles for sets of segments in the plane (Q1742369) (← links)
- Convex-straight-skeleton Voronoi diagrams for segments and convex polygons (Q2037112) (← links)
- Rearranging a sequence of points onto a line (Q2144451) (← links)
- Dispersing and grouping points on planar segments (Q2232600) (← links)
- An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points (Q2380039) (← links)
- ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM (Q2932519) (← links)
- Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function (Q2971631) (← links)
- Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments (Q3183469) (← links)
- Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction (Q5387806) (← links)
- Discrete and mixed two-center problems for line segments (Q6121433) (← links)
- Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions (Q6624198) (← links)
