Minimum d-convex partition of a multidimensional polyhedron with holes
In a normed space Rn over the field of real numbers R, which is an α-space [36, 39], one derives the formula expressing the minimum number of d-convex pieces into which a geometric n-dimensional polyhedron with holes can be partitioned. The problem of partitioning a geometric n-dimensional polyhedro...
| Autore principale: | |
|---|---|
| Natura: | Articolo |
| Lingua: | English |
| Pubblicazione: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2008-11-01
|
| Serie: | Computer Science Journal of Moldova |
| Soggetti: | |
| Accesso online: | http://www.math.md/files/csjm/v16-n3/v16-n3-(pp347-363).pdf |