The following pages link to Rajasekhar Inkulu (Q833707):
Displaying 24 items.
- Visibility queries in a polygonal region (Q833709) (← links)
- Planar rectilinear shortest path computation using corridors (Q833714) (← links)
- (Q2019447) (redirect page) (← links)
- Visibility polygon queries among dynamic polygonal obstacles in plane (Q2019448) (← 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)
- Minimum weight connectivity augmentation for planar straight-line graphs (Q2272377) (← links)
- Geodesic fault-tolerant additive weighted spanners (Q2300028) (← links)
- Fault-tolerant additive weighted geometric spanners (Q2326563) (← links)
- Maintaining the visibility graph of a dynamic simple polygon (Q2326564) (← links)
- Computing a rectilinear shortest path amid splinegons in plane (Q2327110) (← links)
- Vertex fault-tolerant spanners for weighted points in polygonal domains (Q2692233) (← links)
- Two-point L1 shortest path queries in the plane (Q2970460) (← links)
- Incremental Algorithms to Update Visibility Polygons (Q2971649) (← links)
- Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs (Q2980910) (← links)
- Two-Point L1 Shortest Path Queries in the Plane (Q4635565) (← links)
- Vertex Guarding for Dynamic Orthogonal Art Galleries (Q5072223) (← links)
- Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) (← links)
- Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures (Q5458853) (← links)
- (Q5875571) (← links)
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points (Q6173263) (← links)
- Vertex fault-tolerant spanners for weighted points in polygonal domains (Q6174157) (← links)
- Routing among convex polygonal obstacles in the plane (Q6610091) (← links)
