The following pages link to (Q4411393):
Displayed 10 items.
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations (Q891710) (← links)
- Single facility collection depots location problem in the plane (Q1025297) (← links)
- A parallel algorithm for computing Voronoi diagram of a set of circles using touching disc and topology matching (Q2127711) (← links)
- Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case (Q2216178) (← links)
- A dynamic sampling approach towards computing Voronoi diagram of a set of circles (Q2243180) (← links)
- Fuzzy dynamics of multibody systems with polymorphic uncertainty in the material microstructure (Q2281502) (← links)
- Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities (Q2446403) (← links)
- The predicates of the Apollonius diagram: algorithmic analysis and implementation (Q2575585) (← links)
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces (Q3057631) (← links)
- Topology-Oriented Incremental Algorithm for the Robust Construction of the Voronoi Diagrams of Disks (Q5270775) (← links)