Pages that link to "Item:Q3337244"

The following pages link to Euclidean shortest paths in the presence of rectilinear barriers (Q3337244):

Displaying 43 items.

• Shortest paths and convex hulls in 2D complexes with non-positive curvature (Q2206723) (← links)
• Largest triangle inside a terrain (Q2222094) (← links)
• Visibility and ray shooting queries in polygonal domains (Q2261573) (← links)
• Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
• Minimal link visibility paths inside a simple polygon (Q2367125) (← links)
• Computation of arc length in the presence of barriers in networks (Q2369184) (← links)
• Computing homotopic shortest paths efficiently (Q2432731) (← links)
• Approximate convex decomposition of polygons (Q2507162) (← links)
• Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
• Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves (Q2694526) (← links)
• ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE (Q2931158) (← links)
• EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS (Q3007721) (← links)
• Euclidean Shortest Paths (Q3093762) (← links)
• Finding a manhattan path and related problems (Q3313268) (← links)
• CUTTING OUT POLYGONS WITH A CIRCULAR SAW (Q3459357) (← links)
• Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon (Q3578011) (← links)
• Algorithms for Computing Diffuse Reflection Paths in Polygons (Q3605484) (← links)
• Visibility graphs and obstacle-avoiding shortest paths (Q3803163) (← links)
• Euclidean shortest path in the presence of obstacles (Q3971576) (← links)
• Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding (Q4631913) (← links)
• Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves (Q4639124) (← links)
• k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON (Q4682198) (← links)
• POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER (Q4682204) (← links)
• OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS (Q4818564) (← links)
• SMOOTHING IMPRECISE 1.5D TERRAINS (Q4931729) (← links)
• Drawing Shortest Paths in Geodetic Graphs (Q5014127) (← links)
• Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier (Q5039041) (← links)
• Drawing Shortest Paths in Geodetic Graphs (Q5050002) (← links)
• Translating polygons with applications to hidden surface removal (Q5056092) (← links)
• Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric (Q5056105) (← links)
• (Q5111738) (← links)
• An optimal algorithm to compute the inverse beacon attraction region (Q5115823) (← links)
• (Q5208219) (← links)
• GUARDING ART GALLERIES BY GUARDING WITNESSES (Q5470173) (← links)
• Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
• Euclidean TSP in narrow strips (Q6059948) (← links)
• Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)
• Efficient computation of the geodesic Voronoi diagram of points in a simple polygon (Q6102304) (← links)
• Finding approximately convex ropes in the plane (Q6157950) (← links)
• k-pairs non-crossing shortest paths in a simple polygon (Q6487450) (← links)
• Dynamic maintenance of shortest path trees in simple polygons (Q6567762) (← links)
• Approximation algorithms for the two-watchman route in a simple polygon (Q6614109) (← links)
• Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D (Q6645154) (← links)