| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 1087 2 |
| Ultima descărcare din IBN: 2017-04-28 17:42 |
| Căutarea după subiecte similare conform CZU |
| [519.85+514.1]:004 (1) |
| Cercetări operaționale (OR) teorii şi metode matematice (169) |
| Geometrie (103) |
| Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4184) |
 SM ISO690:2012BĂŢ, Ion. Minimum d-convex partition of a multidimensional polyhedron with holes. In: Computer Science Journal of Moldova, 2008, nr. 3(48), pp. 347-363. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 3(48) / 2008 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: [519.85+514.1]:004 | ||||||
| Pag. 347-363 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
In a normed space Rn over the field of real numbers R, which is an α-space [36,39], one derives the formula express ing the minimum number of d-convex pieces into which a geo metric n-dimensional polyhedron with holes can be partitioned. The problem of partitioning a geometric n-dimensional polyhe dron has many theoretical and practical applications in various fields such as computational geometry, image processing, pattern recognition, computer graphics, VLSI engineering, and others [5,10,11,19,21,28,29,31,43]. Mathematics Subject Classification: 68U05, 52A30, 57Q05 |
||||||
| Cuvinte-cheie geometric n-dimensional polyhedron, d-convexity, CW complex dividing |
||||||
|
|
|
|
