Dynamic orthogonal segment intersection search

Data structures and algorithms for disjoint set union problems

ACM Computing Surveys (CSUR)

Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

Light orthogonal networks with constant geometric dilation

Journal of Discrete Algorithms

Topics in data structures

Algorithms and theory of computation handbook

Faster algorithms for minimum-link paths with restricted orientations

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures

A dynamic stabbing-max data structure with sub-logarithmic query time

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation

An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model

Computational Geometry: Theory and Applications

Minimum-link paths revisited

Computational Geometry: Theory and Applications