On the Minimum Slicing Problem
Given an arbitrary small rigid object enclosed by another arbitrary rigid object and the inner object could not be seen from the outside of the outer object, the minimum slicing problem is to find the smallest numbers of slices that has to be made across the objects before the
longest length between two points on the perimeter of the inner object is found. General, trivial solution to this problem is by brute-force method of infinite slice. Non-trivial solution is via Sylow’s Geometric Group Theorem.
Keywords: Group Theory; LB Slicing Problem; Sylow’s Theorem
Document Type: Research Article
Affiliations: 1: FRICS Labs, Faculty of Engineering, Universiti Malaysia Sabah, Kota Kinabalu, Sabah, Malaysia 2: Faculty of Computing and Informatics, Universiti Malaysia Sabah, Kota Kinabalu, Sabah, Malaysia
Publication date: 01 November 2017
- ADVANCED SCIENCE LETTERS is an international peer-reviewed journal with a very wide-ranging coverage, consolidates research activities in all areas of (1) Physical Sciences, (2) Biological Sciences, (3) Mathematical Sciences, (4) Engineering, (5) Computer and Information Sciences, and (6) Geosciences to publish original short communications, full research papers and timely brief (mini) reviews with authors photo and biography encompassing the basic and applied research and current developments in educational aspects of these scientific areas.
- Editorial Board
- Information for Authors
- Subscribe to this Title
- Ingenta Connect is not responsible for the content or availability of external websites
- Access Key
- Free content
- Partial Free content
- New content
- Open access content
- Partial Open access content
- Subscribed content
- Partial Subscribed content
- Free trial content