Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/102384
Title: On some computational problems of constructing piecewise linear approximations of functions with the Delaunay property
Authors: Plotnikov, S.
Popov, L.
Issue Date: 2020
Publisher: IOP Publishing Ltd
Citation: Plotnikov S. On some computational problems of constructing piecewise linear approximations of functions with the Delaunay property / S. Plotnikov, L. Popov. — DOI 10.1088/1742-6596/1680/1/012040 // Journal of Physics: Conference Series. — 2020. — Vol. 1680. — Iss. 1. — 012040.
Abstract: In the article, we discuss issues related to the construction of a piecewise linear approximation of some function, information about which is limited to its values at given points from some finite set. A wide range of tasks from various fields of knowledge leads to such a formulation. A feature of the approach to the problem under consideration is the application of the Delaunay partition methodology, based on linear programming technologies. The goal is to extend this promising methodology to a more wide class of problems without requiring that the convex hull of the set is bodily. © Published under licence by IOP Publishing Ltd.
Keywords: COMPUTATIONAL COMPLEXITY
LINEAR PROGRAMMING
COMPUTATIONAL PROBLEM
CONVEX HULL
DELAUNAY
FINITE SET
PIECEWISE LINEAR APPROXIMATIONS
PIECEWISE LINEAR TECHNIQUES
URI: http://elar.urfu.ru/handle/10995/102384
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 85098577245
PURE ID: 20375641
7331c203-c069-4d14-8329-54d879241140
ISSN: 17426588
DOI: 10.1088/1742-6596/1680/1/012040
Appears in Collections:Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-85098577245.pdf532,82 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.