Generalized delaunay triangulation for planar graphs
- 1 September 1986
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 1 (3) , 201-217
- https://doi.org/10.1007/bf02187695
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Visibility of disjoint polygonsAlgorithmica, 1986
- Finding the convex hull of a simple polygonJournal of Algorithms, 1983
- Visibility of a simple polygonComputer Vision, Graphics, and Image Processing, 1983
- A linear algorithm for computing the visibility polygon from a pointJournal of Algorithms, 1981
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980
- A linear algorithm for finding the convex hull of a simple polygonInformation Processing Letters, 1979
- Piecewise Quadratic Approximations on TrianglesACM Transactions on Mathematical Software, 1977
- Automatic triangulation of arbitrary planar domains for the finite element methodInternational Journal for Numerical Methods in Engineering, 1974
- Two-dimensional automatic mesh generation for structural analysisInternational Journal for Numerical Methods in Engineering, 1970