Sciweavers

98 search results - page 12 / 20
» Linear Approximation of Trimmed Surfaces
Sort
View
ICCV
2001
IEEE
14 years 9 months ago
Lambertian Reflectance and Linear Subspaces
We prove that the set of all Lambertian reflectance functions (the mapping from surface normals to intensities) obtained with arbitrary distant light sources lies close to a 9D lin...
Ronen Basri, David W. Jacobs
IJCV
2000
230views more  IJCV 2000»
13 years 7 months ago
Design and Use of Linear Models for Image Motion Analysis
Linear parameterized models of optical flow, particularly affine models, have become widespread in image motion analysis. The linear model coefficients are straightforward to estim...
David J. Fleet, Michael J. Black, Yaser Yacoob, Al...
FOCS
2009
IEEE
14 years 2 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
COMPGEOM
2006
ACM
14 years 1 months ago
Medial axis approximation and unstable flow complex
The medial axis of a shape is known to carry a lot of information about it. In particular a recent result of Lieutier establishes that every bounded open subset of Rn has the same...
Joachim Giesen, Edgar A. Ramos, Bardia Sadri
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
14 years 2 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...