Sciweavers

279 search results - page 44 / 56
» Implicit Convex Polygons
Sort
View
SIGGRAPH
1992
ACM
13 years 11 months ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder
ICASSP
2008
IEEE
14 years 2 months ago
Reconstructing sparse signals from their zero crossings
Classical sampling records the signal level at pre-determined time instances, usually uniformly spaced. An alternative implicit sampling model is to record the timing of pre-deter...
Petros Boufounos, Richard G. Baraniuk
IJCV
2006
194views more  IJCV 2006»
13 years 7 months ago
Reconstructing Open Surfaces from Image Data
In this paper a method for fitting open surfaces to data obtained from images is presented using a level set representation of the surface. This is done by tracking a curve, repres...
Jan Erik Solem, Anders Heyden
ICALP
1990
Springer
13 years 11 months ago
Determining the Separation of Preprocessed Polyhedra - A Unified Approach
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our e...
David P. Dobkin, David G. Kirkpatrick
ECCV
2010
Springer
13 years 10 months ago
Optimum Subspace Learning and Error Correction for Tensors
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...