A plane drawing of a graph is called a floorplan if every face (including the outer face) is a rectangle. A based floorplan is a floorplan with a designated base line segment on the outer face. In this paper we give a simple algorithm to generate all based floorplans with at most n faces. The algorithm uses O(n) space and generates such floorplans in O(1) time per floorplan without duplications...

To assess facial form, one has to determine the size, position, orientation, shape, and symmetry of the different facial units. Many of these assessments require a frame of reference. The customary coordinate system used for these assessments is the 'standard anatomical frame of reference', a three-dimensional Cartesian system made by three planes: the sagittal, the axial, and the coronal. Cons...

The linear FEAST algorithm is a method for solving linear eigenvalue problems. It uses complex contour integration to calculate the eigenvectors whose eigenvalues that are located inside some user-defined region in the complex plane. This makes it possible to parallelize the process of solving eigenvalue problems by simply dividing the complex plane into a collection of disjoint regions and cal...

A nite new algorithm is proposed for clustering m given points in n-dimensional real space into k clusters by generating k planes that constitute a local solution to the nonconvex problem of minimizing the sum of squares of the 2-norm distances between each point and a nearest plane. The key to the algorithm lies in a formulation that generates a plane in n-dimensional space that minimizes the ...

The problem of collision detection is fundamental to inter active applications such as computer animation and virtual environments In these elds prompt recognition of possible impacts is important for computing real time response We present a simple exact collision detection algorithm for convex polytopes The algorithm nds quickly a separating plane between two polytopes if they are non collidi...

A nite new algorithm is proposed for clustering m given points in n-dimensional real space into k clusters by generating k planes that constitute a local solution to the nonconvex problem of minimizing the sum of squares of the 2-norm distances between each point and a nearest plane. The key to the algorithm lies in a formulation that generates a plane in n-dimensional space that minimizes the ...