A Fast Multigrid Algorithm for Energy Minimization Under Planar Density Constraints
Data Structures and Algorithms
2009-02-19 v1 Mathematical Software
Numerical Analysis
Abstract
The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a nonlinear minimization problem under planar equality and/or inequality density constraints, we present a linear time multigrid algorithm for solving correction to this problem. The method is demonstrated on various graph drawing (visualization) instances.
Cite
@article{arxiv.0902.3208,
title = {A Fast Multigrid Algorithm for Energy Minimization Under Planar Density Constraints},
author = {Dorit Ron and Ilya Safro and Achi Brandt},
journal= {arXiv preprint arXiv:0902.3208},
year = {2009}
}