Constrained Delaunay triangulations
SCG '87 Proceedings of the third annual symposium on Computational geometry
Nonobtuse triangulation of polygons
Discrete & Computational Geometry
The design and analysis of spatial data structures
The design and analysis of spatial data structures
An O(n2log n) time algorithm for the MinMax angle triangulation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Slimming down by adding; selecting heavily covered points
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Polynomial-size nonobtuse triangulation of polygons
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Finite element triangulation of complex regions using computational geometry
Finite element triangulation of complex regions using computational geometry
Triangulating polygons without large angles
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Guaranteed-quality mesh generation for curved surfaces
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Linear-size nonobtuse triangulation of polygons
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
An optimal bound for conforming quality triangulations: (extended abstract)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
An aspect ratio bound for triangulating a d-grid cut by a hyperplane (extended abstract)
Proceedings of the twelfth annual symposium on Computational geometry
A new and simple algorithm for quality 2-dimensional mesh generation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Dihedral bounds for mesh generation in high dimensions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximating uniform triangular meshes in polygons
Theoretical Computer Science
Approximating Uniform Triangular Meshes for Spheres
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Approximating Uniform Triangular Meshes in Polygons
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Triangulating a convex polygon with fewer number of non-standard bars
Theoretical Computer Science
SIAM Journal on Scientific Computing
Triangulating a convex polygon with small number of non-standard bars
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |