An improved incremental algorithm for constructing restricted Delaunay triangulations

Computers and Graphics (Pergamon)

Volumn 21, Issue 2, 1997, Pages 215-223

  Anglada, Marc Vigo ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; CONSTRAINT THEORY; GRAPH THEORY;

CONSTRAINED DELAUNAY TRIANGULATION; POLYGON;

ALGORITHMS;

EID: 0031094804     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0097-8493(96)00085-4     Document Type: Article

References (8)

1. Green, P. J. and Sibson, R., Computing Dirichelet tessellations in the plane. The Computer Journal, 1978, 21, 168.
2. Bowyer, A., Computing Dirichelet tessellations. The Computer Journal, 1981, 24, 162.
3. Preparata, F. P. and Shamos, M. I, Computational Geometry. Springer-Verlag, New York, 1985.
4. de Floriani, L. and Puppo, A., An on-line algorithm for constrained delaunay triangulation. Computer Vision, Graphics and Image Processing, 1992, 54, 290-300.
5. Chew, L. P., Constrained Delaunay triangulations,. Algorithmica, 1989, 4, 97-108.
6. Lee, D. T. and Lin, H. K., Generalized Delaunay triangulation for planar graphs. Discrete Computational Geometry, 1986, 1, 201-217.
7. Lawson, C. L, Software for C1 surface interpolation. In Mathematical Software III, ed. J. R. Rice. Academic Press, 1977, pp. 161-194.
8. Sloan, S. W., A fast algorithm for constructing Delaunay triangulations in the plane. Advances in Engineering Software, 1987, 9(1), 34-55.