Cutting a Convex Polyhedron Out of a Sphere

Syed Ishtiaque Ahmed; Masud Hasan; Md. Ariful Islam

doi:10.1007/s00373-011-1018-1

Back

Cutting a Convex Polyhedron Out of a Sphere

Journal article

Peer reviewed

Cutting a Convex Polyhedron Out of a Sphere

Syed Ishtiaque Ahmed, Masud Hasan and Md. Ariful Islam

Graphs and combinatorics, Vol.27(3), pp.307-319

01/05/2011

DOI: https://doi.org/10.1007/s00373-011-1018-1

Abstract

Mathematics

Physical Sciences

Science & Technology

Given a convex polyhedron P of n vertices inside a sphere Q, we give an O(n (3))-time algorithm that cuts P out of Q by using guillotine cuts and has cutting cost O(log(2) n) times the optimal.

Metrics

1 Record Views

Details

Title: Cutting a Convex Polyhedron Out of a Sphere
Creators - without role: Syed Ishtiaque Ahmed - Bangladesh University
Masud Hasan - Bangladesh University of Engineering and Technology
Md. Ariful Islam - Bangladesh University
Publication Details: Graphs and combinatorics, Vol.27(3), pp.307-319
Publisher: Springer Nature
Number of pages: 13
Identifiers: 9929908008331
Academic Unit: Taibah University
Language: English
Resource Type: Journal article