Minimum convex partitions of multidimensional polyhedrons
In a normed space Rn over the field of real numbers ℜ, which is an α-space [26, 29], one derives the formula expressing the minimum number of d-convex pieces into which a geometric n-dimensional polyhedron can be partitioned. The mentioned problem has been kept unsolvable for more than 30 years. The...
Sparad:
| Huvudupphov: | |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Utgiven: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2007-11-01
|
| Serie: | Computer Science Journal of Moldova |
| Ämnen: | |
| Länkar: | http://www.math.md/files/csjm/v15-n3/v15-n3-(pp288-302).pdf |
| Taggar: |
Inga taggar, Lägg till första taggen!
|