Geodesic
Solving some vector subset problems by Voronoi diagrams
Diskretnyj analiz i issledovanie operacij, Tome 23 (2016) no. 4, pp. 102-115

Voir la notice de l'article provenant de la source Math-Net.Ru

We propose a general approach to solving some vector subset problems in a Euclidean space that is based on higher-order Voronoi diagrams. In the case of a fixed space dimension, this approach allows us to find optimal solutions to these problems in polynomial time which is better than the runtime of available algorithms. Ill. 1, bibliogr. 16.
Keywords: computational geometry, vector subset problem, Euclidean space, Voronoi diagram
Mots-clés : polynomial-time algorithm. 
@article{DA_2016_23_4_a3,
     author = {V. V. Shenmaier},
     title = {Solving some vector subset problems by {Voronoi} diagrams},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {102--115},
     publisher = {mathdoc},
     volume = {23},
     number = {4},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2016_23_4_a3/}
}
TY  - JOUR
AU  - V. V. Shenmaier
TI  - Solving some vector subset problems by Voronoi diagrams
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2016
SP  - 102
EP  - 115
VL  - 23
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2016_23_4_a3/
LA  - ru
ID  - DA_2016_23_4_a3
ER  - 
%0 Journal Article
%A V. V. Shenmaier
%T Solving some vector subset problems by Voronoi diagrams
%J Diskretnyj analiz i issledovanie operacij
%D 2016
%P 102-115
%V 23
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2016_23_4_a3/
%G ru
%F DA_2016_23_4_a3
V. V. Shenmaier. Solving some vector subset problems by Voronoi diagrams. Diskretnyj analiz i issledovanie operacij, Tome 23 (2016) no. 4, pp. 102-115. http://geodesic.mathdoc.fr/item/DA_2016_23_4_a3/