Pages that link to "Item:Q3719850"
From MaRDI portal
The following pages link to Efficient Algorithms for Geometric Graph Search Problems (Q3719850):
Displaying 24 items.
- Labeling a rectilinear map more efficiently (Q294599) (← links)
- Minimum k-partitioning of rectilinear polygons (Q912618) (← links)
- Labeling points with given rectangles (Q1029061) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles (Q1196367) (← links)
- Morphological decomposition and compression of binary images via a minimum set cover algorithm (Q1716775) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- Schematization of networks (Q1776896) (← links)
- Minimum-link shortest paths for polygons amidst rectilinear obstacles (Q2123290) (← links)
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane (Q2324627) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- Minimum-link paths revisited (Q2450201) (← links)
- A practical map labeling algorithm. (Q2482896) (← links)
- Linear time algorithms for graph search and connectivity determination on complement graphs. (Q2583566) (← links)
- (Q3140432) (← links)
- Minimum K-Adjacent Rectangles of Orthogonal Polygons and its Application (Q3192956) (← links)
- Quadrilaterizing an Orthogonal Polygon in Parallel (Q4379627) (← links)
- Close-to-optimal algorithm for rectangular decomposition of 3D shapes (Q5218999) (← links)
- PARTITIONING 3D PHANTOMS INTO HOMOGENEOUS CUBOIDS (Q5696945) (← links)
- On a minimum linear classification problem (Q5920647) (← links)
- Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)
- An efficient and effective approximation algorithm for the Map Labeling Problem (Q6102319) (← links)
- On geometric shape construction via growth operations (Q6140359) (← links)
- Minimum convex partition of a polygon with holes by cuts in given directions (Q6487451) (← links)
