Filling polyhedral molds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 709 LNCS, Issue , 1993, Pages 210-221

  Bose, Prosenjit ^a   Van Kreveld, Marc ^a   Toussaint, Godfried ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DATA STRUCTURES; GEOMETRY; SURFACE DEFECTS;

AIR BUBBLES; INJECTION PROCESS; LINEAR-TIME ALGORITHMS; LOCAL MAXIMUM; LOCAL REGULARITY; MANUFACTURING INDUSTRIES;

MOLDS;

EID: 84934376409     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57155-8_249     Document Type: Conference Paper

References (19)

1. Bose, P., M. van Kreveld, and G. Toussaint, Filling polyhedral molds. Tech. Rep. No. SOCS 93.1, School of Computer Science, McGill University, 1993.
2. Bose, P., and G. Toussaint, Geometric and computational aspects of injection molding. Tech. Rep. No. SOCS 92.16, School of Computer Science, McGill University, 1992.
3. Bown, J., Injection Moulding of Plastic Components. McGraw-Hill, England, 1979.
4. Chazelle, B., Triangulating a simple polygon in linear time. Proc. 31st IEEE Symp. Found. Comp. Science (1990), pp. 220–230.
5. Chazelle, B., and H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane. J. ACM 39 (1992), pp. 1–54.
6. Dobkin, D., and S. Reiss, The Complexity of Linear Programming. Theoretical Computer Science 11 (1980), pp. 1–18.
7. CrossRefEdelsbrunner, H., Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
8. Fekete, S., and J. Mitchell, Geometric aspects of injection molding. Manuscript, 1993.
9. 2) difficult problems in computational geometry. Tech. Report, Dept. of Computer Science, Utrecht University, 1993, to appear.
10. Hui, K.C., and S.T. Tan, Mould design with sweep operations — a heuristic search approach. C.A.D., 24-2: 81–90, 1992.
11. van Kreveld, M., Fat partitioning, fat covering and the union size of polygons. Tech. Rep. No. SOCS 93.2, School of Computer Science, McGill University, 1993. Extended abstract in these proceedings.
12. Matoušek, J., N. Miller, J. Pach, M. Sharir, S. Sifrony, and E. Welzl, Fat triangles determine linearly many holes. Proc. 32nd IEEE Symp. Found. Comp. Science (1991), pp. 49–58.
13. McCallum, D. and D. Avis, A linear time algorithm for finding the convex hull of a simple polygon. Inform. Process. Lett. 8, (1979), pp. 201–205.
14. Megiddo, N., Linear-time algorithms for linear programming in R 3 and related problems. SIAM J. Comp. 12 (1983), pp. 759–776.
15. Melkman, A., On-line construction of the convex hull of a simple polyline. Inform. Process. Lett. 25, (1987), pp. 11–12.
16. Preparata, F.P., and M.I. Shamos, Computational geometry — an introduction. Springer-Verlag, New York, 1985.
17. Pribble, W.I., Molds for reaction injection, structural foam and expandable styréne molding. In: Plastics mold engineering handbook, J.H. DuBois and W.I. Pribble (Eds.), Van Nostrand Reinhold Company Inc., New York, 1987.
18. Sharir, M., On k-sets in arrangements of curves and surfaces. Discr. & Comp. Geom. 6 (1991), pp. 593–613.
19. Toussaint, G., Movable Separability of Sets. In: Computational Geometry, North-Holland, New York, (1990), pp. 335–375.