Linear-size nonobtuse triangulation of polygons
- 1 December 1995
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 14 (4) , 411-428
- https://doi.org/10.1007/bf02570715
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- TRIANGULATING POLYGONS WITHOUT LARGE ANGLESInternational Journal of Computational Geometry & Applications, 1995
- Provably good mesh generationJournal of Computer and System Sciences, 1994
- Constructing the Voronoi diagram of a set of line segments in parallelAlgorithmica, 1993
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONSInternational Journal of Computational Geometry & Applications, 1992
- Automatic rectangle-based adaptive mesh generation without obtuse anglesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- Nonobtuse triangulation of polygonsDiscrete & Computational Geometry, 1988
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980
- On the Angle Condition in the Finite Element MethodSIAM Journal on Numerical Analysis, 1976