• Aucun résultat trouvé

A Suitable Polygonal Approximation for Laser Rangefinder Data

N/A
N/A
Protected

Academic year: 2022

Partager "A Suitable Polygonal Approximation for Laser Rangefinder Data"

Copied!
6
0
0

Texte intégral

Références

Documents relatifs

In this paper, we propose a methodology based upon the statistical analysis of simulation results in order to elaborate a future measurement plan according to an

FIG.9 compares the experimental time complexity of the optimal solution (FSDP), of the full search dynamic programming solution (FSDP), of the multiresolution

Recently, we have proposed a top town multiresolution algorithm (TDMR) [9] that solves the problem of polygonal curve approximation in linear time complexity

Step and curb detection for autonomous vehicles with an algebraic derivative-based approach applied on laser rangefinder data... Step and curb detection for autonomous vehicles with

Comparison between performances obtained using several approaches issued from the literature ( ); our best result (o) and our worst result (+) for 5 runs on the chromosome-shaped

Since the space deformation function d does not depend on a particular surface representation, it can be used to deform all kinds of explicit surface representations, e.g.,

Dans cette partie d’étude, la simulation par éléments finis qui tient compte de la dilatation induite par les élévations de température (cyclage thermique) et

We estimate the approximate answers of different queries with the three methods: the uniform distribution sampling, the measure-based sampling and the statistical model.. We