A Bézier-based approach to unstructured moving meshes

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2004, Pages 310-319

  Cardoze, David ^a   Cunha, Alexandre ^b   Miller, Gary L ^a   Phillips, Todd ^c   Walkington, Noel ^c  

^a UT El Paso   (United States)

^b and Comp

^c Department of Mathematics ^*

Author keywords

B splines; B zier triangles; Computational geometry; Finite element method; Mesh generation; Moving meshes

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; DIFFUSION; FINITE ELEMENT METHOD; MATHEMATICAL MODELS; NAVIER STOKES EQUATIONS; PARAMETER ESTIMATION; VISCOSITY;

B-SPLINES; BÉZIER TRIANGLES; MESH GENERATION; MOVING MESHES;

ALGORITHMS;

EID: 4544301097     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/997817.997864     Document Type: Conference Paper

References (23)

1. James F. Antaki, Guy E. Blelloch, Omar Ghattas, Ivan Malcevic, Gary L. Miller, and Noel J. Walkington. A parallel dynamic-mesh lagrangian method for simulation of flows with dynamic interfaces. In Proceedings of the 2000 ACM/ IEEE Conference on Supercomputing, 2000.
2. T.J. Baker. Mesh movement and metamorphosis. In Proceedings, 10th International Meshing Roundtable, pages 387-396. Sandia National Laboratories, October 7-10 2001.
3. Charles Boivin and Carl F. Ollivier-Gooch. Guaranteed-quality triangular mesh generation for domains with curved boundaries. International Journal for Numerical Methods in Engineering, 55 (10):1185-1213, 2002.
4. E. Brisson. Representing geometric structures in d dimensions: Topology and order. In Symposimum on Computational Geometry, pages 218-227, 1989.
5. Scott A. Canann, Joseph R. Tristano, and Matthew L. Staten. An approach to combined laplacian and optimization-based smoothing for triangular, quadrilateral and quad-dominant meshes. In 7th International Meshing Roundtable, pages 479-494. Sandia National Laboratories, 1998.
6. Olivier Devillers. On deletion in delaunay triangulation. International Journal of Computational Geometry and Applications, 12:193-205, 2002.
7. D.H. Douglas and T.K. Peucker. Algorithms for the reduction of the number of points required to represent a line or its caricature. The Canadian Cartographer, 10(2):112-122, 1973.
8. G. Farin. Curves and Surfaces for CAGD: A Practical Guide. Morgan Kaufman, 2002.
9. Lori A. Freitag, Mark Jones, and Paul Plassmann. An efficient parallel algorithm for mesh smoothing. In Fourth International Meshing Roundtable, pages 47-58, Albuquerque, New Mexico, October 1995. Sandia National Laboratories.
10. J. Gallier. Curves and Surfaces in Geometric Modeling: Theory and Algorithms. Morgan Kaufman, 1998.
11. A. Kuprat, D. George, E. Linnebur, R. K. Smith, and H. E. Trease. Moving adaptive unstructured 3-d meshes in semiconductor process modeling applications. VLSI Journal, 6(1-4):373-378, 1998.
12. Craig Lawrence, Jial L. Zhou, and André L. Tits. User's guide for CFSQP version 2.5. Technical Report TR-94-16r1, University of Maryland, College Park, 1997.
13. C.T. Lawrence and A.L. Tits. A computationally efficient feasible sequential quadratic programming algorithm. SIAM Journal on Optimization, 11(4):1092-1118, 2001.
14. X.-Y. Li, S.-H. Teng, and A. Üngör. Simultaneous refinement and coarsening: adaptive meshing with moving boundaries. In 7th International Meshing Roundtable, pages 201-210, Dearborn, Mich., 1998.
15. Xian-Juan Luo, Mark S. Shepard, Jean-Francois Remade, Robert M. O'Bara, Mark W. Beall, Barna Szabo, and Ricardo Actis. p-version mesh generation issues. In Proceedings, 11th International Meshing Roundtable, pages 343-354. Sandia National Laboratories, September 15-18 2002.
16. Gary L. Miller, Dafna Talmor, and Shang-Hua Teng. Optimal coarsening of unstructured meshes. Journal of Algorithms, 31(1):29-65, Apr 1999.
17. Todd Phillips. Delaunay refinement for curved boundaries. Poster Presentation, 11th International Meshing Roundtable, September 2002.
18. S. H. M. Roth, P. Diezi, and M. H. Gross. Triangular Bézier clipping. Technical Report Rep 347, Institute of Scientific Computing, ETH Zurich, 2000.
19. Jim Ruppert. A delaunay refinement algorithm for quality 2-dimensional mesh generation. Journal of Algorithms, 18(3):548-535, 1995.
20. The Sangria Project, http://cs.cmu.edu/~sangria. Supported by NSF ITR ACI-0086093.
21. Dafna Talmor. Well-Spaced Points for Numerical Methods. PhD thesis, Carnegie Mellon University, Pittsburgh, August 1997. CMU CS Tech Report CMU-CS-97-164.
22. S. Vavasis. A bernstein-bezier sufficient condition for invertibility of polynomial mapping functions. Unpublished, Nov 2001.
23. Jie Wan, Suleyman Kocak, and Mark S. Shephard. Automated adaptive forming simulations. In Proceedings, 12th International Meshing Roundtable, pages 323-334. Sandia National Laboratories, September 14-17 2003.