Putting objects into a cylindrical/rectangular bounded volume

Abstract In this paper, an algorithm is presented to check whether a given object fits inside a cylindrical bounded volume. The proposed algorithm uses an iterative approach to solve the problem. The proposed algorithm can be used in another well-known optimization problem, smallest enclosing cylinder of an object (or a 3D point set) in terms of diameter or height. A straightforward application is for checking whether a given object is producible (in terms of size) inside the manufacturing chamber of a rapid prototyping machine which has a cylindrical production chamber. If the object can be put into the bounded volume of the building envelope, it can be built from the RP machine. The algorithm can also be used to check whether an object can be made from standard sized stock materials.

[1]  Marek Teichmann,et al.  Smallest enclosing cylinders , 1996, SCG '96.

[2]  Chi-keung Chan,et al.  Minimum bounding boxes and volume decomposition of CAD models , 2003 .

[3]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[4]  Pankaj K. Agarwal,et al.  Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions , 1991, Comput. Geom..

[5]  Andrew M. Day.  The implementation of an algorithm to find the convex hull of a set of three-dimensional points , 1990, TOGS.

[6]  Raimund Seidel,et al.  How Good Are Convex Hull Algorithms? , 1997, Comput. Geom..

[7]  James Arvo,et al.  A survey of ray tracing acceleration techniques , 1989 .

[8]  Edgar A. Ramos.  Deterministic algorithms for 3-D diameter and some 2-D lower envelopes , 2000, SCG '00.

[9]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[10]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[11]  C. Chan,et al.  Determination of the minimum bounding box of an arbitrary solid: an iterative approach , 2001 .

[12]  Sariel Har-Peled,et al.  A practical approach for computing the diameter of a point set , 2001, SCG '01.

[13]  Jesús García-López,et al.  Fitting a Set of Points by a Circle , 1997, SCG '97.

[14]  Timothy M. Chan.  Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus , 2000, SCG '00.

[15]  Jorge Urrutia,et al.  On circles containing the maximum number of points , 1996, Discret. Math..

[16]  Ralph R. Martin,et al.  Putting objects into boxes , 1988 .

[17]  Micha Sharir,et al.  Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions , 1997, SODA '97.

[18]  Herbert Freeman,et al.  Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.

[19]  Jirí Matousek,et al.  On Enclosing k Points by a Circle , 1995, Inf. Process. Lett..