The following pages link to (Q4945516):
Displaying 50 items.
- Parameter-free sampled fictitious play for solving deterministic dynamic programming problems (Q289136) (← links)
- Fastest-path planning for direction-dependent speed functions (Q368729) (← links)
- Fast query structures in anisotropic media (Q391227) (← links)
- Watchman tours for polygons with holes (Q419503) (← links)
- Going around in circles (Q419506) (← links)
- Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
- Multiple shooting approach for computing approximately shortest paths on convex polytopes (Q507990) (← links)
- Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon (Q598213) (← links)
- Long non-crossing configurations in the plane (Q603879) (← links)
- Link distance and shortest path problems in the plane (Q634253) (← links)
- Geodesics in CAT(0) cubical complexes (Q651054) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- Blaschke-type theorem and separation of disjoint closed geodesic convex sets (Q662859) (← links)
- \(L_{1}\) cheapest paths in ``Fjord scenery'' (Q706968) (← links)
- Computing pseudotriangulations via branched coverings (Q714984) (← links)
- A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
- Path optimization with limited sensing ability (Q729301) (← links)
- Computing generalized higher-order Voronoi diagrams on triangulated surfaces (Q732480) (← links)
- On the longest spanning tree with neighborhoods (Q777263) (← links)
- Planar location problems with block distance and barriers (Q816413) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Ramified rectilinear polygons: coordinatization by dendrons (Q908206) (← links)
- An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions (Q1025292) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← links)
- On discretization methods for approximating optimal paths in regions with direction-dependent costs (Q1045920) (← links)
- Geometric approach for optimal routing on a mesh with buses (Q1362339) (← links)
- Computing the geodesic centers of a polygonal domain (Q1622342) (← links)
- Computing simple paths from given points inside a polygon (Q1630775) (← links)
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods (Q1681325) (← links)
- An improved algorithm for computing a shortest watchman route for lines (Q1685027) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- Computing approximately shortest descending paths on convex terrains via multiple shooting (Q1715706) (← links)
- Shortest path geometric rounding (Q1977118) (← links)
- Polynomial-time algorithms for the touring rays and related problems (Q2039639) (← links)
- Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) (Q2148885) (← links)
- Shortest paths and convex hulls in 2D complexes with non-positive curvature (Q2206723) (← links)
- A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects (Q2210520) (← links)
- A note on the unsolvability of the weighted region shortest path problem (Q2249044) (← links)
- Covering paths for planar point sets (Q2250054) (← links)
- Voronoi diagrams for a moderate-sized point-set in a simple polygon (Q2291454) (← links)
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon (Q2300726) (← links)
- On the shortest separating cycle (Q2306364) (← links)
- The geodesic farthest-point Voronoi diagram in a simple polygon (Q2309478) (← links)
- The discrete Voronoi game in a simple polygon (Q2326396) (← links)
- Thick non-crossing paths in a polygonal domain (Q2341100) (← links)
- Polyhedral computational geometry for averaging metric phylogenetic trees (Q2348943) (← links)
- Flying over a polyhedral terrain (Q2380051) (← links)
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
- Watchman routes for lines and line segments (Q2445196) (← links)
