RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., 2016 Volume 23, Issue 4, Pages 102–115 (Mi da859)

This article is cited in 30 papers

Solving some vector subset problems by Voronoi diagrams

V. V. Shenmaier

Sobolev Institute of Mathematics, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia

Abstract: 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, polynomial-time algorithm.

UDC: 519.176

Received: 20.05.2016
Revised: 15.06.2016

DOI: 10.17377/daio.2016.23.526


 English version:
Journal of Applied and Industrial Mathematics, 2016, 10:4, 560–566

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024