Yet another method for triangulation and contouring for automated cartographyAn algorithm is presented for hierarchical subdivision of a set of three-dimensional surface observations. The data structure used for obtaining the desired triangulation is also singularly appropriate for extracting contours. Some examples are presented, and the results obtained are compared with those given by Delaunay triangulation. The data points selected by the algorithm provide a better approximation to the desired surface than do randomly selected points.
Document ID
19840030816
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
De Floriani, L. (Consiglio Nazionale delle Ricerche Genoa, Italy)
Falcidieno, B. (Consiglio Nazionale delle Ricerche Genoa, Italy)
Nasy, G. (Consiglio Nazionale delle Ricerche Genoa, Italy)
Pienovi, C. (CNR, Istituto per la Matematica Applicata, Genoa, Italy; Nebraska, University Lincoln, NE, United States)