Pages that link to "Item:Q283875"
From MaRDI portal
The following pages link to An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875):
Displaying 11 items.
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. II: Algorithms for constructing Voronoi diagrams based on the theory of optimal set partitioning (Q747294) (← links)
- Robustness of \(k\)-gon Voronoi diagram construction (Q1045919) (← links)
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments (Q1093370) (← links)
- Optimal computation of the Voronoi diagram of disjoint clusters (Q1603454) (← links)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane (Q1907612) (← links)
- Convex-straight-skeleton Voronoi diagrams for segments and convex polygons (Q2037112) (← links)
- Aspect-ratio Voronoi diagram and its complexity bounds (Q2380035) (← links)
- Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments (Q3188909) (← links)
- The optimal algorithm for dynamic support of the Voronoi Diagram for a set of points (Q4991375) (← links)
- An optimal algorithm for computing visible nearest foreign neighbors among colored line segments (Q5054843) (← links)
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments (Q5943290) (← links)
