ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Smoothing and cleaning up slivers
Full text PdfPdf (541 KB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the thirty-second annual ACM symposium on Theory of computing table of contents
Portland, Oregon, United States
Pages: 273 - 277  
Year of Publication: 2000
ISBN:1-58113-184-4
Authors
Herbert Edelsbrunner  Department of Computer Science, Duke University, Durham, NC and Raindrop Geomagic, Research Triangle Park, NC
Xiang-Yang Li  Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL
Gary Miller  Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Andreas Stathopoulos  Department of Computer Science, College of William and Mary, Williamsburg, VA
Dafna Talmor  LMS-CADSI, Suite 104, 3150 Almaden Expwy, San Jose, CA
Shang-Hua Teng  Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL and Akamai Technologies, Cambridge, MA
Alper Üngör  Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL
Noel Walkington  Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Sponsor
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 44,   Citation Count: 10
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/335305.335338
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. C. CAVENmSlt, D. A. FmLD AND W. H. FREY. An approach to automatic three-dimensional finite element mesh generation, lnternat. J. Numer. Methods Engrg. 21 (1985), 329-347.
2
Siu-Wing Cheng , Tamal K. Dey , Herbert Edelsbrunner , Michael A. Facello , Shang-Hua Teng, Silver exudation, Journal of the ACM (JACM), v.47 n.5, p.883-904, Sept. 2000  [doi>10.1145/355483.355487]
3
L. Paul Chew, Guaranteed-quality Delaunay meshing in 3D (short version), Proceedings of the thirteenth annual symposium on Computational geometry, p.391-393, June 04-06, 1997, Nice, France  [doi>10.1145/262839.263018]
 
4
Philippe G. Ciarlet, Finite Element Method for Elliptic Problems, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2002
 
5
M. DE BERO, M. VAN KREVELD, M. OVERMARS AND O. SCHWARZKOPF. (~omputational G6ometfll.4tgorgthm# and Applications. Springer-Verlag, Berlin, Germany, 1997.
 
6
D. A. FIELD. Laplacian smoothing and Delaunay triangulations. Comm. Appl. Numer. Meth. 4 (1988), 709-712.
 
7
L. FaZlTAO, M. JONES AND P. PLASSMANN. An efficient parallel algorithm for mesh smoothing, In "Proc. 4th Internat. Meshing Roundtable, 1995", 47-58.
 
8
L. F~t~ITAO AND C. OLLIV!SR-GoocH. Tetrahedral mesh improvement using swapping and smoothing, lnternat. J. Numet. Methods Engin. 40 (1997), 3979-4002.
9
Alan M. Frieze , Gary L. Miller , Shang-Hua Teng, Separator based parallel divide and conquer in computational geometry, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.420-429, June 29-July 01, 1992, San Diego, California, United States  [doi>10.1145/140901.141934]
 
10
X.-Y. LI, S.-H. TENO AND A. ~INGOR. Biting: advancing front meets sphere packing. Internat. J. Numer. Methods Engin., to appear.
11
Gary L. Miller , Dafna Talmor , Shang-Hua Teng , Noel Walkington, A Delaunay based numerical method for three dimensions: generation, formulation, and partition, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.683-692, May 29-June 01, 1995, Las Vegas, Nevada, United States  [doi>10.1145/225058.225286]
12
Jonathan Richard Shewchuk, Tetrahedral mesh generation by Delaunay refinement, Proceedings of the fourteenth annual symposium on Computational geometry, p.86-95, June 07-10, 1998, Minneapolis, Minnesota, United States  [doi>10.1145/276884.276894]
 
13
G. STRANG AND G. J. FIX. An Analysis of the Finite Element Method. Prentice Hall, Englewood Cliffs, New Jersey, 1973.
 
14
D. TALMOR. Well-spaced points for numerical methods. Report CMU-CS-97-164, Dept. Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, Penn., 1997.

CITED BY  10
Jeff Erickson, Dense point sets have sparse Delaunay triangulations: or "…but not too nasty", Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.125-134, January 06-08, 2002, San Francisco, California
Jeff Erickson, Nice point sets can have nasty Delaunay triangulations, Proceedings of the seventeenth annual symposium on Computational geometry, p.96-105, June 2001, Medford, Massachusetts, United States
Siu-Wing Cheng , Tamal K. Dey, Quality meshing with weighted Delaunay refinement, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.137-146, January 06-08, 2002, San Francisco, California
Xiang-Yang Li , Shang-Hua Teng, Generating well-shaped Delaunay meshed in 3D, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.28-37, January 07-09, 2001, Washington, D.C., United States
Alla Sheffer , Alper Üngör, Efficient adaptive meshing of parametric models, Proceedings of the sixth ACM symposium on Solid modeling and applications, p.59-70, May 2001, Ann Arbor, Michigan, United States
Xiang-Yang Li, Generating well-shaped d-dimensional Delaunay meshes, Theoretical Computer Science, v.296 n.1, p.145-165, 4 March 2003
François Labelle, Sliver removal by lattice refinement, Proceedings of the twenty-second annual symposium on Computational geometry, June 05-07, 2006, Sedona, Arizona, USA
Benoît Hudson , Gary L. Miller , Todd Phillips, Sparse parallel Delaunay mesh refinement, Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, June 09-11, 2007, San Diego, California, USA
Benoît Hudson , Gary L. Miller , Todd Phillips , Don Sheehy, Size complexity of volume meshes vs. surface meshes, Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, p.1041-1047, January 04-06, 2009, New York, New York
C. S. Chong , A. Senthil Kumar , H. P. Lee, Automatic mesh-healing technique for model repair and finite element model generation, Finite Elements in Analysis and Design, v.43 n.15, p.1109-1119, November, 2007

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures; Geometrical problems and computations


General Terms:
Algorithms, Design, Measurement, Performance, Theory, Verification


Keywords:
Delaunay triangulations, computational geometry, mesh clean-up, mesh generation, mesh smoothing, slivers, tetrahedral meshes

Collaborative Colleagues:
Herbert Edelsbrunner: colleagues
Xiang-Yang Li: colleagues
Gary Miller: colleagues
Andreas Stathopoulos: colleagues
Dafna Talmor: colleagues
Shang-Hua Teng: colleagues
Alper Üngör: colleagues
Noel Walkington: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player