pith. sign in

arxiv: 0902.3208 · v1 · submitted 2009-02-18 · 💻 cs.DS · cs.MS· cs.NA

A Fast Multigrid Algorithm for Energy Minimization Under Planar Density Constraints

classification 💻 cs.DS cs.MScs.NA
keywords problemalgorithmconstraintsdensityminimizationmultigridplanarunder
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.