Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Approximation algorithm”

through a polygonal approximation algorithm

Souheil Ben Yacoub, Jean-michel Jolion · 1994

We propose to study the relationship between the hierachical Hough transform and classical algorithms for partitioning curves into segments. We show that the set of segments found by classical algorithms is a subset of the segments found by the hierarchical Hough transform. This new relationship allows to have a better understanding of the behaviour of some parameters of the hierarchical Hough transform. Keywords: Hough transform; Pyramid; Line/segment extraction; Polygonal curve approximation 1.

Cited by 0

Phase approximation via Remez algorithm

Hyungun Song, Guoxiang Gu · 2002

We consider an important aspect of rational modeling: phase approximation. An algorithm is developed to achieving optimal Chebyshev error where Remez algorithm is proved to be effective. Its applications to the design of recursive digital filters with linear phase are investigated.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cited by 0

Fast Approximation of Convex Hull 1 Simple Approximation Algorithm

Ladislav Kavan · 2008

We consider only the 2D case, although the generalization to higher dimension would be possible. Assume we are given a finite set A of 2D points. Let us denote CH(A) as the (accurate) convex hull of A and suppose that CH(A) contains the origin1. It is well known that CH(A) is the intersection of all half-spaces containing A. The first idea to approximate the convex hull, inspired by k-DOP bounding volumes [1], is to restrict the set of intersected halfspaces. In particular, we confine ourselves to k half-spaces defined as follows. Let angle α = 2π k. We can partition the plane to sectors centered in the origin and given as Si = {x ∈ R 2: atan2(x) ∈〈αi, α(i +1))} si = Si ∩ A

Cited by 0

An approximation algorithm for labelled Markov processes: towards realistic approximation

Re Bouchard-côté, Norm Ferns, Prakash Panangaden et al. · 2005

Abstract — Approximation techniques for labelled Markov processes on continuous state spaces were developed by Desharnais, Gupta, Jagadeesan and Panangaden. However, it has not been clear whether this scheme could be used in practice since it involves inverting a stochastic kernel. We describe a Monte-Carlobased implementation scheme for this approximation algorithm. This is, to the best of our knowledge, the first implementation of this approximation scheme. The implementation involves some novel ideas about how to estimate infs using sampling and also replacing the explicit description of subsets of the state space by tests for membership. It is hoped that this work will enable more applications of continuous probabilistic LMP theory to emerge. I.

Cited by 0

The AAA Algorithm for Rational Approximation

Yuji Nakatsukasa, Olivier Sète, Lloyd N. Trefethen · SIAM Journal on Scientific Computing · 2018

We introduce a new algorithm for approximation by rational functions on a real or complex set of points, implementable in 40 lines of MATLAB and requiring no user input parameters. Even on a disk or interval the algorithm may outperform existing methods, and on more complicated domains it is especially competitive. The core ideas are (1) representation of the rational approximant in barycentric form with interpolation at certain support points and (2) greedy selection of the support points to avoid exponential instabilities. The name AAA stands for “adaptive Antoulas--Anderson” in honor of the authors who introduced a scheme based on (1). We present the core algorithm with a MATLAB code and nine applications and describe variants targeted at problems of different kinds. Comparisons are made with vector fitting, RKFIT, and other existing methods for rational approximation.

Cited by 361Open access

An algorithm for the quadratic approximation

McInnes, A. W., Loi, S.L. · University of Canterbury Research Repository (University of Canterbury) · 2015

The quadratic approximation is a three dimensional analogue of the two dimensional Pade approximation. A determinantal expression&#13;\n for the polynomial coefficients of the quadratic approximation is&#13;\n given. A recursive algorithm for the construction of these coefficients&#13;\n is derived. The algorithm constructs a table of quadratic&#13;\n approximations analogous to the Pade table of rational approximations.

Cited by 0

New algorithm for stochastic approximation (Corresp.)

Ν.Κ. Sinha, Michael Paul Griscik · IEEE Transactions on Information Theory · 1971

A general stochastic approximation algorithm is given along with assumptions and conditions necessary to show that it converges. Convergence is proven in the mean-square sense. The rate of convergence is shown to be better than two algorithms proposed previously.

Cited by 1

Approximation algorithm for multiple strip packing

Marin Bougeret, Pierre-francois Dutot, Klaus Jansen et al. · 2009

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Cited by 0

Approximation Algorithm for GPS Trajectory Simplification

Afast Multiresolution Polygonal, Minjie Chen, Student Member et al. · 2013

Abstract—Recent advances in geopositioning mobile phones have made it possible for users to collect a large number of GPS trajectories by recording their location information. However, these mobile phones with built-in GPS devices usually record far more data than needed, which brings about both heavy data storage and a computationally expensive burden in the rendering process for a Web browser. To address this practical problem, we present a fast polygonal approximation algorithm in 2-D space for the GPS trajectory simplification under the so-called integral square synchronous distance error criterion in a linear time complexity. The underlying algorithm is designed and implemented using a bottom–up multiresolution method, where the input of polygonal approximation in the coarser resolution is the polygonal curve achieved in the finer resolution. For each resolution (map scale), priority-queue structure is exploited in graph construction to construct the initialized approximated curve. Once the polygonal curve is initialized, two fine-tune algorithms are employed in order to achieve the desirable quality level. Experimental results validated that the proposed algorithm is fast and achieves a better approximation result than the existing competitive methods. Index Terms—Geographic information systems (GISs), global positioning system trajectory simplification (GPS TS), polygonal approximation, priority queue, reduced search dynamic programming (RSDP).

Cited by 0