Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves (Q2694526): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-022-01244-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4304806617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing approximate shortest paths on convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method of orienting curves for determining the convex hull of a finite set of points in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest polygonal paths in space / rank
 
Normal rank
Property / cites work
 
Property / cites work: SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths on polyhedral surfaces and terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path problems on a polyhedral surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of regular optimal control problems with state constraints by the method of orienting curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of optimal control problems which are linear in the control variable by the method of orienting curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5208219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean shortest paths in the presence of rectilinear barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of geodesics on triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Discrete Geodesic Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric spaces, convexity and nonpositive curvature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur Lösung eines zermelosehen nayigationsproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method of orienting curves for solving optimal control problems with state constraints<sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of orienting curves and its application to manipulator trajectory planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the method of orienting curves<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienting method for obstacle problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Shortest Paths in Polyhedral Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently determining a locally exact shortest path on polyhedral surfaces / rank
 
Normal rank

Latest revision as of 20:16, 31 July 2024

scientific article
Language Label Description Also known as
English
Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
scientific article

    Statements

    Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves (English)
    0 references
    3 April 2023
    0 references
    convex non-differentiable optimization
    0 references
    exact algorithm
    0 references
    global solution
    0 references
    path planning
    0 references
    planar unfolding
    0 references
    polyhedral surface
    0 references
    polytope
    0 references
    shortest path
    0 references
    straightest geodesic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references