Separator based parallel divide and conquer in computational geometry
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Quality mesh generation in three dimensions
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
A Delaunay based numerical method for three dimensions: generation, formulation, and partition
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Guaranteed-quality Delaunay meshing in 3D (short version)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
Dihedral bounds for mesh generation in high dimensions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Finite Element Method for Elliptic Problems
Finite Element Method for Elliptic Problems
Smoothing and cleaning up slivers
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quality meshing with weighted Delaunay refinement
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Updating and constructing constrained delaunay and constrained regular triangulations by flips
Proceedings of the nineteenth annual symposium on Computational geometry
Adaptive and quality 3D meshing from imaging data
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Quality meshing for polyhedra with small angles
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Manifold reconstruction from point samples
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Sliver removal by lattice refinement
Proceedings of the twenty-second annual symposium on Computational geometry
On the sizes of Delaunay meshes
Computational Geometry: Theory and Applications
Quality meshing of implicit solvation models of biomolecular structures
Computer Aided Geometric Design - Special issue: Applications of geometric modeling in the life sciences
Contour interpolation with bounded dihedral angles
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Sliver-free perturbation for the Delaunay tetrahedrization
Computer-Aided Design
Weak witnesses for Delaunay triangulations of submanifolds
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Manifold reconstruction in arbitrary dimensions using witness complexes
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
A generic software design for Delaunay refinement meshing
Computational Geometry: Theory and Applications
Isosurface stuffing: fast tetrahedral meshes with good dihedral angles
ACM SIGGRAPH 2007 papers
Automatic mesh-healing technique for model repair and finite element model generation
Finite Elements in Analysis and Design
Towards persistence-based reconstruction in euclidean spaces
Proceedings of the twenty-fourth annual symposium on Computational geometry
Dimension detection via slivers
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Size complexity of volume meshes vs. surface meshes
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
From Segmented Images to Good Quality Meshes Using Delaunay Refinement
Emerging Trends in Visual Computing
On the sizes of Delaunay meshes
Computational Geometry: Theory and Applications
Quality meshing of implicit solvation models of biomolecular structures
Computer Aided Geometric Design - Special issue: Applications of geometric modeling in the life sciences
High-quality consistent meshing of multi-label datasets
IPMI'07 Proceedings of the 20th international conference on Information processing in medical imaging
Dynamic local remeshing for elastoplastic simulation
ACM SIGGRAPH 2010 papers
Dynamic well-spaced point sets
Proceedings of the twenty-sixth annual symposium on Computational geometry
Manifold reconstruction using tangential Delaunay complexes
Proceedings of the twenty-sixth annual symposium on Computational geometry
Measuring visual consistency in 3d rendering systems
ACSC '10 Proceedings of the Thirty-Third Australasian Conferenc on Computer Science - Volume 102
Perturbations for Delaunay and weighted Delaunay 3D triangulations
Computational Geometry: Theory and Applications
Parallelism in dynamic well-spaced point sets
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the twenty-seventh annual symposium on Computational geometry
Tetrahedral image-to-mesh conversion for biomedical applications
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Feature-sensitive tetrahedral mesh generation with guaranteed quality
Computer-Aided Design
Multitissue Tetrahedral Image-to-mesh Conversion with Guaranteed Quality and Fidelity
SIAM Journal on Scientific Computing
New Bounds on the Size of Optimal Meshes
Computer Graphics Forum
Feature-Preserving, multi-material mesh generation using hierarchical oracles
MeshMed'12 Proceedings of the 2012 international conference on Mesh Processing in Medical Image Analysis
Dynamic well-spaced point sets
Computational Geometry: Theory and Applications
Guaranteed quality tetrahedral Delaunay meshing for medical images
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
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.