Optimal Point Placement for Mesh Smoothing

Journal of Algorithms

Volumn 30, Issue 2, 1999, Pages 302-322

  Amenta, Nina ^a   Bern, Marshall ^a   Eppstein, David ^b  

^a PALO ALTO RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002935217     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0984     Document Type: Article

References (38)

1. I. Adler and R. Shamir, A randomization scheme for speeding up algorithms for linear and convex quadratic programming problems with a high constraints-to-variables ratio, Math. Programming 61 (1993), 39-52.
2. N. Amato, M. T. Goodrich, and E. A. Ramos, Parallel algorithms for higher dimensional convex hulls, in "The Thirty-Fifth IEEE Symposium on the Foundations of Computer Science," 1994, pp. 683-694; http://www.cs.tamu.edu/research/robotics/Amato/ Papers/ focs94.300.ps.gz.
3. N. Amenta, Helly-type theorems and generalized linear programming, Discrete Comput. Geom. 12 (1994), 241-261; http://www.geom.umn.edu/∼nina/papers/dcg.ps.
4. I. Babuška and A. Aziz, On the angle condition in the finite element method, SIAM J. Numer. Anal. 13 (1976) 214-227.
5. C. Bajaj, The algebraic degree of geometric optimization problems, Discrete Comput. Geom. 3 (1988), 177-191.
6. R. E. Bank and R. K. Smith, Mesh smoothing using a posteriori error estimates, SIAM J. Numer. Anal., 34 (1997), 921-935. [ftp://math.ucsd.edu/pub/scicomp/reb/ftpfiles/ a67.ps.Z.]
7. M. Bern, L. P. Chew, D. Eppstein, and J. Ruppert, Dihedral bounds for mesh generation in high dimensions, in "The Sixth ACM/SIAM Symposium on Discrete Algorithms," 1995, pp. 189-196; http://www.ics.uci.edu/̃eppstein/pubs/p-dihedral.ps.Z. See also D. Eppstein, Tetrahedra classified by bad angles, http://www.ics.uci.edu/̃eppstein/ junkyard/tetraqual.html.
8. M. Bern, L. P. Chew, D. Eppstein, and J. Ruppert, Dihedral bounds for mesh generation in high dimensions, in "The Sixth ACM/SIAM Symposium on Discrete Algorithms," 1995, pp. 189-196; http://www.ics.uci.edu/̃eppstein/pubs/p-dihedral.ps.Z. See also D. Eppstein, Tetrahedra classified by bad angles, http://www.ics.uci.edu/̃eppstein/ junkyard/tetraqual.html.
9. M. Bern and D. Eppstein, Mesh generation and optimal triangulation, in "Computing in Euclidean Geometry," 2nd ed., World Scientific, Singapore, pp. 47-123, 1995.
10. M. Bern and P. E. Plassmann, Mesh generation, manuscript, 1996.
11. K. Clarkson, A Las Vegas algorithm for linear programming when the dimension is small, in "Twenty-Ninth IEEE Symposium on Foundations of Computer Science," 1988, pp. 452-456; J. Assoc. Comput. Mach. 42 (1995), 488-499; http://cm.bell-labs.com/who/ clarkson/lp2.html.
12. K. Clarkson, A Las Vegas algorithm for linear programming when the dimension is small, in "Twenty-Ninth IEEE Symposium on Foundations of Computer Science," 1988, pp. 452-456; J. Assoc. Comput. Mach. 42 (1995), 488-499; http://cm.bell-labs.com/who/ clarkson/lp2.html.
13. E. J. Cockayne and Z. A. Melzak, Euclidean constructability in graph minimization problems, Math. Mag. 42 (1969), 206-208.
14. E. F. D'Azevedo and R. B. Simpson, On optimal interpolation triangle incidences, SIAM J. Sci. Statist. Comput. 10 (1989) 1063-1075.
15. S. Dharmadhikari and K. Joag-Dev, "Unimodality, Convexity and Applications," Academic Press, San Diego, 1988.
16. M. T. Dickerson and M. H. Montague, A (usually?) connected subgraph of the minimum weight triangulation, in "The Twelfth ACM Symposium on Computational Geometry," 1996, pp. 204-213; http://www.middlebury.edu/̃dickerso/mwtskel.html.
17. M. E. Dyer and A. M. Frieze, A randomized algorithm for fixed-dimensional linear programming, Math. Programming 44 (1989), 203-212.
18. N. Dyn, D. Levin, and S. Rippa, Data dependent triangulations for piecewise linear interpolation, IMA J. Numer. Anal. 10 1990), 137-154.
19. D. Eppstein, Approximating the minimum weight Steiner triangulation, Discrete Comput. Geom. 11 (1994), 163-191; http://www.ics.uci.edu/̃eppstein/pubs/p-mwst.html.
20. F. Eriksson, On the measure of solid angles, Math. Mag. 63(3) (1990), 184-187.
21. L. A. Freitag, M. T. Jones, and P. E. Plassmann, An efficient parallel algorithm for mesh smoothing, in "The Fourth International Meshing Roundtable," Sandia Labs., 1995, pp. 47-58; ftp://feal.ansys.com/pub/sowen/freitag.epsi.gz.
22. L. A. Freitag, M. T. Jones, and P. E. Plassmann, A parallel algorithm for mesh smoothing, in "Proceedings of the Eighth Conference on Parallel Processing for Scientific Computing," 1997.
23. L. A. Freitag and C. Ollivier-Gooch, A comparison of tetrahedral mesh improvement techniques, manuscript, 1996.
24. L. A. Freitag, C. Ollivier-Gooch, M. T. Jones, and P. E. Plassmann, Scalable unstructured mesh computation, http://www.mcs.anl.gov/home/freitag/SC94demo/.
25. B. Gärtner, A subexponential algorithm for abstract optimization problems, SIAM J. Comput. 24 (1995), 1018-1035; http://www.inf.fu-berlin.de/inst/pubs/tr-b-93-05. abstract.html.
26. C. Gold, T. Charters, and J. Ramsden, Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain, in "Proceedings of the SIGGRAPH," 1977, pp. 170-175.
27. M. T. Goodrich, Geometric partitioning made easier, even in parallel, in "The Ninth ACM Symposium on Computational Geometry," 1993, pp. 73-82.
28. R. Klein and A. Lingas, Hamiltonian abstract Voronoi diagrams in linear time, in "The Fifth International Symposium on Algorithms and Computation," Lecture Notes in Computer Science, Vol. 834, Springer-Verlag, Berlin/New York, 1995, pp. 11-19; Tenth European Workshop on Computational Geometry, 1994, pp. 1-4; http://www.dna.lth.se/ Research/Algorithms/Papers/an drzej4.ps.
29. R. Klein and A. Lingas, Hamiltonian abstract Voronoi diagrams in linear time, in "The Fifth International Symposium on Algorithms and Computation," Lecture Notes in Computer Science, Vol. 834, Springer-Verlag, Berlin/New York, 1995, pp. 11-19; Tenth European Workshop on Computational Geometry, 1994, pp. 1-4; http://www.dna.lth.se/ Research/Algorithms/Papers/an drzej4.ps.
30. R. Klein, K. Mehlhorn, and S. Meiser, Randomized incremental construction of abstract Voronoi diagrams, Comput. Geom. Th. Appl. 3 (1993), 157-184.
31. C. Levcopoulos and D. Krznaric, Quasi-greedy triangulations approximating the minimum weight triangulation, in "The Seventh ACM/SIAM Symposium Discrete Algorithms," 1996, pp. 392-401.
32. J. Matoušek, M. Sharir, and E. Welzl, "A Subexponential Bound for Linear Programming," Technical Report B 92-17, Freie Univ. Berlin, Fachb. Mathematik, Aug. 1992.
33. N. Megiddo, Applying parallel computational algorithms in the design of sequential algorithms, J. Assoc. Comput. Mach. 30 (1983) 852-865.
34. K. Mehlhorn, S. Meiser, and C. O'Dunlaing, On the construction of abstract Voronoi diagrams, Discrete Comput. Geom. 6 (1991), 211-224.
35. S. Rippa, Long and thin triangles can be good for linear interpolation, SIAM J. Numer. Anal. 29(1) (1992), 257-270.
36. S. Rippa and B. Schiff, Minimum energy triangulations for elliptic problems, Comput. Methods Appl. Mech. Engrg. 84 (1990), 257-274.
37. G. Strang and G. J. Fix, "An Analysis of the Finite Element Method," Prentice-Hall, Englewood Cliffs, NJ, 1973.
38. E. Weiszfeld, Sur le point pour lequel la somme des distances de n points donnes est minimum, Tôhoku Math. J. 43 (1937), 355-386.