The following pages link to Christian Icking (Q170470):
Displaying 21 items.
- Shortest paths for line segments (Q686741) (← links)
- (Q1007622) (redirect page) (← links)
- Voronoi diagram for services neighboring a highway (Q1007626) (← links)
- How to find a point on a line within a fixed distance (Q1289022) (← links)
- Competitive searching in a generalized street (Q1807650) (← links)
- The polygon exploration problem (Q2784471) (← links)
- (Q3795194) (← links)
- THE TWO GUARDS PROBLEM (Q4030351) (← links)
- Self-approaching curves (Q4238779) (← links)
- (Q4327372) (← links)
- (Q4413793) (← links)
- (Q4499945) (← links)
- An Optimal Competitive Strategy for Walking in Streets (Q4651475) (← links)
- (Q4736555) (← links)
- (Q4796181) (← links)
- Moving an angle around a region (Q5054844) (← links)
- A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D (Q5175985) (← links)
- (Q5501793) (← links)
- Computing and Combinatorics (Q5716972) (← links)
- Generalized self-approaching curves (Q5929319) (← links)
- On bisectors for different distance functions (Q5929325) (← links)