• Title/Summary/Keyword: contour interpolation

Search Result 53, Processing Time 0.025 seconds

An Interpolation Method for Internal Points of a Single Closed Countour Line (닫혀진 단일 등고선 내부점의 보간법)

  • 고광현;구자영
    • Korean Journal of Remote Sensing
    • /
    • v.14 no.2
    • /
    • pp.129-136
    • /
    • 1998
  • This paper deals with a problem encountered in the course of constructing digital elevation model from a contour map. Deficiencies of widely used linear interpolation method is described, and an interpolation method for internal points of a single closed contour is proposed. Control points not on a plane are searched and interpolated. The method is applied to an artificial contour lines and real contour lines. The result shows natural and accurate reconstruction.

GENERALIZED HERMITE INTERPOLATION AND SAMPLING THEOREM INVOLVING DERIVATIVES

  • Shin, Chang-Eon
    • Communications of the Korean Mathematical Society
    • /
    • v.17 no.4
    • /
    • pp.731-740
    • /
    • 2002
  • We derive the generalized Hermite interpolation by using the contour integral and extend the generalized Hermite interpolation to obtain the sampling expansion involving derivatives for band-limited functions f, that is, f is an entire function satisfying the following growth condition |f(z)|$\leq$ A exp($\sigma$|y|) for some A, $\sigma$ > 0 and any z=$\varkappa$ + iy∈C.

A new approach for B-spline surface interpolation to contours (윤곽선들의 B-spline 곡면 보간을 위한 새로운 방식)

  • Park Hyungjun;Jung Hyung Bae;Kim Kwangsoo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.474-479
    • /
    • 2003
  • This paper addresses the problem of B-spline surface interpolation to serial contours, where the number of points varies from contour to contour. A traditional lofting approach creates a set of B-spline curves via B-spline curve interpolation to each contour, makes them compatible via degree elevation and knot insertion, and performs B-spline surface lofting to get a B-spline surface interpolating them. The approach tends to result in an astonishing number of control points in the resulting B-spline surface. This situation arises mainly from the inevitable process of progressively merging different knot vectors to make the B-spline curves compatible. This paper presents a new approach for avoiding this troublesome situation. The approach includes a novel process of getting a set of compatible B-spline curves from the given contours. The process is based on the universal parameterization [1,2] allowing the knots to be selected freely but leading to a more stable linear system for B-spline curve interpolation. Since the number of control points in each compatible B-spline curve is equal to the highest number of contour points, the proposed approach can realize efficient data reduction and provide a compact representation of a B-spline surface while keeping the desired surface shape. Some experimental results demonstrate its usefulness and quality.

  • PDF

3-Dimensional visualizationof heart in EBT images (EBT 단층 영상에서 심장의 3차원 시각화)

  • 원철호;조진호
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.7
    • /
    • pp.37-45
    • /
    • 1998
  • In this paper, we extracted heart region using dyamic contour model, increased the vertical resolution of heart region by proposed 2-dimensional interpolation method and visualized the 3-dimensional hearet volutme. the proposed new energy term of dynamic contour model considering the gray level and direction of controur vectors is effective to extract the closed heart boundary. And, we generatedvertical slice images from the extracted heart region images using the 2-dimensional linear interpolation by DT(distance transform). We showed that proposed algorithm is useful by 3-dimensional visualization of heart volume.

  • PDF

Interpolation Algorithm Comparison for Contour of Magnified Image (확대 영상의 윤각선 보간 알고리즘 비교)

  • 이용중;김기대;조순조
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2001.10a
    • /
    • pp.381-386
    • /
    • 2001
  • When a input image is extensively magnified on the computer system, it is almost impossible to replicate the original shape because of mismatched coordinates system. In order to resolve the problem, the shape of the magnified image has been reconfigured using the bilinear interpolation method, low pass special filtering interpolation method and B-spline interpolation method, Ferguson curve interpolation method based on the CAD/CAM curve interpolation algorithm. The computer simulation main result was that. Nearest neighbor interpolation method is simple in making the interpolation program but it is not capable to distinguish the original shape. Bilinear interpolation method has the merit to make the magnified shape smooth and soft but calculation time is longer than the other method. Low pass spatial filtering method and B-spline interpolation method has an effect to immerge the intense of the magnified shape but it is also difficult to distinguish the original shape. Ferguson curve interpolation method has sharping shape than B-spline interpolation method.

  • PDF

