Per Element Approximation of Plane Curves with Restrictions in Computer-Aided Design of Road Routes

Valery I. Struchenkov^1,

¹Moscow State University of Radio Engineering, Electronics and Automation, Moscow, Russia

Cite this paper:
Valery I. Struchenkov. Per Element Approximation of Plane Curves with Restrictions in Computer-Aided Design of Road Routes. American Journal of Systems and Software. 2013; 1(1):20-25. doi: 10.12691/ajss-1-1-3

Abstract

Approximation problems of plane curves, which are set as a sequence of points arise in computer-aided design of roads. Approximating curve consists of the elements: straight-line and parabolas segments. The parameters of these elements are constrained. Moreover, the number of elements is unknown. This article deals with the problem of per-element approximation, in which the elements must meet to the restrictions of special kind. This problem arises in computer-aided design of the longitudinal profile of road. The problem is solved by dynamic programming.

Keywords:
approximation restrictions dynamic programming nonlinear programming

This work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Figures

References:

[1]	CARD/1. URL: http://www.card-1.com/en/home/.
[2]	Тоpоmаtic Robur. URL: http:// www.topomatic.ru.
[3]	Bentley Rail Track. http://www.bentley.com/.
[4]	C. Parkholup “The system for design of transport highways “Trimble Quantm”, Computer Press, CAD and Grafics, No 3, 2013.
[5]	V. I. Struchenkov. “Optimization Methods in Applied Problems”, Solon-Press, Moscow, 2009.
[6]	V.I. Struchenkov “Mathematical Models and Optimization in Line Structure Routing: Survey and Advanced Results”, International Journal Communication, Network and System Sciences. Special Issue: Models and Algorithms for Application, 5, 2012.
[7]	Nguyen, T.P., Debled-Rennesson, I.: “Decomposition of a curve into arcs and line segments based on dominant point detection. Scandinavian Conference on Image Analysis - SCIA 2011 (2011)".
[8]	Nguyen, T.P., Debled-Rennesson, I.:” A discrete geometry approach for dominant point detection.” Pattern Recognition 44 (2011), 32-44.
[9]	Horng, J.H.: “An adaptive smoothing approach for _tting digital planar curves with line segments and circular arcs.” Pattern Recognition Letters 24 (2003), 565-577.
[10]	Horng, J.H., Li, J.T. “A dynamic programming approach for _tting digital planar curves with line segments and circular arcs. “ Pattern Recognition Letters 22 (2001), 183-197.
[11]	Tortorella, F., Patraccone, R., Molinara, M.: “A dynamic programming approach for segmenting digital planar curves into line segments and circular arcs” In: ICPR. (2008) 1-4.
[12]	Kerautret B, Jacques-Olivier Lachaud J-O, and Nguyen, T.P. “Circular arc reconstruction of digital contours with chosen Hausdorff error." Discrete Geometry for Computer Imagery, Nancy: France (2011).
[13]	R. Bellman “On the approximation of curves by line segments using dynamic programming”. Communications of the ACM vol. 4, №6, 1961, 284-286.
[14]	R. Bellman and S. Drejfus, “Applied Dynamic Programming”, Princeton University Press, Princeton, 1962.
[15]	E.S. Wentzel. “Operations Research: Challenges, principles, metodologiya.” KnoRus, Moscow, 2010.