Pages that link to "Item:Q685599"

The following pages link to Randomized incremental construction of abstract Voronoi diagrams (Q685599):

Displaying 31 items.

• An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
• A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
• Computing the map of geometric minimal cuts (Q476438) (← links)
• Characterization of contour elements that generate abstract Voronoi diagrams (Q676068) (← links)
• A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968) (← links)
• A fast algorithm for data collection along a fixed track (Q744105) (← links)
• Abstract Voronoi diagrams revisited (Q833716) (← links)
• Divide-and-conquer for Voronoi diagrams revisited (Q991182) (← links)
• Decomposing trimmed surfaces using the Voronoï diagram and a scan line algorithm (Q1126660) (← links)
• A combinatorial property of convex sets (Q1355195) (← links)
• Randomized incremental construction of simple abstract Voronoi diagrams in 3-space (Q1370927) (← links)
• Casting a polyhedron with directional uncertainty (Q1405007) (← links)
• Forest-like abstract Voronoi diagrams in linear time (Q1699286) (← links)
• Voronoi diagrams on the sphere (Q1862122) (← links)
• Abstract Voronoi diagram in 3-space (Q1878678) (← links)
• A compact piecewise-linear Voronoi diagram for convex sites in the plane (Q1907612) (← links)
• Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
• Maximum spanning trees in normed planes (Q2042214) (← links)
• Application of the theory of optimal set partitioning for constructing fuzzy Voronoi diagrams (Q2086403) (← links)
• On the complexity of higher order abstract Voronoi diagrams (Q2354919) (← links)
• An efficient randomized algorithm for higher-order abstract Voronoi diagrams (Q2414862) (← links)
• Exact Voronoi diagram of smooth convex pseudo-circles: general predicates, and implementation for ellipses (Q2443072) (← links)
• Dynamic construction of abstract Voronoi diagrams (Q2519174) (← links)
• The geometry of Minkowski spaces -- a survey. II. (Q2571082) (← links)
• The predicates of the Apollonius diagram: algorithmic analysis and implementation (Q2575585) (← links)
• A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams (Q2942610) (← links)
• COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION (Q3007723) (← links)
• Abstract Voronoi Diagrams from Closed Bisecting Curves (Q3132921) (← links)
• Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
• Deletion in Abstract Voronoi Diagrams in Expected Linear Time. (Q5115818) (← links)
• Deletion in abstract Voronoi diagrams in expected linear time and related problems (Q6045784) (← links)