Abstract
We consider the problem of partitioning of space by hyperplanes that arises in many application areas, where the number of regions the space is divided into is required to be determined, such as speech/pattern recognition, various classification problems, data analysis. We obtain some relations for the number of divisions and establish a recurrence relation for the maximum number of regions in d-dimensional Euclidean space cut by n hyperplanes. We also re-derive an explicit formula for the number of regions into which the space can be partitioned by n hyperplanes.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
