An efficient version of the direct method for planar grid generation
We consider the problem of the grid generation for a generic compact connected domain Ω of the two-dimensional real Euclidean space. This problem can be seen as a finite dimensional version of the extension of a given parameterization of the boundary of Ω to a parameterization of the whole domain Ω....
Main Authors: | Nadaniela Egidi, Pierluigi Maponi |
---|---|
Format: | Article |
Language: | English |
Published: |
Sapienza Università Editrice
2003-01-01
|
Series: | Rendiconti di Matematica e delle Sue Applicazioni |
Subjects: | |
Online Access: | https://www1.mat.uniroma1.it/ricerca/rendiconti/ARCHIVIO/2003(2)/235-256.pdf |
Similar Items
-
A perturbative method for direct scattering problems
by: Nadaniela Egidi, et al.
Published: (2004-01-01) -
An Efficient Extension of Network Simplex Algorithm
by: Hassan Rashidi, et al.
Published: (2010-02-01) -
Flow Network Models for Online Scheduling Real-Time Tasks on Multiprocessors
by: Hyeonjoong Cho, et al.
Published: (2020-01-01) -
Graph theoretical defense mechanisms against false data injection attacks in smart grids
by: Mohammad Hasan ANSARI, et al.
Published: (2018-09-01) -
Traffic flow consideration in design of freight distribution system
by: Sutanto Soehodho, et al.
Published: (2010-07-01)