The following pages link to Ovidiu Daescu (Q185436):
Displaying 13 items.
- Finding an optimal path without growing the tree (Q4820903) (← links)
- (Q4952691) (← links)
- On geometric path query problems (Q5096943) (← links)
- Algorithms and Computation (Q5191631) (← links)
- Kinetic Red-Blue Minimum Separating Circle (Q5199171) (← links)
- Computing Simple Paths on Points in Simple Polygons (Q5302737) (← links)
- Guarding a terrain by two watchtowers (Q5370631) (← links)
- Algorithms and Data Structures (Q5394261) (← links)
- Farthest-Point Queries with Geometric and Combinatorial Constraints (Q5449755) (← links)
- CUTTING OUT POLYGONS WITH LINES AND RAYS (Q5470174) (← links)
- Algorithms and Computation (Q5712155) (← links)
- Determining an optimal penetration among weighted regions in two and three dimensions (Q5935738) (← links)
- Guarding a terrain by two watchtowers (Q5961974) (← links)