|
ABSTRACT
A silver is a tetrahedon whose four vertices lie close to a plane and whose orthogonal projection to that plane is a convex quadrilateral with no short edge. Silvers are notoriously common in 3-dimensional Delaunay triangulations even for well-spaced point sets. We show that, if the Delaunay triangulation has the ratio property introduced in Miller et al. [1995], then there is an assignment of weights so the weighted Delaunay traingulation contains no silvers. We also give an algorithm to compute such a weight assignment.
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
|
Marshall Bern , Paul Chew , David Eppstein , Jim Ruppert, Dihedral bounds for mesh generation in high dimensions, Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, p.189-196, January 22-24, 1995, San Francisco, California, United States
|
| |
2
|
|
| |
3
|
BILLERA, L. J., FILLIMAN, P., AND STURMFELS, B. 1990. Construction and complexity of secondary polytopes. Adv. Math. 83, 155-179.
|
| |
4
|
CAVENDISH, J. C., FIELD, D. A., AND FREY, W. H. 1985. An approach to automatic three-dimensional finite element mesh generation. Internat. J. Numer. Methods Engrg. 21, 329-347.
|
 |
5
|
|
| |
6
|
|
| |
7
|
DELAUNAY, B. 1934. Sur la sphe`re vide. Izv. Akad. Nauk SSSR, Otdelenie Matematicheskii i Estestvennyka Nauk 7, 793-800.
|
| |
8
|
DEY, T. K., BAJAJ, C., AND SUGIHARA, K. 1992. On good triangulations in three dimensions. Internat. J. Comput. Geom. Appl. 2, 75-95.
|
| |
9
|
EDELSBRUNNER, H., AND SHAH, N. R. 1996. Incremental topological flipping works for regular triangulations. Algorithmica 15, 223-241.
|
| |
10
|
EDELSBRUNNER, H., AND TAN, T. S. 1993. An upper bound for conforming Delaunay triangulations. Disc. Comput. Geom. 10, 197-213.
|
 |
11
|
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]
|
| |
12
|
GELFAND, I. M., KAPRANOV, M. M., AND ZELEVINSKY, A. V. 1994. Discriminants, Resultants and Multidimensional Determinants. Birkha~user, Boston, Mass.
|
| |
13
|
JOE, B. 1991. Delaunay versus min-max solid angle triangulations for three-dimensional mesh generation. Int. J. Numer. Methods Eng. 31, 987-997.
|
| |
14
|
LIU, A., AND JOE, B. 1994. Relationship between tetrahedron shape measures. BIT 34, 268-287.
|
 |
15
|
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]
|
 |
16
|
|
| |
17
|
RAJAN, V. T. 1994. Optimality of the Delaunay triangulation in Rd. Discrete Comput. Geom. 12, 189-202.
|
| |
18
|
|
 |
19
|
|
| |
20
|
STRANG, G., AND FIX, G. J. 1973. An Analysis of the Finite Element Method. Prentice-Hall, Englewood Cliffs, N.J.
|
| |
21
|
TALMOR, D. 1997. Well-spaced points for numerical methods. Report CMU-CS-97-164, Dept. Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, Pa.
|
| |
22
|
VORONOI, G. 1907/1908. Nouvelles applications des parame`tres continus `a la the~orie des formes quadratiques. J. Reine Angew. Math. 133, 1907, 97-178, and 134, 1908, 198-287.
|
CITED BY 22
|
|
|
|
|
|
|
|
|
|
|
Herbert Edelsbrunner , Xiang-Yang Li , Gary Miller , Andreas Stathopoulos , Dafna Talmor , Shang-Hua Teng , Alper Üngör , Noel Walkington, Smoothing and cleaning up slivers, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.273-277, May 21-23, 2000, Portland, Oregon, United States
|
|
|
|
|
|
Siu-Wing Cheng , Tamal K. Dey , Edgar A. Ramos , Tathagata Ray, Quality meshing for polyhedra with small angles, Proceedings of the twentieth annual symposium on Computational geometry, June 08-11, 2004, Brooklyn, New York, 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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|