Pages that link to "Item:Q3313268"
From MaRDI portal
The following pages link to Finding a manhattan path and related problems (Q3313268):
Displaying 14 items.
- An O(n log n) Manhattan path algorithm (Q795510) (← links)
- Rectangular partition is polynomial in two dimensions but NP-complete in three (Q808703) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles (Q1196367) (← links)
- 3D rectangulations and geometric matrix multiplication (Q1702124) (← links)
- Extracting compact fuzzy rules based on adaptive data approximation using B-splines (Q1857071) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- (Q2728893) (← links)
- 3D Rectangulations and Geometric Matrix Multiplication (Q2942614) (← links)
- Minimum K-Adjacent Rectangles of Orthogonal Polygons and its Application (Q3192956) (← links)
- Polygon Area Decomposition for Multiple-Robot Workspace Division (Q4513222) (← links)
- Between Broadway and the Hudson: A Bijection of Corridor Paths (Q5856390) (← links)
- Minimum convex partition of a polygon with holes by cuts in given directions (Q6487451) (← links)