A fast multigrid algorithm for energy minimization under planar density constraints.
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 a correction to this problem. The method is demonstrated in various graph drawing (visualization) instances.
- Research Organization:
- Argonne National Lab. (ANL), Argonne, IL (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC)
- DOE Contract Number:
- DE-AC02-06CH11357
- OSTI ID:
- 993687
- Report Number(s):
- ANL/MCS/JA-63059; TRN: US1008110
- Journal Information:
- Multiscale Model. Sim., Vol. 8, Issue 5 ; Sep. 7, 2010
- Country of Publication:
- United States
- Language:
- ENGLISH
Similar Records
Approximate and exact algorithms for the maximum planar subgraph problem
A better approximation algorithm for finding planar subgraphs
Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:993687
A better approximation algorithm for finding planar subgraphs
Conference
·
Tue Dec 31 00:00:00 EST 1996
·
OSTI ID:993687
+1 more
Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)
Technical Report
·
Fri Nov 29 00:00:00 EST 2019
·
OSTI ID:993687