Propagating Updates of Residential Areas in Multi-Representation Databases Using Constrained Delaunay Triangulations

نویسندگان

  • Xinchang Zhang
  • Taisheng Guo
  • Jianfeng Huang
  • Qinchuan Xin
چکیده

Updating topographic maps in multi-representation databases is crucial to a number of applications. An efficient way to update topographic maps is to propagate the updates from large-scale maps to small-scale maps. Because objects are often portrayed differently in maps of different scales, it is a complicated process to produce multi-scale topographic maps that meet specific cartographical criteria. In this study, we propose a new approach to update small-scale maps based on updated large-scale maps. We first group spatially-related objects in multi-scale maps and decompose the large-scale objects into triangles based on constrained Delaunay triangulation. We then operate the triangles and construct small-scale objects by accounting for cartographical generalization rules. In addition, we apply the Tabu Search algorithm to search for the optimal sequences when constructing small-scale objects. A case study was conducted by applying the developed method to update residential areas at varied scales. We found the proposed method could effectively update small-scale maps while maintaining the shapes and positions of large-scale objects. Our developed method allows for parallel processing of update propagation because it operates grouped objects together, thus possesses computational advantages over the sequential updating method in areas with high building densities. Although the method proposed in this study requires further tests, it shows promise with respect to automatic updates of polygon data in the multi-representation databases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a Definition of Higher Order Constrained Delaunay Triangulations

When a triangulation of a set of points and edges is required, the constrained Delaunay triangulation is often the preferred choice because of its well-shaped triangles. However, in applications like terrain modeling, it is sometimes necessary to have flexibility to optimize some other aspect of the triangulation, while still having nicely-shaped triangles and including a set of constraints. Hi...

متن کامل

Fully Dynamic Constrained Delaunay Triangulations

We present algorithms for the efficient insertion and removal of constraints in Delaunay Triangulations. Constraints are considered to be points or any kind of polygonal lines. Degenerations such as edge overlapping, self-intersections or duplicated points are allowed and are automatically detected and fixed on line. As a result, a fully Dynamic Constrained Delaunay Triangulation is achieved, a...

متن کامل

Constrained Delaunay Triangulations and Algorithms

Two-dimensional constrained Delaunay triangulations (of a planar straight-linegraph) introduced independently by Lee et al. [2] and Chew [1] are well studied struc-tures and can be constructed in optimal time. However, the generalization of suchobjects to three and higher dimensions is much less discussed in literature.In this talk, we first define a constrained Delaunay tri...

متن کامل

General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties

Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of user-specified domains, they have “nicely shaped” triangles that optimize several criteria, and they are easy to construct and update. The present work generalizes constrained Delaunay triangulations (CDTs) to higher dimensions, a...

متن کامل

From Constrained Delaunay Triangulations to Roadmap Graphs with Arbitrary Clearance

This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstract representation of all the paths that can potentially be followed around a given set of obstacles. Our solution consists in an original refinement algorithm for constrained Delaunay triangulations, aimed at generat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • ISPRS Int. J. Geo-Information

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2016