title: The problem of a maximal weighted area of axis-parallel rectangle that covers polygons
metadata.name: dc.contributor.author
metadata.value: Shchegoleva, Liudmila V.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Voronov, Roman V.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Sedov, Leonid
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2020-03-05T13:28:04Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2020-03-05T13:28:04Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2019-12
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Shchegoleva L. V., Voronov R. V., Sedov L. The problem of a maximal weighted area of axis-parallel rectangle that covers polygons. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 2019, vol. 15, iss. 4, pp. 592–602.
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: https://doi.org/10.21638/11702/spbu10.2019.414
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/17167
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: The paper presents the problem of finding the optimal location of the rectangle with the
  maximum weighted area. The dimensions of the rectangle are set, the sides of the rectangle
  are parallel to the axes. On the plane, there are non-self-intersecting polygons of arbitrary
  shape with a given density. The weighted area of a rectangle is calculated as a sum of the
  area of the parts of polygons covered by the rectangle multiplied by their densities. The
  algorithm for solving the problem is described. This problem arises when determining the
  places of forest felling when the planned cutting area can be modelled by a rectangle, and
  the polygons describe the areas with same forest taxation, for each of which is known forest
  stock per hectare.
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: en
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Vestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 15; Issue 4
metadata.lang: -
metadata.name: dc.subject
metadata.value: maximizing range sum (MaxRS)
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: maximizing area-range sum
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: maximizing weighted area-range sum
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: polygons
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: The problem of a maximal weighted area of axis-parallel rectangle that covers polygons
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 592-602.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/17167/1/592-602.pdf
resources.format: Adobe PDF
resources.size: 1,34 MB