On some geometric optimization problems in layered manufacturing

  • Jayanth Majhi
  • Ravi Janardan
  • Michiel Smid
  • Prosenjit Gupta
Session 5A: Invited Lecture
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1272)

Abstract

Efficient geometric algorithms are given for optimization problems arising in layered manufacturing, where a 3D object is built by slicing its CAD model into layers and manufacturing the layers successively. The problems considered include minimizing the degree of stair-stepping on the surfaces of the manufactured object, minimizing the volume of the so-called support structures used, and minimizing the contact area between the supports and the manufactured object-all of which are factors that affect the speed and accuracy of the process. The stair-step minimization algorithm is valid for any polyhedron, while the support minimization algorithms are applicable to convex polyhedra only. Algorithms are also given for optimizing supports for non-convex, simple polygons. The techniques used include construction and searching of certain arrangements on the sphere, 3D convex hulls, halfplane range searching, ray-shooting, visibility, and constrained optimization.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Allen and D. Dutta. Determination and evaluation of support structures in layered manufacturing. Journal of Design and Manufacturing, 5:153–162, 1995.Google Scholar
  2. 2.
    E.M. Arkin, Y.-J. Chiang, M. Held, J.S.B. Mitchell, V. Sacristan, S.S. Skiena, and T.-C. Yang. On minimum-area hulls. In Proceedings of the 1996 European Symposium on Algorithms, LNCS 1136, Springer-Verlag, Berlin, pages 334–348, 1996.Google Scholar
  3. 3.
    B. Asberg, G. Blanco, P. Bose, J. Garcia-Lopez, M. Overmars, G. Toussaint, G. Wilfong, and B. Zhu. Feasibility of design in stereolithography. In Proceedings of the 13th FST&TCS Conference, 1993.Google Scholar
  4. 4.
    M. Bablani and A. Bagchi. Quantification of errors in rapid prototyping processes and determination of preferred orientation of parts. In Transactions of the 23rd North American Manufacturing Research Conference, 1995.Google Scholar
  5. 5.
    P. Bose. Geometric and computational aspects of manufacturing processes. PhD thesis, School of Computer Science, McGill University, Montréal, Canada, 1995.Google Scholar
  6. 6.
    P. Bose, M. van Kreveld, and G. Toussaint. Filling polyhedral molds. In Proc. 3rd Workshop Algorithms Data Structures, volume 709 of Lecture Notes in Computer Science, pages 210–221. Springer-Verlag, 1993.Google Scholar
  7. 7.
    B. Chazelle et al. Application challenges to computational geometry. Technical Report 521, Princeton University, April 1996. (Also available at http://www.cs.duke. edu/-jeffe/compgeom/taskforce.html).Google Scholar
  8. 8.
    B. Chazelle, L.J. Guibas, and D.T. Lee. The power of geometric duality. BIT, 25:76–90, 1985.Google Scholar
  9. 9.
    H. Edelsbrunner and L. Guibas. Topologically sweeping an arrangement. Journal of Computer and System Sciences, 38:165–194, 1989.Google Scholar
  10. 10.
    D. Frank and G. Fadel. Preferred direction of build for rapid prototyping processes. In Proceedings of the 5th International Conference on Rapid Prototyping, pages 191–200, 1994.Google Scholar
  11. 11.
    A. Gajentaan and M. H. Overmars. On a class of O(n 2) problems in computational geometry. Computational Geometry: Theory & Applications, 5:165–185, 1995.Google Scholar
  12. 12.
    R.N. Goldman. Area of planar polygons and volume of polyhedra. In J. Arvo, editor, Graphics Gems II, pages 170–171. Academic Press, 1991.Google Scholar
  13. 13.
    P. Jacobs. Rapid Prototyping & Manufacturing: Fundamentals of StereoLithography. McGraw-Hill, 1992.Google Scholar
  14. 14.
    D.G. Luenberger. Introduction to Linear and Non-linear Programming. Addison-Wesley, 1973.Google Scholar
  15. 15.
    J. Majhi, R. Janardan, M. Smid, and P. Gupta. On some geometric optimization problems in layered manufacturing. Technical Report TR-97-002, Dept. of Computer Science, University of Minnesota, 1997. Submitted.Google Scholar
  16. 16.
    J. Matougek. Range searching with efficient hierarchical cuttings. Discrete & Computational Geometry, 10:157–182, 1992.Google Scholar
  17. 17.
    M. McKenna and R. Seidel. Finding the optimal shadows of a convex polytope. In Proceedings of the 1st Annual ACM Symposium on Computational Geometry, pages 24–28, 1985.Google Scholar
  18. 18.
    F.P. Preparata and M.I. Shamos. Computational Geometry-An Introduction. Springer-Verlag, 1988.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Jayanth Majhi
    • 1
  • Ravi Janardan
    • 1
  • Michiel Smid
    • 2
  • Prosenjit Gupta
    • 3
  1. 1.Dept. of Computer ScienceUniv. of MinnesotaMinneapolisUSA
  2. 2.Fakultät für InformatikOtto-von-Guericke-Universität MagdeburgMagdeburgGermany
  3. 3.Bell LaboratoriesMurray HillUSA

Personalised recommendations