Minimizing support structures and trapped area in two-dimensional layered manufacturing

Computational Geometry: Theory and Applications

Volumn 12, Issue 3-4, 1999, Pages 241-267

  Majhi, Jayanth ^a   Janardan, Ravi ^b   Schwerdt, Jörg ^c   Smid, Michiel ^c,d   Gupta, Prosenjit ^e  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b University of Minnesota   (United States)

^c OTTO VON GUERICKE UNIVERSITY   (Germany)

^d KING'S COLLEGE LONDON   (United Kingdom)

^e MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Computational geometry; Layered manufacturing; Optimization

Indexed keywords

EID: 0000285938     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00003-6     Document Type: Article

References (14)

1. S. Allen, D. Dutta, Determination and evaluation of support structures in layered manufacturing, J. Design Manufacturing 5 (1995) 153-162.
2. E.M. Arkin, Y.-J. Chiang, M. Held, J.S.B. Mitchell, V. Sacristan, S.S. Skiena, T.-C. Yang, On minimum-area hulls, in: Proc. 4th Annu. European Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 1136, Springer, Berlin, 1996, pp. 334-348.
3. B. Asberg, G. Blanco, P. Bose, J. Garcia-Lopez, M. Overmars, G. Toussaint, G. Wilfong, B. Zhu, Feasibility of design in stereolithography, Algorithmica 19 (1997) 61-83.
4. B. Chazelle, Triangulating a simple polygon in linear time, Discrete Comput. Geom. 6 (1991) 485-524.
5. B. Chazelle et al., Application challenges to computational geometry: CG impact task force report, Technical Report TR-521-96, Princeton University, 1996.
6. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Berlin, 1987.
7. H. Freeman, R. Shapira, Determining the minimum-area encasing rectangle for an arbitrary closed curve, Commun. ACM 18 (1975) 409-413.
8. L.J. Guibas, J. Hershberger, D. Leven, M. Sharir, R.E. Tarjan, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica 2 (1987) 209-233.
9. J. Hershberger, S. Suri, A pedestrian approach to ray shooting: Shoot a ray, take a walk, J. Algorithms 18 (1995) 403-431.
10. P. Jacobs, Rapid Prototyping & Manufacturing: Fundamentals of StereoLithography, McGraw-Hill, 1992.
11. J. Majhi, R. Janardan, M. Smid, P. Gupta, On some geometric optimization problems in layered manufacturing, in: Proc. 5th Workshop Algorithms Data Struct., Lecture Notes in Computer Science, Vol. 1272, Springer, Berlin, 1997, pp. 136-149.
12. J. Majhi, R. Janardan, M. Smid, P. Gupta, On some geometric optimization problems in layered manufacturing, Computational Geometry 12 (3-4) (1999) 219-239.
13. J. O'Rourke, Computational Geometry in C, Cambridge University Press, 1994.
14. G.T. Toussaint, A linear-time algorithm for solving the strong hidden-line problem in a simple polygon, Pattern Recogn. Lett. 4 (1986) 449-451.