Some remarks on the method of orienting curves∗

DOI10.1080/01630569508816643MaRDI QIDQ4845188zbMATH OpenOpenAlexFDO

Authors

Publication date 27 October 2003

Published in Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01630569508816643

zbMATH Keywords

method of orienting curvesoptimal controlstate constraints

Mathematics Subject Classification ID

Optimality conditions for problems involving ordinary differential equations (49K15) Numerical methods based on necessary conditions (49M05)

Recommendations

• Principal curves of oriented points: theoretical and computational improvements
• A classification of generic curves on oriented surfaces
• Determining the orientation of closed planar curves
• scientific article; zbMATH DE number 8638
• scientific article; zbMATH DE number 6479635
• scientific article; zbMATH DE number 4142322

Cites work

• Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner
• Method of orienting curves for solving optimal control problems with state constraints¹
• Solving a class of regular optimal control problems with state constraints by the method of orienting curves
• Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven
• Zur Lösung eines zermelosehen nayigationsproblems

Cited in

(12)

• Orienting method for obstacle problems
• A common regularization for three reservoir optimal control problems
• Quicker than Quickhull
• Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
• Method of orienting curves for solving optimal control problems with state constraints¹
• Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
• Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
• Analyzing a maximum principle for finite horizon state constrained problems via parametric examples. II: Problems with bilateral state constraints
• The funnel tree algorithm for finding shortest paths on polyhedral surfaces
• Octagonal and hexadecagonal cut algorithms for finding the convex hull of finite sets with linear time complexity
• An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)
• Determining the orientation of closed planar curves

This page was built for publication: Some remarks on the method of orienting curves^∗

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845188)