Filling polyhedral molds

CAD Computer Aided Design

Volumn 30, Issue 4, 1998, Pages 245-254

  Bose, Prosenjit ^a   van Kreveld, Marc ^b   Toussaint, Godfried ^c  

^a CARLETON UNIVERSITY   (Canada)

^b UTRECHT UNIVERSITY   (Netherlands)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

Algorithms; Casting; Computational geometry; Filling; Polyhedral molds

Indexed keywords

ALGORITHMS; CASTING; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED DESIGN; FILLING; MOLDS; PROBLEM SOLVING;

GRAVITY CASTING; MOLD FILLING; POLYHEDRAL MOLDS;

COMPUTATIONAL GEOMETRY;

EID: 0032045810     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0010-4485(97)00075-4     Document Type: Article

References (23)

1. Bown, J., Injection Moulding of Plastic Components. McGraw-Hill, UK, 1979.
2. Hui, K. C. and Tan, S. T., Mould design with sweep operations - a heuristic search approach. CAD, 1992, 24(2), 81-90.
3. Pribble, W. I., Molds for reaction injection, structural foam and expandable styrene molding. In: Plastics Mold Engineering Handbook, ed J.H. DuBois and W.I. Pribble. Van Nostrand Reinhold Company Inc., New York, 1987.
4. Bose, P. and Toussaint, G., Geometric and computational aspects of gravity casting. Computer-Aided Design, 1995, 27(6), 455-464.
5. Bose, P. and Toussaint, G.. Geometric and computational aspects of manufacturing processes. Computers and Graphics. 1994, 18(4). 487-497.
6. Bose, P., van Krevel, M. and Toussaint, G., Filling polyhedral molds. In Proc. 3rd Workshop Algorithms and Data Struc., LNCS 709, 1993, pp. 210-221.
7. 2) difficult problems in computational geometry. Technical Report, Department of Computer Science, Utrecht University, 1993.
8. O'Rourke, J., Computational Geometry in C. Cambridge University Press, New York, 1994.
9. Edelsbrunner, H., Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
10. Dobkin, D. and Reiss, S., The complexity of linear programming. Theoretical Computer Science. 1980, 11, 1-18.
11. 3 and related problems. SIAM J. Comp., 1983, 12, 759-776.
12. Seidel, R., Linear programming and convex hulls made easy. In Proc. 6th ACM Symp. Comp. Geom., 1990, pp. 211-215.
13. Chazelle. B. and Edelsbrunner, H., An optimal algorithm for intersecting line segments in the plane. J. ACM, 1992, 39, 1-54.
14. Clarkson, K. L., New applications of random sampling in computational geometry. Discr. and Comp. Geom., 1987, 2, 195-222.
15. Mulmuley, K., A fast planar partition algorithm, In Proc. 29th IEEE Symp. Found. Comp. Science, 1988, pp. 580-589.
16. Preparata, F. and Muller, D., Finding the intersection of n half-spaces in time O(nlog n). Theoretical Computer Science, 1979, 8, 45-55.
17. O'Rourke, J., Art Gallery Theorems and Algorithms. Oxford University Press, New York, 1987.
18. Preparata, F. P. and Shamos, M. I., Computational Geometry - An Introduction. Springer-Verlag, New York, 1985.
19. Toussaint, G., Movable separability of sets. In Computational Geometry. North-Holland, New York, 1990. pp. 335-375.
20. van Kreveld, M., Fat dissection and covering, and the union size of polygons, in Proc. 3rd Workshop Algorithms and Data Struc., LNCS 709, 1993, pp. 452-463.
21. Matoušek, J., Miller, N., Pach, J., Sharir, M., Sifrony, S. and Welzl, E., Fat triangles determine linearly many holes. In Proc. 32nd IEEE Symp. Found Comp. Science. 1991, pp. 49-58.
22. Mairson, H. and Stolfi, J., Reporting and counting intersections between two sets of line segments. In Theoretical Foundations of Computer Graphics and CAD, ed R.A. Earnshaw. Vol. F40, pp. 307-325. Springer-Verlag, Berlin, 1988.
23. Edelsbrunner, H. and Guibas, L., Topologically sweeping an arrangement. J. Comp. Sys. Sciences, 1989, 38, 165-194.