The following pages link to WALKING IN A TRIANGULATION (Q3021946):
Displaying 18 items.
- Multiple phases and vicious walkers in a wedge (Q253010) (← links)
- The stochastic walk algorithms for point location in pseudo-triangulations (Q634299) (← links)
- Walking in circles (Q712279) (← links)
- Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation (Q724951) (← links)
- Parallel geometric algorithms for multi-core computers (Q991179) (← links)
- Computing equilibria in dynamic models with occasionally binding constraints (Q1994308) (← links)
- Classroom examples of robustness problems in geometric computations (Q2479475) (← links)
- Practical distribution-sensitive point location in triangulations (Q2637075) (← links)
- Efficiently navigating a random Delaunay triangulation (Q2789543) (← links)
- Recognition of times a walker is close to the origin (Q2863799) (← links)
- Walking in Streets with Minimal Sensing (Q2867134) (← links)
- An efficient and robust localization scheme on massively distributed systems (Q2952636) (← links)
- Walkers on the Cycle and the Grid (Q3629474) (← links)
- Walking in a Planar Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path (Q4557734) (← links)
- Stretch factor in a planar Poisson–Delaunay triangulation with a large intensity (Q5214990) (← links)
- TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator (Q5270714) (← links)
- Walking through waypoints (Q5918830) (← links)
- An efficient and locking-free material point method for three-dimensional analysis with simplex elements (Q6555535) (← links)
