A decomposition-based approach to layered manufacturing

  • Authors:

  • Ivaylo Ilinkin;Ravi Janardan;Jayanth Majhi;Jörg Schwerdt;Michiel Smid;Ram Sriram

  • Affiliations:

  • Department of Computer Science & Engineering, University of Minnesota, Minneapolis, MN;Department of Computer Science & Engineering, University of Minnesota, Minneapolis, MN;Synopsys Corporation, 700 East Middlefield Road, Mountain View, CA;Algorithmic Solutions Software GmbH, Postfach 15 11 01, 66041 Saarbrücken, Germany;School of Computer Science, Carleton University, Ottawa, ON, Canada, K15 5B6;National Institute of Standards and Technology, Gaithersburg, MD

  • Venue:
  • Computational Geometry: Theory and Applications
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper introduces a new approach for improving the performance and versatility of Layered Manufacturing (LM), which is an emerging technology that makes it possible to build physical prototypes of 3D parts directly from their computer models using a "3D printer" attached to a personal computer.Current LM processes work by viewing the computer model as a single, monolithic unit. By contrast, the approach proposed here decomposes the model into a small number of pieces, by intersecting it with a suitably chosen plane, builds each piece separately using LM, and then glues the pieces together to obtain the physical prototype. This approach allows large models to be built quickly in parallel. Furthermore, it is very efficient in its use of so-called support structures that are generated by the LM process.This paper presents the first provably correct and efficient geometric algorithms to decompose polyhedral models so that the support requirements (support volume and area of contact) are minimized. Algorithms based on the plane-sweep paradigm are first given for convex polyhedra. These algorithms run in O(n log n) time for n-vertex convex polyhedra and work by generating expressions for the support volume and contact-area as a function of the height of the sweep plane, and optimizing them during the sweep. These algorithms are then generalized to nonconvex polyhedra, which are considerably more difficult due to the complex structure of the supports. It is shown that, surprisingly, non-convex polyhedra can be handled by first identifying certain critical facets using a technique called cylindrical decomposition, and then applying the algorithm for convex polyhedra to these critical facets. The resulting algorithms run in O(n2 log n) time. Also given is a method for controlling the size of the decomposition, so that the number of pieces generated is within a user-specified limit. Experimental results show that the proposed approach can achieve significant reduction in support requirements in both the convex and the non-convex case.