Pages that link to "Item:Q891822"
From MaRDI portal
The following pages link to Near optimal line segment queries in simple polygons (Q891822):
Displaying 9 items.
- Simplified linear-time Jordan sorting and polygon clipping (Q911762) (← links)
- Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time (Q1276944) (← links)
- Efficient visibility queries in simple polygons (Q1862134) (← links)
- Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
- Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
- Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments (Q3188909) (← links)
- Weak visibility queries of line segments in simple polygons and polygonal domains (Q4641577) (← links)
- A Probabilistic Analysis of Trie-Based Sorting of Large Collections of Line Segments in Spatial Databases (Q5700568) (← links)
- Optimal window queries on line segments using the trapezoidal search DAG (Q6168974) (← links)