The following pages link to (Q4037437):
Displaying 8 items.
- Three-dimensional weak visibility: Complexity and applications (Q1575678) (← links)
- (Q3704927) (← links)
- A linear-time algorithm for solving the strong hidden-line problem in a simple polygon (Q3776622) (← links)
- An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment (Q4033762) (← links)
- COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (Q4513233) (← links)
- An optimal algorithm for computing visible nearest foreign neighbors among colored line segments (Q5054843) (← links)
- Computing a shortest watchman path in a simple polygon in polynomial-time (Q5057427) (← links)
- Three dimensional weak visibility: Complexity and applications (Q6064014) (← links)
