Pages that link to "Item:Q4327391"
From MaRDI portal
The following pages link to TRIANGULATING DISJOINT JORDAN CHAINS (Q4327391):
Displayed 21 items.
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Visibility queries in a polygonal region (Q833709) (← links)
- Planar rectilinear shortest path computation using corridors (Q833714) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- Separation and approximation of polyhedral objects (Q1900992) (← links)
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- Visibility and ray shooting queries in polygonal domains (Q2261573) (← links)
- Quickest visibility queries in polygonal domains (Q2316797) (← links)
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane (Q2324627) (← links)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- Computing homotopic shortest paths efficiently (Q2432731) (← links)
- Three problems about simple polygons (Q2432735) (← links)
- OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS (Q3503107) (← links)
- (Q5088992) (← links)
- Routing in Polygonal Domains (Q5136225) (← links)
- Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures (Q5458853) (← links)
- Shortcut hulls: vertex-restricted outer simplifications of polygons (Q6103172) (← links)