Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner

DOI10.1080/02331938708843244zbMath0656.52002OpenAlexW2087686493MaRDI QIDQ3803744

Hoang Xuan Phu

Publication date: 1987

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

Steiner problemgeometrical problems of optimizationinpolygons with minimal circumferenceoriented curve

Mathematics Subject Classification ID

Convex programming (90C25) Convex sets in (2) dimensions (including convex curves) (52A10) Geometric constructions in real or complex geometry (51M15)

Related Items (20)

A fast modification of Focke's shortest inpolygon construction ⋮ Solution method for regular optimal control problems with state constraints ⋮ Method of orienting curves for solving optimal control problems with state constraints¹ ⋮ Some remarks on the method of orienting curves^∗ ⋮ A fast and efficient algorithm for determining the connected orthogonal convex hulls ⋮ Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves ⋮ A common regularization for three reservoir optimal control problems ⋮ The method of orienting curves and its application to manipulator trajectory planning ⋮ Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding ⋮ The inpolygon with minimal area and the cirenmpolygon ⋮ Method of orienting curves for determining the convex hull of a finite set of points in the plane ⋮ Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves ⋮ Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon ⋮ Shortest polygonal paths in space ⋮ The circumpolygon with maximal area ⋮ Analyzing a Maximum Principle for Finite Horizon State Constrained Problems via Parametric Examples. Part 2: Problems with Bilateral State Constraints ⋮ An Exact Algorithm for Minimizing a Sum of Euclidean Norms on Rays in 2D and 3D ⋮ An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves ⋮ Orienting method for obstacle problems ⋮ Quicker than Quickhull

Cites Work

• A finite descent method for Steiner's problem of inpolygons with minimal circumference
• Zur Lösung eines zermelosehen nayigationsproblems

This page was built for publication: Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner