Computational geometry: an introduction
Computational geometry: an introduction
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
An on-line algorithm for constrained Delaunay triangulation
CVGIP: Graphical Models and Image Processing
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Optimized geometry compression for real-time rendering
VIS '97 Proceedings of the 8th conference on Visualization '97
Real time compression of triangle mesh connectivity
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Geometric compression for interactive transmission
Proceedings of the conference on Visualization '00
The Compression of the Normal Vectors of 3D Mesh Models Using Clustering
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Normal vector compression of 3D mesh model based on clustering and relative indexing
Future Generation Computer Systems - Special issue: Computer graphics and geometric modeling
Mesh connectivity compression using convection reconstruction
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Smugglers and border guards: the GeoStar project at RPI
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Upper and lower bounds of op-code probabilities for Edgebreaker
International Journal of Computational Science and Engineering
Normal vector compression of 3D mesh model based on clustering and relative indexing
Future Generation Computer Systems
| Hi-index | 0.00 |
In this paper we introduce a new compression technique for the connectivity of a Triangulated Irregular Network (TIN) by using Delaunay triangulation. The strategy in this paper is based on that most of 2.5 dimensional terrain connection are very similar to plane-projected Delaunay triangulation of their vertex set. We only need to keep the vertex coordinates and a few edges that are not included in the Delaunay edges. We present an efficient encoding method for the set of edges using vertex reordering and general bracketing algorithm. Also we propose progressive visualization method for web-based GIS.In the experiments, the method was examined on several TIN data with various resolutions, which were generated by five typical terrain simplification algorithms. The connectivity information of common terrain data could be compressed by 0.23 bits per vertex.