pith. sign in

arxiv: 2605.27854 · v1 · pith:SYGVHX2Lnew · submitted 2026-05-27 · 🧮 math.NA · cs.NA

An efficient and stable diffusion generated method for quadrilateral mesh generation in general domains

Jingwen Dai , Zhonghua Qiao , Dong Wang This is my paper

Pith reviewed 2026-06-29 11:20 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords quadrilateral mesh generationcross fieldGinzburg-Landau energyFFT diffusiondomain extensioniterative methodmesh quality
0
0 comments X

The pith

Extending complex domains to regular ones allows an FFT-based iterative scheme to minimize a relaxed Ginzburg-Landau energy and generate high-quality quadrilateral meshes without intermediate triangulations.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proposes computing cross fields for quadrilateral meshing by minimizing a modified and relaxed Ginzburg-Landau-type energy functional after extending the original irregular domain to a larger regular computational domain. This extension turns the minimization into an iterative process that alternates global linear diffusion solved via the Fast Fourier Transform with point-wise normalization. The authors prove that the iteration produces unconditional monotonic decay of the objective functional. The resulting meshes are reported to be of high quality across complex geometries while avoiding both triangular mesh intermediates and nonlinear optimization on irregular boundaries.

Core claim

The central claim is that the proposed iterative algorithm for cross-field computation, enabled by domain extension to a regular grid, guarantees unconditional monotonic decay of the objective functional and consistently generates high-quality quadrilateral meshes on general two-dimensional domains.

What carries the argument

Domain extension to a larger regular computational domain, followed by an iteration that alternates FFT-solved linear diffusion with point-wise normalization to minimize the relaxed Ginzburg-Landau-type energy.

If this is right

  • Quadrilateral meshes can be produced on arbitrary 2D geometries without first generating an intermediate triangular mesh.
  • The FFT-based diffusion step replaces nonlinear optimization on irregular domains with two simple, globally efficient operations.
  • Stability follows directly from the proven unconditional monotonic decay of the energy functional at every iteration.
  • The same framework applies uniformly across a wide range of complex shapes without case-by-case adjustments to the solver.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same domain-extension idea could be tested for surface or volumetric mesh generation if a suitable regular embedding can be constructed.
  • Because each iteration is dominated by an FFT, the method may become fast enough for on-the-fly remeshing inside time-dependent simulations.
  • The relaxation parameter in the energy functional offers a possible control knob for trading element size variation against orthogonality.

Load-bearing premise

That extending the original complex domain to a larger regular computational domain preserves the essential properties for cross field computation without introducing boundary artifacts or loss of quality on the original domain.

What would settle it

A side-by-side comparison showing that meshes produced after domain extension have measurably lower quality or element distortion near the original boundary than meshes produced by methods that operate directly on the irregular domain.

Figures

Figures reproduced from arXiv: 2605.27854 by Dong Wang, Jingwen Dai, Zhonghua Qiao.

