Pages that link to "Item:Q757052"

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

Displaying 41 items.

• On non-smooth convex distance functions (Q287199) (← links)
• Local calculation of Voronoi diagrams (Q293475) (← links)
• A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
• Characterization of contour elements that generate abstract Voronoi diagrams (Q676068) (← 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)
• Construction of Voronoi diagrams in the plane by using maps (Q751861) (← links)
• Abstract Voronoi diagrams revisited (Q833716) (← links)
• Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram (Q1094871) (← links)
• A sweepline algorithm for Voronoi diagrams (Q1101224) (← links)
• Geometric relations among Voronoi diagrams (Q1101688) (← links)
• Randomized incremental construction of Delaunay and Voronoi diagrams (Q1185289) (← links)
• Searching for segments with largest relative overlap (Q1186585) (← links)
• Concrete and abstract Voronoi diagrams (Q1188589) (← 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)
• Forest-like abstract Voronoi diagrams in linear time (Q1699286) (← 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)
• On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation (Q2868517) (← links)
• A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams (Q2942610) (← links)
• (Q3056734) (← links)
• Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms (Q3303782) (← links)
• (Q3833670) (← links)
• On the constrcution of abstract Voronoi diagrams (Q3975933) (← links)
• (Q4201933) (← links)
• Randomized incremental construction of simple abstract Voronoi diagrams in 3-space (Q5055906) (← links)
• Four results on randomized incremental constructions (Q5096803) (← links)
• Voronoi diagrams for polygon-offset distance functions (Q5096938) (← links)
• ABSTRACT VORONOI DIAGRAMS WITH DISCONNECTED REGIONS (Q5261019) (← links)
• VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE (Q5470167) (← links)
• On lazy randomized incremental construction (Q5917712) (← links)
• Voronoi diagrams for convex polygon-offset distance functions (Q5932811) (← links)