A class of network optimization methods for planar grid generation

DOI10.1016/j.apnum.2004.08.004zbMath1061.65132OpenAlexW2045813644MaRDI QIDQ1763629

Nadaniela Egidi, Pierluigi Maponi

Publication date: 22 February 2005

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2004.08.004

zbMATH Keywords

numerical examplesGrid generation problemMinimum cost flow problemnetwork optimization problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items (4)

A robust direct variational approach for generation of quadrangular and triangular grids on planar domains ⋮ The heat equation as grid smoothing in a local optimization procedure ⋮ An active set strategy to generate quadrilateral grids ⋮ Block decomposition techniques in the generation of adaptive grids

Uses Software

• LSNNO
• UNAMALLA

Cites Work

• On large scale nonlinear network optimization
• Linear complexity hexahedral mesh generation
• A generalized length strategy for direct optimization in planar grid generation
• A practical guide to direct optimization for planar grid-generation
• Grid generation: Past, present, and future
• Full-FAS multigrid grid generation algorithms
• Application of notions and relations of differential geometry to grid generation
• LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems
• A Framework for Variational Grid Generation: Conditioning the Jacobian Matrix with Matrix Norms
• Some experiences on orthogonal grid generation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of network optimization methods for planar grid generation