Problema reprezentării domeniilor poligonale ca reuniune a unui număr minim de poligoane convexe
Închide
Articolul precedent
Articolul urmator
240 0
Căutarea după subiecte
similare conform CZU
514.116 (3)
Geometrie (103)
SM ISO690:2012
PRISĂCARU, Anatol. Problema reprezentării domeniilor poligonale ca reuniune a unui număr minim de poligoane convexe. In: 30 years of economic reforms in the Republic of Moldova: economic progress via innovation and competitiveness, 24-25 septembrie 2021, Chişinău. Chișinău, Republica Moldova: Academia de Studii Economice din Moldova, 2022, Vol.3, pp. 199-207. ISBN 978-9975-155-60-1. DOI: https://doi.org/10.53486/9789975155663.23
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
30 years of economic reforms in the Republic of Moldova: economic progress via innovation and competitiveness
Vol.3, 2022
Conferința "30 years of economic reforms in the Republic of Moldova: economic progress via innovation and competitiveness"
Chişinău, Moldova, 24-25 septembrie 2021

Problema reprezentării domeniilor poligonale ca reuniune a unui număr minim de poligoane convexe

The problem of representation of a poligonal domain as a union of the minimum number of convex poligons

DOI: https://doi.org/10.53486/9789975155663.23
CZU: 514.116
JEL: C 65

Pag. 199-207

Prisăcaru Anatol
 
Academia de Studii Economice din Moldova
 
Disponibil în IBN: 13 mai 2022


Rezumat

The problem of partition of a poligonal domain with arbitrary holes into a minimal number of convex parts is solved. It is show that this minimal number equals m+c-h-e, where m, c, h and e are respectively the measure of local nonconvexity, the number of connected components, the number of formal holes, and the effective number of region.

Cuvinte-cheie
Metric, metric space, d-segment, Convex set, convex hull, graph, k-partite graph