We present a user-friendly suggestive interface for sketch-based character posing. Our interface provides suggestive information on the sketching canvas in succession by combining image retrieval technique with 3D character posing, while the user is drawing. The system highlights the canvas region where the user should draw on and constrains the user’s sketches in a reasonable solution space. T...

We present a PRAM algorithm to approximate the Voronoi diagram of line segments for a grid of points in the plane. The algorithm combines ideas from computer graphics and from hierarchical approximation algorithms. We analyze the complexity and report on experimental results of an implementation on a PRAM simulator. The algorithm can be extended to other types of objects and distance metrics. W...

Then, for querying and manipulating, several languages will be presented, namely SKETCH, CIGALES for spatial querying, and LVIS for spatio-temporal querying and manipulating. For instance LVIS has some interesting mechanisms for describing spatio-temporal criteria by means of an anchor/balloon mechanism. By nature, visual queries can sometimes present ambiguities: some solutions to solve this p...

Existing sketches often have low memory efficiencies when performing per-flow measurement tasks on skewed IP streams. In this paper, we propose Diamond Sketch, a novel sketch that dynamically assigns an appropriate number of atom sketches to each flow on demand, improving the accuracy considerably while keeping a comparable speed.

The pursuit of general structure theorems on algebraic varieties often leads naturally to questions of classification. One approach to such theorems is via the notion of birational equivalence, and more specifically, can be broken into the following two steps: (i) Understand the relationship between any two birationally equivalent varieties. (ii) Find natural “simplest” representatives of every...

Given a set P of non-intersecting polygonal obstacles in R defined with n vertices, we compute a sketch Ω of P whose size is independent of n. We utilize Ω to devise an algorithm to compute a (1 + )-approximate Euclidean shortest path between two points given with the description of P. When P comprises of convex polygonal obstacles, we devise a (2 + )approximation algorithm to efficiently answe...