Pages that link to "Item:Q3026389"
From MaRDI portal
The following pages link to A linear time algorithm for minimum link paths inside a simple polygon (Q3026389):
Displaying 39 items.
- Diffuse reflection diameter in simple polygons (Q299067) (← links)
- Link distance and shortest path problems in the plane (Q634253) (← links)
- Finding an approximate minimum-link visibility path inside a simple polygon (Q672401) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q675296) (← links)
- Diffuse reflection radius in a simple polygon (Q727965) (← links)
- Finding minimal nested polygons (Q802901) (← links)
- Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) (← links)
- Construction of \(\epsilon\)-nets (Q914376) (← links)
- An optimal algorithm for computing a minimum nested nonconvex polygon (Q918739) (← links)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← links)
- Separating two simple polygons by a sequence of translations (Q1104080) (← links)
- Triangulating a simple polygon in linear time (Q1176324) (← links)
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon (Q1193703) (← links)
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets (Q1370934) (← links)
- Visibility with multiple diffuse reflections (Q1392849) (← links)
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- A linear-time algorithm for constructing a circular visibility diagram (Q1897474) (← links)
- Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- A fast shortest path algorithm on terrain-like graphs (Q2046450) (← links)
- Minimal link visibility paths inside a simple polygon (Q2367125) (← links)
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons (Q2446331) (← links)
- Minimum-link paths revisited (Q2450201) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- Gender-aware facility location in multi-gender world (Q3301019) (← links)
- Link Distance and Shortest Path Problems in the Plane (Q3638449) (← links)
- Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons (Q5025050) (← links)
- The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
- Parallel algorithms for all minimum link paths and link center problems (Q5056133) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q5056155) (← links)
- Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons (Q5056907) (← links)
- An O(n log n) algorithm for computing a link center in a simple polygon (Q5096146) (← links)
- Constructing pairwise disjoint paths with few links (Q5096957) (← links)
- Coloring polygon visibility graphs and their generalizations (Q6038590) (← links)
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon (Q6057802) (← links)
- (Q6179335) (← links)
