scientific article; zbMATH DE number 7685241
From MaRDI portal
Publication:6157950
Convex sets in (2) dimensions (including convex curves) (52A10) Approximation by convex sets (52A27) Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Analysis of algorithms and problem complexity (68Q25) General topics of discrete mathematics in relation to computer science (68R01) Nonconvex programming, global optimization (90C26)
Recommendations
Cites work
- Blaschke-type theorem and separation of disjoint closed geodesic convex sets
- Direct multiple shooting method for solving approximate shortest path problems
- Euclidean shortest paths in the presence of rectilinear barriers
- scientific article; zbMATH DE number 7151640 (Why is no real title available?)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- On-line construction of the convex hull of a simple polyline
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)