Pages that link to "Item:Q3219793"
From MaRDI portal
The following pages link to IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS (Q3219793):
Displayed 31 items.
- Covering part of a planar network (Q291695) (← links)
- New local searches for solving the multi-source Weber problem (Q512988) (← links)
- Maximizing the minimum cover probability by emergency facilities (Q512997) (← links)
- Why is the 3D Delaunay triangulation difficult to construct? (Q673008) (← links)
- Solving scheduling and location problems in the plane simultaneously (Q732883) (← links)
- Two design principles of geometric algorithms in finite-precision arithmetic (Q749243) (← links)
- Equitable service by a facility: minimizing the Gini coefficient (Q833549) (← links)
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches (Q887199) (← links)
- Location of a facility minimizing nuisance to or from a planar network (Q947950) (← links)
- Optimizing the location of a production firm (Q993460) (← links)
- A general global optimization approach for solving location problems in the plane (Q995943) (← links)
- Location with acceleration-deceleration distance (Q1027601) (← links)
- Constructing a DC decomposition for ordered median problems (Q1037351) (← links)
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations (Q1094872) (← links)
- A sweepline algorithm for Voronoi diagrams (Q1101224) (← links)
- Computing correct Delaunay triangulations (Q1179540) (← links)
- The planar multifacility collection depots location problem (Q1628125) (← links)
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case (Q1841245) (← links)
- New primal and dual matching heuristics (Q1891231) (← links)
- Gradual cover competitive facility location (Q2197154) (← links)
- The obnoxious facilities planar \(p\)-median problem (Q2241906) (← links)
- The minimum equitable radius location problem with continuous demand (Q2378371) (← links)
- Solving the ordered one-median problem in the plane (Q2378373) (← links)
- Fast computing of three-dimensional convex hulls using graphics hardware (Q2388266) (← links)
- Fitting concentric circles to measurements (Q2441575) (← links)
- A comparison of sequential Delaunay triangulation algorithms. (Q2482895) (← links)
- Location of a distribution center for a perishable product (Q2636926) (← links)
- A note on equity across groups in facility location (Q2892131) (← links)
- A stochastic gradual cover location problem (Q3560226) (← links)
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments (Q5943290) (← links)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)