We introduce a sweep-based hand shape adaptation algorithm to fit a generic sweep-based hand model to the shape of an individual’s hand, presented as a single photograph. The sweep trajectory curves of the generic hand model are modified to interpolate a sequence of keyframes determined by target features. Details of the real hand can be transferred to the model by adjusting its sweep displacem...

1 Introduction

We consider the problem of transposition and time-warp invariant (TTWI) polyphonic content-based music retrieval (CBMR) in symbolically encoded music. For this setting, we introduce two new algorithms based on dynamic programming. Given a query point set, of sizem, to be searched for in a database point set, of size n, and applying a search window of width w, our algorithms run in time O(mnw) f...

The problem of matching sets of points or sets of horizontal line segments in plane under translations is considered. For finding the exact occurrences of a point set of size m within another point set of size n we give an algorithm with running time O(mn), and for finding partial occurrences an algorithm with running time O(mn logm). To find the largest overlap between two line segment pattern...

Lazy Sweep Ray Casting is a fast algorithm for rendering general irregular grids. It is based on the sweep-plane paradigm, and it is able to accelerate ray casting for rendering irregular grids, including disconnected and nonconvex (even with holes) unstructured irregular grids with a rendering cost that decreases as the “disconnectedness” decreases. The algorithm is carefully tailored to explo...

Sweeping has become the workhorse algorithm for creating conforming hexahedral meshes of complex models. This paper describes progress on the automatic, robust generation of MultiSwept meshes in CUBIT. MultiSweeping extends the class of volumes that may be swept to include those with multiple source and multiple target surfaces. While not yet perfect, CUBIT’s MultiSweeping has recently become m...

We present a new algorithm for triangulating simple polygons that has four advantages over previous solutions [GJPT, Ch]. a) It is faster: Whilst previous solutions worked in time O(nlogn), the new algorithm only needs time O(n+rlogr) where r is the number of concave angles of the polygon. b) It works for a larger class of inputs: Whilst previous solutions worked for simple polygons, the new al...

Many geometric algorithms that are usually formulated for points and segments generalize easily to inputs also containing rays and lines. The sweep algorithm for segment intersection is a prototypical example. Implementations of such algorithms do, in general, not extend easily. For example, segment endpoints cause events in sweep line algorithms, but lines have no endpoints. We describe a gene...

Let and be two sets of -monotone and non-intersecting curve segments, and . We give a new sweep-line algorithm that reports the intersecting pairs of segments of . Our algorithm uses only three simple predicates that allow to decide if two segments intersect, if a point is left or right to another point, and if a point is above, below or on a segment. These three predicates seem to be the simpl...