A Contour Generation Algorithm for Visualizing Non-Lattice Type Data (비격자형 자료의 시각화를 위한 등치선도 생성 알고리즘)

  • Lee, Jun;Kim, Ji-In
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.2
    • /
    • pp.94-104
    • /
    • 2002
  • As a part of scientific data visualization automatic generation algorithms for a contour map have been investigated mainly on data which are defined at every lattice point. But in actual situation like weather data measurement. it is impossible to get data defined at every lattice point This is because the exact value on every lattice point can not be obtained due to characteristics in sampling devices or sampling methods. In order to define data on every lattice point where data were not sampled an interpolation method. was applied to the sample data to assign approximate values for some lattice type data but by using the non-lattice type of sample data sets. A triangle data link was defined by using non lattice points directly based on actually sample data set, not by using the pre-processed rectangle lattice points. The suggested algorithm generates a contour map a contour map only by using sample data set which are much smaller than old one without data interpolation and there is no skew on data any more since it does not need any interpolation to get the values of the defined lattice points.

A Study on the Automatic Generation of Digital Elevation Map based on Contour Map (등고선 지도를 기반으로 한 수치 지형도 자동생성에 관한 연구)

  • Kim, Hae-Jung;Kim, Joon-Seek
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2
    • /
    • pp.558-568
    • /
    • 2000
  • In the paper, we propose the automatic generation method of digital elevation map based on contour map. The proposed method classifies contour data and non-contour data by thinning and labelling process of the contour line and then connects smoothly broken contour line by Bezier curve. Finally, the digital devation map is generated by the interpolation using the height data of the contour line. The proposed method can reduce vest effort, time and expense which is spend to make digital elevation map.

  • PDF

Polar-coordinates Linear Interpolation for Contour Reconstruction at Summit Area (정상 근방의 등고선 재구성을 위한 극좌표계 선형 보간)

  • 박천주;전병민
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2003.11a
    • /
    • pp.407-413
    • /
    • 2003
  • To connect the gap on the contours at the summit area, we propose the linear interpolation in the polar coordinates. The results of appling both existing algorithms and proposed method to some graphic images, the proposed interpolation method was superior. Also by generating a new curve having similar appearance of neighboring contours, the connected contours were reconstructed naturally.

  • PDF

Generalized Cylinder based on Linear Interpolation by Direction Map

  • Kim, Hyun;Kim, Hyoung-Sun;Lee, Joo-Haeng
    • International Journal of CAD/CAM
    • /
    • v.3 no.1_2
    • /
    • pp.77-83
    • /
    • 2003
  • We propose two algorithms to generate (1) polygonal meshes and (2) developable surface patches far generalized cylinders defined by contours of discrete curves. To solve the contour blending problem of generalized cylinder, the presented algorithms have adopted the algorithm and related properties of LIDM (linear interpolation by direction map) that interpolate geometric shapes based on direction map merging and group scaling operations. Proposed methods are fast to compute and easy to implement.

An interpolation method of b-spline surface for hull form design

  • Jung, Hyung-Bae
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.2 no.4
    • /
    • pp.195-199
    • /
    • 2010
  • This paper addresses the problem of B-spline surface interpolation of scattered points for a hull form design, which are not arbitrarily scattered, but can be arranged in a series of contours permitting variable number of points in the contours. A new approach that allows different parameter value for each point on the same contour has been adopted. The usefulness and quality of the interpolation has been demonstrated with some experimental results.