Determination of the minimum bounding box of an arbitrary solid: An iterative approach

Computers and Structures

Volumn 79, Issue 15, 2001, Pages 1433-1449

  Chan, C K ^a   Tan, S T ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Bounding box; Convex hull; Iterative; Minimum; Packing; Rapid prototyping

Indexed keywords

COMPUTER SIMULATION; ITERATIVE METHODS; RAPID PROTOTYPING;

BOUNDING BOXES;

STRUCTURAL ANALYSIS;

EID: 0035362904     PISSN: 00457949     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0045-7949(01)00046-3     Document Type: Article

References (17)

1. OBB tree: A hierarchical structure for rapid interference detection
2. The smallest box around a package
3. Automatic bar stock selection for machining
4. Determining the minimum-area encasing rectangle for and arbitrary closed curve
5. Solving geometric problems with the rotating callipers
6. Finding minimal enclosing boxes
7. Putting objects into boxes
8. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
9. Accuracy issues in CAD to RP translations
10. Quasinonparametric surfaces
11. Computing bounding volume hierarchy using model simplification
12. Computing CSG-tree boundaries as algebraic expressions
13. Homogeneous bounding boxes as tools for intersection algorithms of rotational bezier curves and surfaces
14. Determining parting direction based on minimum bounding box and fuzzy logics