Size complexity of volume meshes vs. surface meshes

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 1041-1047

  Hudson, Benoît ^a   Miller, Gary L ^b   Phillips, Todd ^b   Sheeny, Don ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASPECT RATIO; SCAFFOLDS;

FINE RESOLUTION; MESH ELEMENTS; MESHING ALGORITHM; SIZE COMPLEXITY; SPACE FILLING; SURFACE MESH; THREE DIMENSIONS; TWO-DIMENSIONAL SURFACE;

MESH GENERATION;

EID: 70349098044     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.113     Document Type: Conference Paper

References (16)

1. [ABE98] Nina Amenta, Marshall Bern, and David Eppstein. The crust and the β-skeleton: Combinatorial curve reconstruction. Graphical models and image processing: GMIP, 60(2), 1998.
2. [BEG94] Marshall Bern, David Eppstein, and John R. Gilbert. Provably Good Mesh Generation. Journal of Computer and System Sciences, 48(3):384-409, June 1994.
3. +00] Siu-Wing Cheng, Tamal Krishna Dey, Herbert Edelsbrunner, Michael A. Facello, and Shang-Hua Teng. Sliver Exudation. Journal of the ACM, 47(5):883-904, September 2000.
4. [CDR07] Siu-Wing Cheng, Tamal K. Dey, and Edgar A. Ramos. Delaunay refinement for piecewise smooth complexes. In SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pages 1096-1105, Philadelphia, PA, USA, 2007. Society for Industrial and Applied Mathematics.
5. +00] Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, and Noel Walkington. Smoothing and cleaning up slivers. In STOC, pages 273-277, 2000.
6. [ES97] Herbert Edelsbrunner and Nimish R. Shah. Triangulating topological spaces. IJCGA, 7:365-378, 1997.
7. [HMP06] Benoît Hudson, Gary Miller, and Todd Phillips. Sparse Voronoi Refinement. In Proceedings of the 15th International Meshing Roundtable, pages 339-356, Birmingham, Alabama, 2006. Long version available as Carnegie Mellon University Technical Report CMU-CS-06-132.
8. [HPU05] Sariel Har-Peled and Alper Üngör. A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions. In Symposium on Computational Geometry, 2005.
9. [Moo95] Doug Moore. The cost of balancing generalized quadtrees. In SMA '95: Proceedings of the Third Symposium on Solid Modeling and Applications, pages 305-312, 1995.
10. [MPS08] Gary L. Miller, Todd Phillips, and Donald Sheehy. Linear-size meshes. In Canadian Conference on Computational Geometry, 2008. To appear.
11. [MPW02] Gary L. Miller, Steven E. Pav, and Noel J. Walkington. Fully Incremental 3D Delaunay Refinement Mesh Generation. In Eleventh International Meshing Roundtable, pages 75-86, Ithaca, New York, September 2002. Sandia National Laboratories.
12. [MV00] Scott A. Mitchell and Stephen A. Vavasis. Quality mesh generation in higher dimensions. SIAM J. Comput., 29(4):1334-1370 (electronic), 2000.
13. [Rup95] Jim Ruppert. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms, 18(3):548-585, 1995. Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (Austin, TX, 1993).
14. [RY07] Laurent Rineau and Mariette Yvinec. Meshing 3D domains bounded by piecewise smooth surfaces. In 16th International Meshing Roundtable, pages 442-460, 2007.
15. [She98] Jonathan Richard Shewchuk. Tetrahedral Mesh Generation by Delaunay Refinement. In Proceedings of the Fourteenth Annual Symposium on Computational Geometry, pages 86-95, Minneapolis, Minnesota, June 1998. Association for Computing Machinery.
16. [Üng04] Alper Üngör. Off-centers: A new type of steiner points for computing size-optimal guaranteed-quality delaunay triangulations. In Proceedings of LATIN, 2004.