A data structure for triangular dissection of multi-resolution images

In this work, the heterogeneous rectangular dissections that represent multi-resolution images of raster data are considered. Specifically, heterogeneous rectangular dissections are changed to triangular dissections in order to provide more effective feature extraction. We propose a method of generating triangular dissections that maintains “octgrid” properties and have developed a list structure suitable for extracting image features (ridges, valleys, etc.) from terrain maps. We propose a detailed list structure called “H12Code” and present examples of feature extraction using H12Code lists.

[1]  Takeo Yaku,et al.  A resolution reduction method for multi-resolution terrain maps , 2012, SIGGRAPH '12.

[2]  Takeo Yaku,et al.  The Number of Cells in Regions Shifted on 2D Images Represented by Raster Data with Heterogeneous Parts , 2013, 2013 14th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing.

[3]  Kimio Sugita,et al.  Ridge Detection with the Steepest Ascent Method , 2011, ICCS.

[4]  Edwin Kinnen,et al.  Rectangular duals of planar graphs , 1985, Networks.

[5]  Youzou Miyadera,et al.  8k-ary Grid Graph Models of Tabular Forms , 2014, Specification, Algebra, and Software.

[6]  Alan H. Barr,et al.  Accurate triangulations of deformed, intersecting surfaces , 1987, SIGGRAPH.

[7]  Renato Pajarola,et al.  Large scale terrain visualization using the restricted quadtree triangulation , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[8]  Marcos Fernández,et al.  Visualization of Large Terrain Using Non-restricted Quadtree Triangulations , 2004, ICCSA.