Theory of Continuous Optimal Set Partitioning Problems as a Universal Mathematical Formalism for Constructing Voronoi Diagrams and Their Generalizations. I. Theoretical Foundations
- 27 May 2015
- journal article
- cybernetics
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 51 (3) , 325-335
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Efficient grid-based spatial representations for robot navigation in dynamic environmentsRobotics and Autonomous Systems, 2013
- The Zermelo–Voronoi diagram: A dynamic partition problemAutomatica, 2010
- Solution of continuous problems of optimal covering with spheres using optimal set-partition theoryCybernetics and Systems Analysis, 2009
- Uncertain Voronoi diagramInformation Processing Letters, 2009
- Modelling three‐dimensional geoscientific fields with the Voronoi diagram and its dualInternational Journal of Geographical Information Science, 2008
- Stable marker-particle method for the Voronoi diagram in a flow fieldJournal of Computational and Applied Mathematics, 2007
- Nonsmooth-optimization methods in problems of stochastic programmingCybernetics and Systems Analysis, 1999
- A geometrical solution for quadratic bicriteria location modelsEuropean Journal of Operational Research, 1999
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- Multiple packing and covering of spheresActa Mathematica Hungarica, 1979