Pages that link to "Item:Q2706112"
From MaRDI portal
The following pages link to Taking a walk in a planar arrangement (Q2706112):
Displaying 16 items.
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Approximating the maximum overlap of polygons under translation (Q527417) (← links)
- Walking in circles (Q712279) (← links)
- Sorting weighted distances with applications to objective function evaluations in single facility location problems. (Q1426729) (← links)
- Median trajectories (Q2375955) (← links)
- Online point location in planar arrangements and its applications (Q2768272) (← links)
- A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams (Q2942610) (← links)
- WALKING IN A TRIANGULATION (Q3021946) (← links)
- Walks with small steps in the quarter plane (Q3062350) (← links)
- Walkers on the Cycle and the Grid (Q3629474) (← links)
- AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE (Q4661880) (← links)
- PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS (Q4818570) (← links)
- (Q4891789) (← links)
- Walking through waypoints (Q5918830) (← links)
- Online point location in planar arrangements and its applications (Q5939538) (← links)