Abstract
In the manufacturing industry, finding an orientation for a mould that eliminates surface defects and ensures a complete fill after the termination of the gravity casting process is an important and difficult problem which has not previously been investigated formally. The paper initiates the study of the gravity casting process from a geometric perspective and presents an optimal θ(n log n) time algorithm that solves this problem in 2D given an object of size n. The paper also characterizes the object shapes (modelled as simple polygons) that can be 1-filled and relate fillability to well known classes of polygons. For certain classes of objects, an optimal direction of fillability can be determined in linear time.
Original language | English (US) |
---|---|
Pages (from-to) | 455-464 |
Number of pages | 10 |
Journal | Computer-Aided Design |
Volume | 27 |
Issue number | 6 |
DOIs | |
State | Published - Jun 1995 |
Keywords
- algorithms
- computational geometry
- gravity casting
ASJC Scopus subject areas
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
- Industrial and Manufacturing Engineering