Add to ORKGA method for selecting data points from a finite set of curve points is discussed. The given curve points originate from a smooth curve and are weighted with respect to a local curvature measure. The most significant points are selected and used to approximate the curve. The selected subset of data points is distributed in such a way that they are uniformly distributed with respect to integrated absolute curvature. The technique is tested for various planar curves and is applied to 2D image compression and volume visualization
In this paper, we propose a curve construction method for a non uniform point data set based on a mi...
An optimal curve fitting technique has been developed which is meant to automatically provide a fit ...
Abstract — In this paper we present a novel and efficient method, called shoulder point detection (S...
A technique for the iterative selection of 3D points with associated function values (trivariate dat...
An on-line method for piecewise linear approximation of open or closed space curves is described. Th...
This paper presents a new method of curve-fitting to a set of noisy samples. In the case of fitting ...
Given a set of possibly noisy data belonging to a spatial curve, we propose a strategy, based ...
curve fitting to unorganized data points by nonlinear minimization Lian Fang and David C Gossard Man...
Abstract. Given a large set of irregularly spaced points in the plane, an algorithm for partitioning...
Approximating a set of points by a functional curve or surface in the d-D space is a fundamental top...
Several geometric criteria to fit a polygonal closed curve to discrete two-dimensional data are cons...
This chapter presents an iterative smoothing technique for polygonal approximation of digital image ...
Geometric models represent the shape and structure of objects. The mathematical description of geome...
Abstract. In this paper we present a novel nonparametric method for simplifying piecewise linear cur...
AbstractEfficient algorithms for shape preserving approximation to curves and surfaces are very impo...
In this paper, we propose a curve construction method for a non uniform point data set based on a mi...
An optimal curve fitting technique has been developed which is meant to automatically provide a fit ...
Abstract — In this paper we present a novel and efficient method, called shoulder point detection (S...
A technique for the iterative selection of 3D points with associated function values (trivariate dat...
An on-line method for piecewise linear approximation of open or closed space curves is described. Th...
This paper presents a new method of curve-fitting to a set of noisy samples. In the case of fitting ...
Given a set of possibly noisy data belonging to a spatial curve, we propose a strategy, based ...
curve fitting to unorganized data points by nonlinear minimization Lian Fang and David C Gossard Man...
Abstract. Given a large set of irregularly spaced points in the plane, an algorithm for partitioning...
Approximating a set of points by a functional curve or surface in the d-D space is a fundamental top...
Several geometric criteria to fit a polygonal closed curve to discrete two-dimensional data are cons...
This chapter presents an iterative smoothing technique for polygonal approximation of digital image ...
Geometric models represent the shape and structure of objects. The mathematical description of geome...
Abstract. In this paper we present a novel nonparametric method for simplifying piecewise linear cur...
AbstractEfficient algorithms for shape preserving approximation to curves and surfaces are very impo...
In this paper, we propose a curve construction method for a non uniform point data set based on a mi...
An optimal curve fitting technique has been developed which is meant to automatically provide a fit ...
Abstract — In this paper we present a novel and efficient method, called shoulder point detection (S...