Minimal tangent visibility graphs

Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons

Proceedings of the eighteenth annual symposium on Computational geometry

On the minimum size of visibility graphs

Information Processing Letters

Tight degree bounds for pseudo-triangulations of points

Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01

Spatial embedding of pseudo-triangulations

Proceedings of the nineteenth annual symposium on Computational geometry

Segment endpoint visibility graphs are Hamiltonian

Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01

Convexity minimizes pseudo-triangulations

Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02

Minimum weight pseudo-triangulations

Computational Geometry: Theory and Applications

On the number of pseudo-triangulations of certain point sets

Journal of Combinatorial Theory Series A

Pointed binary encompassing trees: Simple and optimal

Computational Geometry: Theory and Applications

Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time

Computational Geometry: Theory and Applications

Efficient wayfinding in complex environments: derivation of a continuous space shortest path

Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science