The computation of the minimum distance between two objects is an important problem in the applications such as haptic rendering, CAD/CAM, NC veri cation, robotics and computer graphics. This paper presents a method to compute the minimum distance between a canal surface and a simple surface (that is, a plane, a natural quadric, or a torus) by nding roots of a function of a single parameter. We...

This paper introduces a novel method for face recognition based on multiple images. When multiple images are considered, the face recognition problem is defined as taking a set of face images from an unknown person and finding the most similar set among the database of labeled image sets. Our proposed method approximates each image set with a geometric convex model (affine/convex hulls) by usin...

In this paper, we present an efficient algorithm for computing the Euclidean skeleton of an object directly from a point cloud representation on an underlying grid. The key point of this algorithm is to identify those grid points that are (approximately) on the skeleton using the closest point information of a grid point and its neighbors. The three main ingredients of the algorithm are: (1) co...

We have developed simple algorithms that allow adjacency and proximity searching in Google and the Science Citation Index (SCI). The SCI algorithm exploits the fact that SCI stopwords in a search phrase function as a placeholder. Such a phrase serves effectively as a fixed adjacency condition determined by the number n of adjacent stopwords (i.e., retrieve all records where word A and word B ar...

It has been argued in [7] that using automated provers such as AProVE [4] and CSI [3] can benefit research projects on the topic of datatype defining rewrite systems (DDRSs), as the size of these DDRSs make manual completeness proofs long and error-prone. The authors of [7] note that no similar software exists for the ground-confluence property, and in [1] it is argued that such software should...

A reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k closest points. In recent years, considerable research has been conducted into monitoring reverse k nearest neighbor queries. In this paper, we study the problem of continuous reverse nearest neighbor queries where both the query object q and data objects are moving. Existing state-of-the-art t...

Consider a set of geometric objects, such as points, line segments, or axesparallel hyperrectangles in IR, that move with constant but possibly different velocities along linear trajectories. Efficient algorithms are presented for several problems defined on such objects, such as determining whether any two objects ever collide and computing the minimum inter-point separation or minimum diamete...

Tracking human pose in real-time is a difficult problem with many interesting applications. Existing solutions suffer from a variety of problems, especially when confronted with unusual human poses. In this paper, we derive an algorithm for tracking human pose in real-time from depth sequences based on MAP inference in a probabilistic temporal model. The key idea is to extend the iterative clos...

conclusions this rare observation supports the role of immunosuppressive therapy in preventing the recurrence of life-threatening vascular lesions in the management of behcet’s disease. introduction arterial involvement in behcet’s disease has been previously described. we report a rare case of a large and long-segment thoracoabdominal aneurysm, which was associated with behcet’s disease and ha...

arteriovenous fistulae traditionally have been placed in the upper extremity. experience with groin hemodialysis access has been discouraging because of high infection rates and associated limb amputation. the aim of this study was to determine infection rates, patency rates, and possible predictive factors for prosthetic thigh angioaccess outcomes in our hemodialysis patient population. a pros...