scientific article; zbMATH DE number 7685241
zbMATH Open1514.52007arXiv2201.06290MaRDI QIDQ6157950FDOQ6157950
Authors: Le Hong Trang, Nguyen Thi Le, Phan Thanh An 
Publication date: 12 May 2023
Full work available at URL: https://arxiv.org/abs/2201.06290
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Nonconvex programming, global optimization (90C26) General topics of discrete mathematics in relation to computer science (68R01) Computational aspects related to convexity (52B55) Convex sets in (2) dimensions (including convex curves) (52A10) Approximation by convex sets (52A27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Euclidean shortest paths in the presence of rectilinear barriers
- Direct multiple shooting method for solving approximate shortest path problems
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- Blaschke-type theorem and separation of disjoint closed geodesic convex sets
- On-line construction of the convex hull of a simple polyline
- Title not available (Why is that?)
Cited In (2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157950)
