Extreme points of a large 3D point set along multiple directions

Abstract In reverse engineering CAD modeling, a facet model is usually constructed from a large point cloud data which are obtained from a surface scanning process. The number of points in the point cloud data may range from hundred thousands to several millions depending on the user-defined precision. As a result, the facet model becomes very ‘large’ in terms of number of facets or vertices. The computational effort required to manipulate such a large set of data becomes enormous. This effort is significant even for some simple operations, e.g. rotating, scaling and translation. In this paper, an algorithm is proposed to determine the extreme points in a large 3D point set along multiple directions. This algorithm uses a cylindrical grid approximation technique to give both approximate solution and exact solution. This algorithm can be used to accelerate the computational process of some geometric problems on a large model, e.g., the minimum bounding box of a facet model [Comput Aid Des 20 (1988) 506; Comput Struct 79I (2001) 1433; Int J Comput Inform Sci 14 (1985) 183] and the ‘fitness’ problem of a model into a bounded volume [Comput Aid Des 20 (1988) 506].

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

[2]  Herbert Edelsbrunner,et al.  Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane , 1985, Inf. Process. Lett..

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

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

[5]  Alberto Borobia.  (0, ½, 1) matrices which are extreme points of the generalized transitive tournament polytope , 1995 .

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

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

[8]  Richard W. Cottle,et al.  Linear Complementarity Problem. , 1992 .

[9]  Joseph O'Rourke,et al.  Finding minimal enclosing boxes , 1985, International Journal of Computer & Information Sciences.

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

[11]  Kristin P. Bennett,et al.  Hybrid extreme point tabu search , 1998, Eur. J. Oper. Res..

[12]  Singularly positive definite sequences and parametrization of extreme points , 1996 .

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

[14]  Bharat K. Soni,et al.  Solution adaptive grid strategies based on point redistribution , 2000 .

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

[16]  Kanti Swarup,et al.  Extreme point programming with nonlinear constraints , 1973, Discret. Math..

[17]  Sariel Har-Peled,et al.  Efficiently approximating the minimum-volume bounding box of a point set in three dimensions , 1999, SODA '99.

[18]  Sanjit Chatterjee,et al.  A note on finding extreme points in multivariate space , 1990 .

[19]  Jichun Li,et al.  A simple efficient algorithm for interpolation between different grids in both 2D and 3D , 2002, Math. Comput. Simul..

[20]  On the extreme points of the majorization polytope Ω3(y ≺ x) , 1998 .

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

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