Pages that link to "Item:Q2970428"
From MaRDI portal
The following pages link to A new algorithm for computing visibility graphs of polygonal obstacles in the plane (Q2970428):
Displaying 10 items.
- Computing the full visibility graph of a set of line segments (Q1198072) (← links)
- The complexity of oblivious plans for orienting and distinguishing polygonal parts (Q1900891) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- Minimum weight connectivity augmentation for planar straight-line graphs (Q2272377) (← links)
- An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem (Q2817863) (← links)
- Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs (Q2980910) (← links)
- An Output-Sensitive Algorithm for Computing Visibility Graphs (Q3982713) (← links)
- (Q4371242) (← links)
- Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles (Q4981173) (← links)
- Computing Shortest Paths in the Plane with Removable Obstacles (Q5116468) (← links)
