Computational geometry: an introduction
Computational geometry: an introduction
Nonobtuse triangulation of polygons
Discrete & Computational Geometry
A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Triangulating polygons without large angles
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Points, spheres, and separators: a unified geometric approach to graph partitioning
Points, spheres, and separators: a unified geometric approach to graph partitioning
A new and simple algorithm for quality 2-dimensional mesh generation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Computational Methods for Physically-based FE Mesh Generation
Proceedings of the IFIP TC5 / WG5.3 Eight International PROLAMAT Conference on Human Aspects in Computer Integrated Manufacturing
Stable Finite Elements for Problems with Wild Coefficients
Stable Finite Elements for Problems with Wild Coefficients
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
Dihedral bounds for mesh generation in high dimensions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for congruent sphere packing and applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Best-Case Results for Nearest-Neighbor Learning
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Layer based solutions for constrained space-time meshing
Applied Numerical Mathematics - Special issue: Applied numerical computing: Grid generation and solution methods for advanced simulations
Tiling space and slabs with acute tetrahedra
Computational Geometry: Theory and Applications
Nonobtuse remeshing and mesh decimation
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
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 |
We give an algorithm for triangulating n-vertex polygonal regions (with holes) so that no angle in the final triangulation measures more than &pgr;/2. The number of triangles in the triangulation is only O(n), improving a previous bound of O(n2), and the worst-case running time is O(nlog2n). The basic technique used in the algorithm, recursive subdivision by disks, is new and may have wider application in mesh generation. We also report on an implementation of our algorithm.