Meshing 3D domains bounded by piecewise smooth surfaces

Proceedings of the 16th International Meshing Roundtable, IMR 2007

Volumn , Issue , 2008, Pages 443-460

  Rineau, Laurent ^a   Yvinec, Mariette ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANGLE MEASURING; DELAUNAY REFINEMENTS; INPUT CONSTRAINTS; LINEAR SUBSPACE; MESHING ALGORITHM; PIECEWISE SMOOTH SURFACE; RESTRICTED DELAUNAY TRIANGULATION; SUBDIVISION SURFACES;

GEOMETRY; THREE DIMENSIONAL COMPUTER GRAPHICS;

ALGORITHMS;

EID: 84878193999     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-75103-8_25     Document Type: Conference Paper

References (32)

1. N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Discrete Comput. Geom., 22(4):481-504, 1999.
2. N. Amenta, S. Choi, TK Dey, and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. Internat. J. Comput. Geom. & Applications, 12:125-141, 2002.
3. P. Alliez, G. Ucelli, C. Gotsman, and M. Attene. Recent advances in remeshing of surfaces. Part of the state-of-the-art report of the AIM@SHAPE EU network, 2005.
4. J.D. Boissonnat and S. Oudot. Provably good sampling and meshing of surfaces. Graphical Models, 67(5):405-451, 2005.
5. J.D. Boissonnat and S. Oudot. Provably good sampling and meshing of Lipschitz surfaces. Proceedings of the twenty-second annual symposium on Computational geometry, pages 337-346, 2006.
6. C. Boivin and C. Ollivier-Gooch. Guaranteed-quality triangular mesh generation for domains with curved boundaries. International Journal for Numerical Methods in Engineering, 55(10):1185-1213, 2002.
7. Jean-Daniel Boissonnat. Voronoi Diagrams, Triangulations and Surfaces, chapter 5. Inria, 2006.
8. D. Cohen-Steiner, É. Colin de Verdière, and M. Yvinec. Conforming Delaunay triangulations in 3rd. Computational Geometry: Theory and Applications, pages 217-233, 2004.
9. S.-W. Cheng and T. K. Dey. Quality meshing with weighted Delaunay refinement. SIAM J. Comput., 33(1):69-93, 2003.
10. S.-W. Cheng, T. K. Dey, H. Edelsbrunner, M. A. Facello, and S.-H. Teng. Sliver exudation. J. ACM, 47(5):883-904, 2000.
11. S.W. Cheng, T.K. Dey, and E.A. Ramos. Delaunay Refinement for Piece-wise Smooth Complexes. Proc. 18th Annu. ACM-SIAM Sympos. Discrete Algorithms, pages 1096-1105, 2007.
12. S.-W. Cheng, T. K. Dey, E. A. Ramos, and T. Ray. Quality meshing for polyhedra with small angles. In SCG '04: Proceedings of the twentieth annual symposium on Computational geometry, pages 290-299. ACM Press, 2004.
13. S.-W. Cheng, T. K. Dey, E. A. Ramos, and T. Ray. Weighted Delaunay refinement for polyhedra with small angles. In Proceedings 14th International Meshing Roundtable, IMR2005, 2005.
14. Cgal, Computational Geometry Algorithms Library. http://www.cgal.org.
15. L. P. Chew. Guaranteed-quality triangular meshes. Technical Report TR-89-983, Dept. Comput. Sci., Cornell Univ., Ithaca, NY, April 1989.
16. L.P. Chew. Guaranteed-quality mesh generation for curved surfaces. Proceedings of the ninth annual symposium on Computational geometry, pages 274-280, 1993.
17. S.-W. Cheng and S.-H. Poon. Graded conforming Delaunay tetrahedral-ization with bounded radius-edge ratio. In SODA'03: Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, pages 295-304. Society for Industrial and Applied Mathematics, 2003.
18. T.K. Dey. Curve and Surface Reconstruction: Algorithms with Mathematical Analysis. Cambridge University Press, 2006.
19. H. Edelsbrunner and N.R. Shah. Triangulating Topological Spaces. International Journal of Computational Geometry and Applications, 7(4):365-378, 1997.
20. P. J. Frey, H. Borouchaki, and P.-L. George. Delaunay tetrahedrization using an advancing-front approach. In Proc. 5th International Meshing Roundtable, pages 31-43, 1996.
21. P.J. Frey and P.L. George. Mesh Generation: Application to Finite Elements. Kogan Page, 2000.
22. P.-L. George, F. Hecht, and E. Saltel. Fully automatic mesh generator for 3d domains of any shape. Impact of Computing in Science and Engineering, 2:187-218, 1990.
23. P.-L. George, F. Hecht, and E. Saltel. Automatic mesh generator with specified boundary. Computer Methods in Applied Mechanics and Engineering, 92:269-288, 1991.
24. W.E. Lorensen and H.E. Cline. Marching cubes: A high resolution 3D surface construction algorithm. Proceedings of the 14th annual conference on Computer graphics and interactive techniques, pages 163-169, 1987.
25. Francois Labelle and Jonathan Richard Shewchuk. Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation. In SCG '03: Proceedings of the nineteenth annual symposium on Computational geometry, pages 191-200, New York, NY, USA, 2003. ACM Press.
26. X.-Y. Li and S.-H. Teng. Generating well-shaped Delaunay meshes in 3d. In SODA'01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 28-37. Society for Industrial and Applied Mathematics, 2001.
27. M. Murphy, D.M. Mount, and C.W. Gable. A point-placement strategy for conforming Delaunay tetrahedralization. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pages 67-74, 2000.
28. G.L. Miller, D. Talmor, and S.H. Teng. Data Generation for Geometric Algorithms on Non-Uniform Distributions. International Journal of Computational Geometry and Applications, 9(6):577, 1999.
29. Steve Oudot, Laurent Rineau, and Mariette Yvinec. Meshing volumes bounded by smooth surfaces. In Proc. 14th International Meshing Roundtable, pages 203-219, 2005.
30. J. Ruppert. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms, 18:548-585, 1995.
31. J. R. Shewchuk. Tetrahedral mesh generation by Delaunay refinement. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 86-95, 1998.
32. J. R. Shewchuk. Delaunay refinement algorithms for triangular mesh generation. Computational Geometry: Theory and Applications, 22:21-74, 2002.