scientific article; zbMATH DE number 1424303
From MaRDI portal
Publication:4945516
Recommendations
Cited in
(86)- Fast query structures in anisotropic media
- The geodesic farthest-point Voronoi diagram in a simple polygon
- Sparse hop spanners for unit disk graphs
- An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane
- A survey of geodesic paths on 3D surfaces
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- Maximizing the maximum degree in ordered nearest neighbor graphs
- An improved algorithm for computing a shortest watchman route for lines
- Shortest paths, single origin‐destination network design, and associated polyhedra
- On discretization methods for approximating optimal paths in regions with direction-dependent costs
- Minimum-link paths revisited
- An algorithmic approach to some problems in terrain navigation
- Going around in circles
- On the shortest separating cycle
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- \(L_{1}\) cheapest paths in ``Fjord scenery
- Thick non-crossing paths in a polygonal domain
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- Tracing compressed curves in triangulated surfaces
- Polyhedral computational geometry for averaging metric phylogenetic trees
- Computing the geodesic centers of a polygonal domain
- Parameter-free sampled fictitious play for solving deterministic dynamic programming problems
- Shortest path geometric rounding
- Computing simple paths from given points inside a polygon
- Long non-crossing configurations in the plane
- Geodesics in CAT(0) cubical complexes
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
- scientific article; zbMATH DE number 7151640 (Why is no real title available?)
- Computing generalized higher-order Voronoi diagrams on triangulated surfaces
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon
- Maximum thick paths in static and dynamic environments
- Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications
- Watchman tours for polygons with holes
- A linear-time algorithm for the geodesic center of a simple polygon
- Path optimization with limited sensing ability
- A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
- Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
- An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
- Observation routes and external watchman routes
- Drawing Shortest Paths in Geodetic Graphs
- Randolphs Robot Game is NP-hard!
- Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract)
- Computing shortest paths in the plane with removable obstacles
- Watchman routes for lines and line segments
- Constant-factor approximation for TSP with disks
- scientific article; zbMATH DE number 7765415 (Why is no real title available?)
- Covering paths for planar point sets
- Observation routes and external watchman routes
- Polygon exploration with time-discrete vision
- Drawing Shortest Paths in Geodetic Graphs
- An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions
- On the minimum corridor connection problem and other generalized geometric problems
- The touring rays and related problems
- Searching shortest paths on a set of geometric objects
- Ramified rectilinear polygons: coordinatization by dendrons
- Relative convex hulls in semi-dynamic arrangements
- The discrete Voronoi game in a simple polygon
- Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
- Geometric k Shortest Paths
- An experimental study of weighted \(k\)-link shortest path algorithms
- Link distance and shortest path problems in the plane
- Efficient algorithms for touring a sequence of convex polygons and related problems
- Polynomial-time algorithms for the touring rays and related problems
- On a conjecture related to geometric routing
- Evacuating from \(\ell_p\) unit disks in the wireless model
- Planar location problems with block distance and barriers
- A note on the unsolvability of the weighted region shortest path problem
- Using interpolation to improve path planning: The Field D* algorithm
- Efficient computation of geodesic shortest paths
- Flying over a polyhedral terrain
- Inspecting a Set of Strips Optimally
- scientific article; zbMATH DE number 7559212 (Why is no real title available?)
- Fastest-path planning for direction-dependent speed functions
- Geometric approach for optimal routing on a mesh with buses
- Blaschke-type theorem and separation of disjoint closed geodesic convex sets
- Approximation algorithms for geometric shortest path problems
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
- Polygons cuttable by a circular saw
- Colored spanning graphs for set visualization
- Shortest paths and convex hulls in 2D complexes with non-positive curvature
- Computing pseudotriangulations via branched coverings
- Computing approximately shortest descending paths on convex terrains via multiple shooting
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 Q4945516)
