Application of the theory of optimal set partitioning for constructing fuzzy Voronoi diagrams
From MaRDI portal
Publication:2086403
DOI10.1007/978-3-030-94910-5_15OpenAlexW4221124043MaRDI QIDQ2086403
Liudmyla Hart, Olga Prytomanova, Elena Kiseleva, Oleg Blyuss
Publication date: 25 October 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-94910-5_15
nondifferentiable optimizationShor's \(r\)-algorithmoptimal set partitioningfuzzy Voronoi diagramgenerating points
Applications of mathematical programming (90C90) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- The Zermelo-Voronoi diagram: a dynamic partition problem
- Randomized incremental construction of abstract Voronoi diagrams
- 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
- Uncertain Voronoi diagram
- Concrete and abstract Voronoi diagrams
- A geometrical solution for quadratic bicriteria location models
- Nondifferentiable optimization and polynomial problems
- Shor's \(r\)-algorithms: theory and practice
- Analysis of algorithms for a class of continuous partition problems
- Formalizing spatial configuration optimization problems with the use of a special function class
- Voronoi Diagrams and Delaunay Triangulations
- Multiple packing and covering of spheres
- Generalization of Voronoi Diagrams in the Plane
- Fuzzy sets
This page was built for publication: Application of the theory of optimal set partitioning for constructing fuzzy Voronoi diagrams