Skip to main navigation
Skip to search
Skip to main content
The Hebrew University of Jerusalem Home
Approve / Request updates on publications
Home
Profiles
Research units
Research output
Prizes
Search by expertise, name or affiliation
Efficient preconditioning of laplacian matrices for computer graphics
Dilip Krishnan
,
Raanan Fattal
, Richard Szeliski
The Rachel and Selim Benin School of Engineering and Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
106
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Efficient preconditioning of laplacian matrices for computer graphics'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Computer Graphics
100%
Multilevel Preconditioning
100%
Laplacian Matrix
100%
High Efficiency
50%
Linear Time
50%
Geodesic Distance
50%
State-of-the-art Techniques
50%
Time Requirement
50%
Sparsification
50%
Memory Requirements
50%
Computer Graphics Applications
50%
Small Systems
50%
Colorization
50%
Processing Task
50%
Problem Features
50%
Discrete Poisson Equations
50%
3D Mesh Processing
50%
Computational Photography
50%
Weak Connection
50%
Edge-preserving Decomposition
50%
Homogeneous Systems
50%
Image Distance
50%
Nearby Connections
50%
Matrix System
50%
Linear Memory
50%
Fine Levels
50%
Computer Science
Computer Graphic
100%
Laplacian Matrix
100%
Computer Graphics Application
50%
Memory Requirement
50%
Computational Photography
50%
Geodesic Distance
50%
Processing Task
50%
Homogeneous System
50%
Operation Count
50%
Condition Number
50%
Time Requirement
50%
Mathematics
Computer Graphic
100%
Laplacian Matrix
100%
Edge
50%
Wide Variety
50%
Linear Time
50%
Poisson Equation
50%
Homogeneous System
50%
Engineering
Computer Graphic
100%
Laplace Operator
100%
Memory Requirement
50%
Linear Time
50%
Condition Number
50%
State-of-the-Art Method
50%
Processing Task
50%