Figure 1
Figure 1. Figure 1: Procedure of quadrilateral mesh generation using a cross field. From top left to bottom right: (a) [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Examples of irregular points in quadrilateral mesh topology. (a) A valence-3 singularity, and (b) [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Comparison of singularities in vector and cross fields. (a) and (b) show classical vector field [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Domain Ω1 ⊂ Ω2 ⊂ R 2 described by a phase-field function ϕ. See Section 3.1. The generation of cross fields is formulated as a constrained minimization problem of the Dirichlet energy. Ideally, we seek a representation field u ∈ H1 (Ω1; R 2 ) that approximates the solution of (1.1). To address the numerical difficulties imposed by the pointwise unit-norm constraint, we employ an operator splitting strategy… view at source ↗
Figure 5
Figure 5. Figure 5: The process of finding initial conditions for streamline propagation in triangular and quadrilateral [PITH_FULL_IMAGE:figures/full_fig_p013_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Streamline propagation within a structured quadrilateral cell. See Section [PITH_FULL_IMAGE:figures/full_fig_p013_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: (a) Dirichlet energy distribution within the subdomain Ω [PITH_FULL_IMAGE:figures/full_fig_p015_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Evolution of singularity regions in the computed vector field under different values of [PITH_FULL_IMAGE:figures/full_fig_p015_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: (a) Direction field computed by the MBO method. (b) Magnitude of the vectors evaluated at the [PITH_FULL_IMAGE:figures/full_fig_p016_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: (a) Evolution of the singularity radius (b) the corresponding minimized energy as the regular [PITH_FULL_IMAGE:figures/full_fig_p016_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Singularities and streamlines generated by [PITH_FULL_IMAGE:figures/full_fig_p017_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: Left: Streamline partitions generated from the cross field corresponds to [PITH_FULL_IMAGE:figures/full_fig_p017_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: Quad mesh generation results for various geometries. Each row displays: (Left) the input [PITH_FULL_IMAGE:figures/full_fig_p018_13.png] view at source ↗
read the original abstract

This paper introduces a novel, robust, and computationally efficient framework for high-quality quadrilateral mesh generation on general two-dimensional domains. The core of the proposed approach is a novel method for computing cross fields by minimizing a modified and relaxed Ginzburg--Landau-type energy functional. A key innovation is the extension of the problem from the original, potentially complex domain to a larger regular computational domain. This extension transforms the central computational procedure into an iterative scheme that requires only two straightforward and efficient operations: linear diffusion solved globally via the Fast Fourier Transform (FFT) and point-wise normalization. Notably, our method eliminates the conventional need for generating an intermediate triangular mesh or solving complex nonlinear optimization problems on the irregular domain. We provide a rigorous theoretical analysis, proving that the proposed iterative algorithm guarantees unconditional monotonic decay of the objective functional. Comprehensive numerical experiments demonstrate the method's robustness across a wide range of complex geometries, its significant computational efficiency afforded by the FFT-based diffusion, and its consistent generation of high-quality quadrilateral meshes. This work presents a reliable and theoretically sound alternative to existing mesh generation techniques, with strong potential for practical applications in scientific computing.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper claims to introduce an efficient method for quadrilateral mesh generation on general 2D domains via cross-field computation. The approach extends the original irregular domain to a larger regular computational domain, then applies an iterative scheme consisting of global linear diffusion (solved via FFT) followed by pointwise normalization to minimize a modified and relaxed Ginzburg-Landau energy. A rigorous theoretical analysis is asserted to prove unconditional monotonic decay of the objective functional, and numerical experiments are presented to demonstrate robustness, efficiency, and high-quality meshes without requiring intermediate triangular meshes or nonlinear optimization on irregular domains.

Significance. If the claimed unconditional decay holds on the original domain (rather than only the extension) and the numerical results are reproducible across the tested geometries, the work would provide a computationally attractive, FFT-based alternative to existing cross-field methods, with potential impact in scientific computing applications requiring high-quality quadrilateral meshes.

major comments (1)
  1. [Abstract and theoretical analysis section] Abstract and theoretical analysis section: the central claim of unconditional monotonic decay of the objective functional on the geometry of interest rests on the iterative scheme (global FFT diffusion + normalization). However, the analysis is described as establishing decay on the extended regular domain, with the original-domain functional recovered only by restriction. No explicit argument is supplied showing that the global diffusion operator commutes with restriction or that artificial boundaries introduce no additional interface contributions to the Dirichlet energy or potential terms. This directly affects whether the sequence decreases the original functional.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and constructive feedback on our manuscript. We address the single major comment below and indicate the planned revision.

read point-by-point responses

  1. Referee: [Abstract and theoretical analysis section] Abstract and theoretical analysis section: the central claim of unconditional monotonic decay of the objective functional on the geometry of interest rests on the iterative scheme (global FFT diffusion + normalization). However, the analysis is described as establishing decay on the extended regular domain, with the original-domain functional recovered only by restriction. No explicit argument is supplied showing that the global diffusion operator commutes with restriction or that artificial boundaries introduce no additional interface contributions to the Dirichlet energy or potential terms. This directly affects whether the sequence decreases the original functional.

    Authors: We appreciate the referee highlighting this important detail in the theoretical analysis. The proof of unconditional monotonic decay is carried out on the extended regular domain, where the global FFT diffusion step is well-defined and the iteration operates. The functional on the original domain is recovered by restriction. We agree that the current manuscript does not supply an explicit argument establishing that the decrease on the extended energy implies a corresponding decrease on the restricted functional without additional interface contributions from the artificial boundaries. In the revised manuscript we will add a dedicated lemma in the theoretical analysis section that decomposes the energy, shows that the restriction commutes with the diffusion-plus-normalization step under our extension construction, and confirms that no spurious Dirichlet or potential terms arise at the artificial interfaces. This will directly link the proven decay to the geometry of interest. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained with independent theoretical analysis

full rationale

The paper introduces a new iterative scheme for cross-field computation via domain extension, global FFT diffusion, and normalization, then claims a rigorous proof of unconditional monotonic decay of the modified Ginzburg-Landau energy. No quoted equations or steps reduce the central guarantee to a fitted parameter, self-definition, or load-bearing self-citation chain; the analysis is presented as establishing the decay property directly from the scheme on the extended domain. The method avoids triangular meshing and nonlinear optimization by construction of the algorithm itself, but this is an explicit design choice rather than a hidden circular reduction. External benchmarks and numerical experiments are invoked as independent validation.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The approach relies on standard mathematical tools like FFT and the Ginzburg-Landau functional, with the main innovation being the domain extension and relaxation. No free parameters or invented entities are explicitly introduced in the abstract.

axioms (2)
  • standard math The Fast Fourier Transform can be used to solve the linear diffusion equation globally and efficiently.
    Invoked for the diffusion step in the iterative scheme.
  • domain assumption The extension of the domain to a regular computational domain preserves the essential properties for cross field computation.
    Central to transforming the problem into an iterative scheme on regular domain.

pith-pipeline@v0.9.1-grok · 5731 in / 1217 out tokens · 27555 ms · 2026-06-29T11:20:25.799591+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

42 extracted references · 40 canonical work pages

  1. [1]

    Abels, K

    H. Abels, K. F. Lam, and B. Stinner , Analysis of the diffuse domain approach for a bulk-surface coupled PDE system , SIAM J. Math. Anal., 47 (2015), pp. 3687--3725, https://doi.org/10.1137/15M1009093

    work page doi:10.1137/15m1009093 2015

  2. [2]

    C. G. Armstrong, H. J. Fogg, C. M. Tierney, and T. T. Robinson , Common themes in multi-block structured quad/hex mesh generation , Procedia Eng., 124 (2015), pp. 70--82, https://doi.org/10.1016/j.proeng.2015.10.123

    work page doi:10.1016/j.proeng.2015.10.123 2015

  3. [3]

    Beaufort, J

    P.-A. Beaufort, J. Lambrechts, F. Henrotte, C. Geuzaine, and J.-F. Remacle , Computing cross fields: A PDE approach based on the Ginzburg-Landau theory , Procedia Engineering, 203 (2017), pp. 219--231, https://doi.org/10.1016/j.proeng.2017.09.799

    work page doi:10.1016/j.proeng.2017.09.799 2017

  4. [4]

    Bethuel, H

    F. Bethuel, H. Brezis, and F. H \'e lein , Ginzburg-- L andau V ortices , vol. 13 of Progr. Nonlinear Differential Equations Appl., Birkh \"a user, Boston, 1994, https://doi.org/10.1007/978-1-4612-0287-5

    work page doi:10.1007/978-1-4612-0287-5 1994

  5. [5]

    T. D. Blacker and M. B. Stephenson , Paving: A new approach to automated quadrilateral mesh generation , Internat. J. Numer. Methods Engrg., 32 (1991), pp. 811--847, https://doi.org/10.1002/nme.1620320410

    work page doi:10.1002/nme.1620320410 1991

  6. [6]

    Blanchi, \'E

    V. Blanchi, \'E . Corman, N. Ray, and D. Sokolov , Global parametrization based on G inzburg-- L andau functional , in Numerical Geometry, Grid Generation and Scientific Computing, V. A. Garanzha, L. Kamenski, and H. Si, eds., vol. 143 of Lect. Notes Comput. Sci. Engrg., Springer, Cham, 2021, pp. 251--262, https://doi.org/10.1007/978-3-030-76798-3_16

    work page doi:10.1007/978-3-030-76798-3_16 2021

  7. [7]

    In: IEEE/CVF International Conference on Computer Vision

    A. Bokhovkin, S. Tulsiani, and A. Dai , Mesh2Tex : Generating mesh textures from image queries , in Proc. IEEE/CVF Int. Conf. Comput. Vis. (ICCV), 2023, pp. 8884--8894, https://doi.org/10.1109/ICCV51070.2023.00819

    work page doi:10.1109/iccv51070.2023.00819 2023

  8. [8]

    Bommes, B

    D. Bommes, B. L \'e vy, N. Pietroni, E. Puppo, C. Silva, M. Tarini, and D. Zorin , Quad-mesh generation and processing: A survey , Comput. Graph. Forum, 32 (2013), pp. 51--76, https://doi.org/10.1111/cgf.12014

    work page doi:10.1111/cgf.12014 2013

  9. [9]

    Bommes, H

    D. Bommes, H. Zimmer, and L. Kobbelt , Mixed-integer quadrangulation , ACM Trans. Graph., 28 (2009), p. 77, https://doi.org/10.1145/1531326.1531383

    work page doi:10.1145/1531326.1531383 2009

  10. [10]

    Burger, O

    M. Burger, O. L. Elvetun, and M. Schlottbom , Analysis of the diffuse domain method for second order elliptic boundary value problems , Found. Comput. Math., 17 (2017), pp. 627--674, https://doi.org/10.1007/s10208-015-9292-6

    work page doi:10.1007/s10208-015-9292-6 2017

  11. [11]

    Campen, D

    M. Campen, D. Bommes, and L. Kobbelt , Quantized global parametrization , ACM Trans. Graph., 34 (2015), pp. 1--12, https://doi.org/10.1145/2816795.2818140

    work page doi:10.1145/2816795.2818140 2015

  12. [12]

    Q. Du, L. Ju, X. Li, and Z. Qiao , Maximum bound principles for a class of semilinear parabolic equations and exponential time-differencing schemes , SIAM Rev., 63 (2021), pp. 317--359, https://doi.org/10.1137/19M1243750

    work page doi:10.1137/19m1243750 2021

  13. [13]

    Durst and M

    F. Durst and M. Sch \"a fer , A parallel block-structured multigrid method for the prediction of incompressible flows , Internat. J. Numer. Methods Fluids, 22 (1996), pp. 549--565, https://doi.org/10.1002/(SICI)1097-0363(19960330)22:6<549::AID-FLD366>3.0.CO;2-7

    work page doi:10.1002/(sici)1097-0363(19960330)22:6 1996

  14. [14]

    Esedo\= g lu and F

    S. Esedo\= g lu and F. Otto , Threshold dynamics for networks with arbitrary surface tensions , Comm. Pure Appl. Math., 68 (2014), pp. 808--864, https://doi.org/10.1002/cpa.21527

    work page doi:10.1002/cpa.21527 2014

  15. [15]

    H. J. Fogg, C. G. Armstrong, and T. T. Robinson , Automatic generation of multiblock decompositions of surfaces , Internat. J. Numer. Methods Engrg., 101 (2015), pp. 965--991, https://doi.org/10.1002/nme.4825

    work page doi:10.1002/nme.4825 2015

  16. [16]

    H. J. Fogg, L. Sun, J. E. Makem, C. G. Armstrong, and T. T. Robinson , A simple formula for quad mesh singularities , Procedia Eng., 203 (2017), pp. 14--26, https://doi.org/10.1016/j.proeng.2017.09.781

    work page doi:10.1016/j.proeng.2017.09.781 2017

  17. [17]

    Geusebroek, A

    J. Geusebroek, A. W. M. Smeulders, and J. van de Weijer , Fast anisotropic Gauss filtering , IEEE Transactions on Image Processing, 12 (2003), pp. 938--943, https://doi.org/10.1109/tip.2003.812429

    work page doi:10.1109/tip.2003.812429 2003

  18. [18]

    V. L. Ginzburg and L. D. Landau , On the theory of superconductivity , in On Superconductivity and Superfluidity, Springer, Berlin, Heidelberg, 2009, pp. 113--137, https://doi.org/10.1007/978-3-540-68008-6_4

    work page doi:10.1007/978-3-540-68008-6_4 2009

  19. [19]

    Z. Guo, F. Yu, P. Lin, S. Wise, and J. Lowengrub , A diffuse domain method for two-phase flows with large density ratio in complex geometries , J. Fluid Mech., 907 (2021), p. A38, https://doi.org/10.1017/jfm.2020.790

    work page doi:10.1017/jfm.2020.790 2021

  20. [20]

    K. He, J. Sun, and X. Tang , Guided image filtering , IEEE Trans. Pattern Anal. Mach. Intell., 35 (2013), pp. 1397--1409, https://doi.org/10.1109/TPAMI.2012.213

    work page doi:10.1109/tpami.2012.213 2013

  21. [21]

    J. J. Jezdimirovi \'c , A. Chemin, and J. F. Remacle , Multi-block decomposition and meshing of 2D domain using Ginzburg-Landau PDE , in Proceedings of the 28th International Meshing Roundtable, Buffalo, NY, 2020, https://doi.org/10.5281/zenodo.3653432. Held Oct. 14--17, 2019

    work page doi:10.5281/zenodo.3653432 2020

  22. [22]

    Kowalski, F

    N. Kowalski, F. Ledoux, and P. Frey , A PDE based approach to multidomain partitioning and quadrilateral meshing , in Proc. 21st International Meshing Roundtable, Springer, Berlin, Heidelberg, 2013, pp. 137--154, https://doi.org/10.1007/978-3-642-33573-0_9

    work page doi:10.1007/978-3-642-33573-0_9 2013

  23. [23]

    Laux and N

    T. Laux and N. K. Yip , Analysis of diffusion generated motion for mean curvature flow in codimension two: A gradient-flow approach , Arch. Ration. Mech. Anal., 232 (2019), pp. 1113--1163, https://doi.org/10.1007/s00205-018-01340-x

    work page doi:10.1007/s00205-018-01340-x 2019

  24. [24]

    L. Li, P. Zhang, D. Smirnov, S. M. Abulnaga, and J. Solomon , Interactive all-hex meshing via cuboid decomposition , ACM Trans. Graph., 40 (2021), pp. 1--17, https://doi.org/10.1145/3478513.3480568

    work page doi:10.1145/3478513.3480568 2021

  25. [25]

    R. Li, T. Tang, and P. Zhang , Moving mesh methods in multiple dimensions based on harmonic maps , J. Comput. Phys., 170 (2001), pp. 562--588, https://doi.org/10.1006/jcph.2001.6749

    work page doi:10.1006/jcph.2001.6749 2001

  26. [26]

    X. Li, J. Lowengrub, A. R \"a tz, and A. Voigt , Solving PDE s in complex geometries , Comm. Math. Sci., 7 (2009), pp. 81--107, https://doi.org/10.4310/cms.2009.v7.n1.a4

    work page doi:10.4310/cms.2009.v7.n1.a4 2009

  27. [27]

    Marcias, N

    G. Marcias, N. Pietroni, D. Panozzo, E. Puppo, and O. Sorkine-Hornung , Animation-aware quadrangulation , Comput. Graph. Forum, 32 (2013), pp. 167--175, https://doi.org/10.1111/cgf.12183

    work page doi:10.1111/cgf.12183 2013

  28. [28]

    Merriman, J

    B. Merriman, J. Bence, and S. Osher , Diffusion generated motion by mean curvature , Tech. Report 92-18, University of California, Los Angeles, 1992. https://www.math.ucla.edu/applied/cam

    1992

  29. [29]

    Myles, N

    A. Myles, N. Pietroni, and D. Zorin , Robust field-aligned global parametrization , ACM Transactions on Graphics, 33 (2014), pp. 135:1--135:14, https://doi.org/10.1145/2601097.2601154

    work page doi:10.1145/2601097.2601154 2014

  30. [30]

    Osting and D

    B. Osting and D. Wang , A diffusion generated method for orthogonal matrix-valued fields , Math. Comp., 89 (2019), pp. 515--550, https://doi.org/10.1090/mcom/3473

    work page doi:10.1090/mcom/3473 2019

  31. [31]

    D. Peng, B. Merriman, S. Osher, H. Zhao, and M. Kang , A PDE -based fast local level set method , J. Comput. Phys., 155 (1999), pp. 410--438, https://doi.org/10.1006/jcph.1999.6345

    work page doi:10.1006/jcph.1999.6345 1999

  32. [32]

    C. Quan, T. Tang, and D. Wang , Unconditional energy dissipation of S trang splitting for the matrix-valued A llen-- C ahn equation , J. Differential Equations, 453 (2026), p. 113825, https://doi.org/10.1016/j.jde.2025.113825

    work page doi:10.1016/j.jde.2025.113825 2026

  33. [33]

    Raddatz and J

    J. Raddatz and J. K. Fassbender , Block structured Navier-Stokes solver FLOWer , in MEGAFLOW --- Numerical Flow Simulation for Aircraft Design, N. Kroll and J. K. Fassbender, eds., vol. 89 of Notes Numer. Fluid Mech. Multidiscip. Des., Springer, Berlin, Heidelberg, 2005, pp. 27--44, https://doi.org/10.1007/3-540-32382-1_2

    work page doi:10.1007/3-540-32382-1_2 2005

  34. [34]

    N. Ray, W. C. Li, B. L \'e vy, A. Sheffer, and P. Alliez , Periodic global parameterization , ACM Trans. Graph., 25 (2006), pp. 1460--1485, https://doi.org/10.1145/1183287.1183297

    work page doi:10.1145/1183287.1183297 2006

  35. [35]

    Remacle, C

    J.-F. Remacle, C. Geuzaine, G. Comp \`e re, and E. Marchandise , High-quality surface remeshing using harmonic maps , Internat. J. Numer. Methods Engrg., 83 (2010), pp. 403--425, https://doi.org/10.1002/nme.2824

    work page doi:10.1002/nme.2824 2010

  36. [36]

    S. J. Ruuth, B. Merriman, J. Xin, and S. Osher , Diffusion-generated motion by mean curvature for filaments , J. Nonlinear Sci., 11 (2001), pp. 473--493, https://doi.org/10.1007/s00332-001-0404-x

    work page doi:10.1007/s00332-001-0404-x 2001

  37. [37]

    Sussman and E

    M. Sussman and E. Fatemi , An efficient, interface-preserving level set redistancing algorithm and its application to interfacial incompressible fluid flow , SIAM J. Sci. Comput., 20 (1999), pp. 1165--1191, https://doi.org/10.1137/s1064827596298245

    work page doi:10.1137/s1064827596298245 1999

  38. [38]

    Viertel and B

    R. Viertel and B. Osting , An approach to quad meshing based on harmonic cross-valued maps and the G inzburg-- L andau theory , SIAM J. Sci. Comput., 41 (2019), pp. A452--A479, https://doi.org/10.1137/17M1142703

    work page doi:10.1137/17m1142703 2019

  39. [39]

    Wang , An efficient unconditionally stable method for D irichlet partitions in arbitrary domains , SIAM J

    D. Wang , An efficient unconditionally stable method for D irichlet partitions in arbitrary domains , SIAM J. Sci. Comput., 44 (2022), pp. A2061--A2088, https://doi.org/10.1137/21M1443406

    work page doi:10.1137/21m1443406 2022

  40. [40]

    F. Yu, Z. Guo, and J. Lowengrub , Higher-order accurate diffuse-domain methods for partial differential equations with D irichlet boundary conditions in complex, evolving geometries , J. Comput. Phys., 406 (2020), p. 109174, https://doi.org/10.1016/j.jcp.2019.109174

    work page doi:10.1016/j.jcp.2019.109174 2020

  41. [41]

    Y. Zou, T. Li, L. Lu, J. Wang, S. Zou, L. Zhang, and X. Deng , Finite-difference-informed graph network for solving steady-state incompressible flows on block-structured grids , Phys. Fluids, 36 (2024), p. 105157, https://doi.org/10.1063/5.0228104

    work page doi:10.1063/5.0228104 2024

  42. [42]

    write newline

    " write newline "" before.all 'output.state := FUNCTION fin.entry add.period write newline FUNCTION new.block output.state before.all = 'skip after.block 'output.state := if FUNCTION not #0 #1 if FUNCTION and 'skip pop #0 if FUNCTION or pop #1 'skip if FUNCTION new.block.checka empty 'skip 'new.block if FUNCTION field.or.null duplicate empty pop "" 'skip ...