A data structure for triangular dissection of multi-resolution images

Taiyou Kikuchi, Shinji Koka, Koichi Anada, Youzou Miyadera, Takeo Yaku · 2014

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.

Read the paper · More papers on PaperTik