Closer 
;'Taphic 
> takes 
'TS and 
tabase: 
ing the 
nd it is 
ata has 
[ when 
usually 
; where 
ation to 
We can 
r index 
on. We 
|, when 
object 
All the 
closing 
ndicate 
lasses. 
he state 
ersal is 
omplex 
/e have 
, 1986, 
odel of 
1e TIN. 
ralized 
We also 
low we 
equired 
Jational 
  
  
Antonio Ruiz 
Chen, Z. T., 1990. A quadtree guides fast spatial searches in triangular irregular network (TIN). Proc Int Sym Spatial 
Data Handling. Zurich pp. 209-215. 
Davis, J. C., 1973. Statistics and data analysis in geology. John Wiley & Sons, New York. 
de Berg, M., van Kreveld, M., van Oostrum, R. and Overmars, M., 1996. Simple traversal of a subdivision without extra 
storage. Tech. Rep. UU-CS-96-17, Dep. Computer Science. Utrech Univ., Utrech. 
de Floriani, L. and Puppo, E., 1992. An on-line algorithm for constrained Delaunay triangulation. CVGIP: Graphical 
Models and Image Processing 54(3), pp. 290-300. 
Fortune, S. J., 1987. A sweepline algorithm for Voronoi diagrams. Algorithmica 2, pp. 153-174. 
Gold, C. and Cormack, S., 1986. Spatially ordered networks and topographic reconstructions. In: Proc 2nd Int Sym 
Spatial Data Handling, pp. 74—85. 
Goodrich, M. T., Tsay, J.-J., Vengroff, D. E. and Vitter, J. S., 1993. External-memory computational geometry. In: Proc. 
IEEE Symp. on Foundations of Comp. Sci., pp. 714—723. 
Guibas, L. and Stolfi, J., 1985. Primitives for the manipulation of general subdivisions and the comparison of Voronoi 
diagrams. ACM Transactions on Graphics 4(2), pp. 74-123. 
Lawson, C. L., 1977. Software for C'! surface interpolation. In: J. Rice (ed.), Mathematical Software III, Vol. 3, Academic 
Press, New York. 
Lee, D. T. and Schachter, B. J., 1980. Two algorithms for constructing a Delaunay triangulation. Int. J. Comp. Inf. Sci. 
9(3), pp. 219-242. 
Meyer, B., 1997. Object-oriented software construction. 2nd edn, Prentice-Hall, New Jersey. 
Nelson, R. C. and Samet, H., 1986. A consistent hierarchical representation for vector data. Computer Graphics 20(4), 
pp. 197-206. 
Paul Chew, L., 1989. Constrained Delaunay triangulation. Algorithmica 4, pp. 97-108. 
Preparata, F. and Shamos, M., 1985. Computational Geometry. Springer-Verlag, New York. 
Ruiz, A., Colomina, I. and Pérez, L., 1995. Acceso y actualización de una red irregular de triángulos desde un quadtree. 
In: VI Encuentros de Geometría Computacional, Barcelona. 
Samet, H., 1990a. Applications of Spatial Data Structures. Addison-Wesley, Reading, MA. 
Samet, H., 1990b. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA. 
Seidel, R., 1988. Constrained Delaunay triangulations and Voronoi diagrams with obstacles. Technical Report 260 IIG, 
TU Graz, Austria. 
Shewchuk, J. R., 1996a. Robust adaptive floating-point geometric predicates. In: Proc 12th Ann Symp on Computational 
Geometry, ACM. 
Shewchuk, J. R., 1996b. Triangle: engineering a 2D quality mesh generator and Delaunay triangulator. In: First Workshop 
on applied computational geometry, ACM, Pennsylvania, pp. 124-133. 
  
International Archives of Photogrammetry and Remote Sensing. Vol. XXXIII, Part B3. Amsterdam 2000. 791