0
TECHNICAL PAPERS

Nesting Arbitrary Shapes Using Geometric Mating

[+] Author and Article Information
Chan Yu

Souran Manoochehri

Design and Manufacturing Institute, Department of Mechanical Engineering, Stevens Institute of Technology, Hoboken, NJ 07030

J. Comput. Inf. Sci. Eng 2(3), 171-178 (Jan 02, 2003) (8 pages) doi:10.1115/1.1527658 History: Received October 01, 2001; Revised October 01, 2002; Online January 02, 2003
Copyright © 2002 by ASME
Your Session has timed out. Please sign back in to continue.

References

Zhang, X., and Zhou, J., 1995, “A Heuristic Method for Two-dimensional Layout Problems,” in ASME Design Engineering Technical Conferences, Vol. DE-Vol. 82-1.
Fujita, K., Akagi, S., and Hirokawa, N., 1993, “Hybrid Approach for Optimal Nesting Using a Genetic Algorithm and a Local Minimization Algorithm,” ASME Advances in Design Automation DE-Vol. 65-1.
Jain, S., and Gea, H. C., 1996, “Two-dimensional Packing Problems Using Genetic Algorithms,” Proceedings of the 1996 ASME Design Engineering Technical Conference and Computers in Engineering Conference.
Li, Z., 1994, “Compaction Algorithms for Non-Convex Polygons and Their Applications,” PhD thesis, Harvard University.
Milenkovic, V. J., 1997, “Rotational Polygon Overlap Minimization,” Proceedings of the 13th Annual Symposium on Computational Geometry (SoCG).
Daniels, K. M., 1995, “Containment Algorithms for Non-convex Polygons with Applications to Layout,” PhD thesis, Harvard University, Cambridge, Massachusetts.
Daniels, K., and Milenkovic, V. J., 1996, “Column-based Strip Packing Using Ordered and Compliant Containment,” International Journal on Computational Geometry and Applications (IJCGA). Special issue on Applied Computational Geometry.
Van Camp,  D. J., Carter,  M. W., and Vannelli,  A., 1991, “A Nonlinear Optimization Approach for Solving Facility Layout Problems,” Eur. J. Oper. Res., 57, pp. 174–189.
Heragu,  S. S., and Alfa,  A. S., 1992, “Experimental Analysis of Simulated Annealing Based Algorithms for the Layout Problem,” Eur. J. Oper. Res., 57, 190–202.
Yu, C., and Manoochehri, S., 2000, “Optimal Layout of Irregularly Shaped Objects,” ASME Design Engineering Technical Conferences & Computers and Information in Engineering Conference, Baltimore, MD.
Yu, C., and Manoochehri, S., 1999, “Overlap Detection Using Minkowski Sum in Two-dimensional Layout,” Proceedings of ASME Design Engineering Technical Conferences and Design Automation Conference, LasVegas, NV.
de Berg, M., van Kreveld, M., Overmars, M., and Schwarzkopf, O., 1997, Computational Geometry: Algorithms and Applications, Springer.

Figures

Grahic Jump Location
Nesting result by multiple mating
Grahic Jump Location
Containment problem of star shapes
Grahic Jump Location
Mating of two concave objects
Grahic Jump Location
Vertex cutting of single concave point case
Grahic Jump Location
Geometric mating process
Grahic Jump Location
Edge definitions of a decomposed object
Grahic Jump Location
Two objects A and B and their edge vector diagram
Grahic Jump Location
The coding scheme of a mating pair
Grahic Jump Location
A nesting problem of orthogonal shapes
Grahic Jump Location
Nesting result of orthogonal shapes
Grahic Jump Location
Nesting problem of sheet metal parts
Grahic Jump Location
Nesting result by single mating only

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In