Sciweavers

67 search results - page 13 / 14
» Approximate convex decomposition of polygons
Sort
View
ECCV
2004
Springer
14 years 7 months ago
User Assisted Separation of Reflections from a Single Image Using a Sparsity Prior
When we take a picture through transparent glass the image we obtain is often a linear superposition of two images: the image of the scene beyond the glass plus the image of the sc...
Anat Levin, Yair Weiss
FOCM
2011
175views more  FOCM 2011»
13 years 23 days ago
Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
Donald Goldfarb, Shiqian Ma
FLAIRS
2003
13 years 7 months ago
Spatially-Aware Information Retrieval with Graph-Based Qualitative Reference Models
Geo-referenced information is used by a growing number of “spatially-aware” tools in different application areas, including tourism, marketing, environmental management, and m...
Thomas Vögele, Christoph Schlieder
COMGEO
1999
ACM
13 years 5 months ago
Multiresolution hierarchies on unstructured triangle meshes
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...
Leif Kobbelt, Jens Vorsatz, Hans-Peter Seidel
SIGGRAPH
1992
ACM
13 years 9 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