Pages that link to "Item:Q757052"

The following pages link to On the construction of abstract Voronoi diagrams (Q757052):

Displaying 20 items.

• On non-smooth convex distance functions (Q287199) (← links)
• A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
• Randomized incremental construction of abstract Voronoi diagrams (Q685599) (← links)
• Four results on randomized incremental constructions (Q686138) (← links)
• A fast algorithm for data collection along a fixed track (Q744105) (← links)
• Abstract Voronoi diagrams revisited (Q833716) (← links)
• Randomized incremental construction of Delaunay and Voronoi diagrams (Q1185289) (← links)
• Searching for segments with largest relative overlap (Q1186585) (← links)
• Fully dynamic Delaunay triangulation in logarithmic expected per operation (Q1199828) (← links)
• On the randomized construction of the Delaunay tree (Q1210297) (← links)
• Randomized incremental construction of simple abstract Voronoi diagrams in 3-space (Q1370927) (← links)
• Abstract Voronoi diagram in 3-space (Q1878678) (← links)
• Using geometry to solve the transportation problem in the plane (Q1894300) (← links)
• A compact piecewise-linear Voronoi diagram for convex sites in the plane (Q1907612) (← links)
• Incremental topological flipping works for regular triangulations (Q1908263) (← links)
• Randomized geometric algorithms and pseudorandom generators (Q1923860) (← links)
• On the complexity of higher order abstract Voronoi diagrams (Q2354919) (← links)
• ``The big sweep'': On the power of the wavefront approach to Voronoi diagrams (Q2365174) (← links)
• A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis (Q2366225) (← links)
• A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams (Q2942610) (← links)