A Fast Multigrid Algorithm for Energy Minimization Under Planar Density Constraints

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Fast Multigrid Algorithm for Energy Minimization Under Planar Density Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Fast Multigrid Algorithm for Energy Minimization Under Planar Density Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Fast Multigrid Algorithm for Energy Minimization Under Planar Density Constraints will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-129048

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.