Sciweavers

557 search results - page 51 / 112
» On the set multi-cover problem in geometric settings
Sort
View
AFRIGRAPH
2009
ACM
15 years 5 months ago
Analytic simplification of animated characters
Traditionally, levels of detail (LOD) for animated characters are computed from a single pose. Later techniques refined this approach by considering a set of sample poses and eval...
Bruce Merry, Patrick Marais, James E. Gain
140
Voted
CORR
2006
Springer
242views Education» more  CORR 2006»
15 years 1 months ago
Matching Edges in Images ; Application to Face Recognition
: This communication describes a representation of images as a set of edges characterized by their position and orientation. This representation allows the comparison of two images...
Joël Le Roux, Philippe Chaurand, Mickael Urru...
CVPR
2005
IEEE
16 years 3 months ago
Bayesian 3D Modeling from Images Using Multiple Depth Maps
This paper addresses the problem of reconstructing the geometry and color of a Lambertian scene, given some fully calibrated images acquired with wide baselines. In order to compl...
Pau Gargallo, Peter F. Sturm
CCCG
2006
15 years 3 months ago
Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts
In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the o...
R. Sharathkumar, Prosenjit Gupta
CCCG
2009
15 years 2 months ago
Clarkson's Algorithm for Violator Spaces
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
Yves Brise, Bernd Gärtner