title: Orthogonal triangulation of polygons
metadata.name: dc.contributor.author
metadata.value: Kalnitsky, Vyacheslav S.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2017-01-05T17:56:12Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2017-01-05T17:56:12Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2016-12
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Kalnitsky V. S. Orthogonal triangulation of polygons. Vestnik of Saint Petersburg University. Series 1. Mathematics. Mechanics. Astronomy, 2016, vol. 3 (61), issue 4, pp. 594–601.
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: 10.21638/11701/spbu01.2016.408
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/5899
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: Triangulation of polygons arises in various applications, such as computer graphics or automatic designing
  systems. One of the goals of triangulation is to replace some, usually convex, polygonal area into fragments,
  for which the test and design tasks are performed by the most simple and unified way. Most of the known
  algorithms work with the triangles. The question of whether or not you can always assume that the
  polygon belongs to a rectangular net and is made up of rectangles and right triangles of the net, perhaps
  for the first time, was placed by N. Yu. Dodonov in connection with the works for the reconstruction
  of parametric surfaces specified with tabular data. Despite the fact that the answer to this question is
  positive for triangles (obviously) and convex quadrilaterals, in this paper it is proved that a 7-dimensional
  space of convex pentagons set of untriangulated 5-gon has a non-empty interior. Thus, it denied even the
  possibility of approximation this polygon by triangulated ones. Refs 3. Figs 5. Tables 2.
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: ru
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. Series 1. Mathematics. Mechanics. Astronomy;Vol. 3 (61); Issue 4
metadata.lang: -
metadata.name: dc.subject
metadata.value: section of polyhedral domains
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: orthogonal net
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: triangulation
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Orthogonal triangulation of polygons
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 08-Kalnitsky.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/5899/1/08-Kalnitsky.pdf
resources.format: Adobe PDF
resources.size: 266,4 kB