An Optimal Morphing between Polylines

نویسنده

  • SERGEI BESPAMYATNIKH
چکیده

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

ثبت نام

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

منابع مشابه

A new core-based morphing algorithm for polygons

Morphing is a process of shape transformation between two objects. This paper focuses on morphing of simple polygons. In general, the key part of most morphing methods is to find correspondence between vertices of both objects. We present a new algorithm trying to avoid this step. Using an idea of intersection of two polygons (called core) the problem of morphing polygons is decomposed to sever...

متن کامل

Morphing polylines: A step towards continuous generalization

We study the problem of morphing between two polylines that represent linear geographical features like roads or rivers generalized at two different scales. This problem occurs frequently during continuous zooming in interactive maps. Situations in which generalization operators like typification and simplification replace, for example, a series of consecutive bends by fewer bends are not alway...

متن کامل

New Similarity Measures between Polylines with Applications to Morphing and Polygon

We introduce two new related metrics, the geodesic width and the link width, for measuring the “distance” between two nonintersecting polylines in the plane. If the two polylines have n vertices in total, we present algorithms to compute the geodesic width of the two polylines in O(n2 log n) time using O(n2) space and the link width in O(n3 log n) time using O(n2) working space where n is the t...

متن کامل

New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping

We introduce two new related metrics, the geodesic width and the link width, for measuring the “distance” between two non-intersecting polylines in the plane. If the two polylines have n vertices in total, we present algorithms to compute the geodesic width of the two polylines in O(n2 log n) time using O(n2) space and the link width in O(n3 log n) time using O(n2) working space where n is the ...

متن کامل

Continuous Scale Transformations of Linear Features Using Simulated Annealing-Based Morphing

This paper presents a new method for use in performing continuous scale transformations of linear features using Simulated Annealing-Based Morphing (SABM). This study addresses two key problems in the continuous generalization of linear features by morphing, specifically the detection of characteristic points and correspondence matching. First, an algorithm that performs robust detection of cha...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010