Skip to main content
Article thumbnail
Location of Repository

Minimum convex partitions of multidimensional polyhedrons

By Ion Băţ

Abstract

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 special cases for R2 , R3 lead to nontrivial applications [19, 20, 23, 28, 30]. \ud \ud Mathematics Subject Classification: 68U05, 52A30, 57Q0

Topics: Geometric n-dimensional polyhedron, d-convexity, point of local non-d-convexity, polyhedral complex, oriented polytope, dividing, Electronic computers. Computer science, QA75.5-76.95
Publisher: Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
Year: 2007
OAI identifier: oai:doaj.org/article:e11381cd72d54f9cb181294b5dfacf29
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://doaj.org/toc/1561-4042 (external link)
  • http://www.math.md/files/csjm/... (external link)
  • https://doaj.org/article/e1138... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.