Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. II: Algorithms for constructing Voronoi diagrams based on the theory of optimal set partitioning
From MaRDI portal
(Redirected from Publication:747294)
Recommendations
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations
- Construction of a generalized Voronoi diagram with optimal placement of generator points based on the theory of optimal set partitioning
- Application of the theory of optimal set partitioning for constructing fuzzy Voronoi diagrams
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (extended abstract)
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
- scientific article; zbMATH DE number 403949
- A boundary-partition-based Voronoi diagram of \(d\)-dimensional balls: definition, properties, and applications
- scientific article; zbMATH DE number 3918492
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- scientific article; zbMATH DE number 18530
Cites work
- scientific article; zbMATH DE number 3830713 (Why is no real title available?)
- Modified \(r\)-algorithm to find the global minimum of polynomial functions
- Nonsmooth-optimization methods in problems of stochastic programming
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. II: Algorithms for constructing Voronoi diagrams based on the theory of optimal set partitioning
Cited in
(11)- Separating a Voronoi diagram via local search
- scientific article; zbMATH DE number 2013558 (Why is no real title available?)
- Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem
- An algorithm for \(L_p\)-Voronoi diagram construction on discrete grid in 2D
- scientific article; zbMATH DE number 4185610 (Why is no real title available?)
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. II: Algorithms for constructing Voronoi diagrams based on the theory of optimal set partitioning
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations
- Capacity-constrained Voronoi diagrams in finite spaces
- Construction of a generalized Voronoi diagram with optimal placement of generator points based on the theory of optimal set partitioning
- Application of the theory of optimal set partitioning for constructing fuzzy Voronoi diagrams
- Solving some vector subset problems by Voronoi diagrams
This page was built for publication: Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. II: Algorithms for constructing Voronoi diagrams based on the theory of optimal set partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747294)
