scientific article; zbMATH DE number 1424303

Publication date: 23 March 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Trees (05C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38)

Related Items

Sparse hop spanners for unit disk graphs, Computing the geodesic centers of a polygonal domain, Parameter-free sampled fictitious play for solving deterministic dynamic programming problems, On the minimum corridor connection problem and other generalized geometric problems, Computing simple paths from given points inside a polygon, Flying over a polyhedral terrain, Unnamed Item, Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract), Inspecting a Set of Strips Optimally, Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon, Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon, Fastest-path planning for direction-dependent speed functions, The touring rays and related problems, Long non-crossing configurations in the plane, A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes, A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods, Fast query structures in anisotropic media, An improved algorithm for computing a shortest watchman route for lines, Evacuating from \(\ell_p\) unit disks in the wireless model, Watchman tours for polygons with holes, Going around in circles, An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons, Observation routes and external watchman routes, Colored spanning graphs for set visualization, Constant-Factor Approximation for TSP with Disks, Link distance and shortest path problems in the plane, Ramified rectilinear polygons: coordinatization by dendrons, Shortest paths and convex hulls in 2D complexes with non-positive curvature, A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects, Unnamed Item, Computing approximately shortest descending paths on convex terrains via multiple shooting, Watchman routes for lines and line segments, Geodesics in CAT(0) cubical complexes, A survey of geodesic paths on 3D surfaces, Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems, Minimum-link paths revisited, An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane, Relative convex hulls in semi-dynamic arrangements, Blaschke-type theorem and separation of disjoint closed geodesic convex sets, Multiple shooting approach for computing approximately shortest paths on convex polytopes, An Experimental Study of Weighted k-Link Shortest Path Algorithms, A note on the unsolvability of the weighted region shortest path problem, Covering paths for planar point sets, Maximum thick paths in static and dynamic environments, Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings, \(L_{1}\) cheapest paths in ``Fjord scenery, An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model, A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes, Computing pseudotriangulations via branched coverings, Unnamed Item, Polygons cuttable by a circular saw, A linear-time algorithm for the geodesic center of a simple polygon, Path optimization with limited sensing ability, Computing generalized higher-order Voronoi diagrams on triangulated surfaces, Polynomial-time algorithms for the touring rays and related problems, Voronoi diagrams for a moderate-sized point-set in a simple polygon, Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications, Unnamed Item, A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon, Tracing compressed curves in triangulated surfaces, Using interpolation to improve path planning: The Field D* algorithm, On the shortest separating cycle, The geodesic farthest-point Voronoi diagram in a simple polygon, An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions, Polygon exploration with time-discrete vision, On the longest spanning tree with neighborhoods, The discrete Voronoi game in a simple polygon, On discretization methods for approximating optimal paths in regions with direction-dependent costs, Computing Shortest Paths in the Plane with Removable Obstacles, Thick non-crossing paths in a polygonal domain, Randolphs Robot Game is NP-hard!, Polyhedral computational geometry for averaging metric phylogenetic trees, Planar location problems with block distance and barriers