|
This article is cited in 30 scientific papers (total 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.
Received: 20.05.2016 Revised: 15.06.2016
Citation:
V. V. Shenmaier, “Solving some vector subset problems by Voronoi diagrams”, Diskretn. Anal. Issled. Oper., 23:4 (2016), 102–115; J. Appl. Industr. Math., 10:4 (2016), 560–566
Linking options:
https://www.mathnet.ru/eng/da859 https://www.mathnet.ru/eng/da/v23/i4/p102
|
Statistics & downloads: |
Abstract page: | 282 | Full-text PDF : | 272 | References: | 33 | First page: | 5 |
|