Computing simple circuits from a set of line segments

Computational geometry column 18

ACM SIGACT News

Segment endpoint visibility graphs are Hamiltonian

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

Alternating paths through disjoint line segments

Information Processing Letters

Compatible geometric matchings

Computational Geometry: Theory and Applications

Pointed binary encompassing trees: Simple and optimal

Computational Geometry: Theory and Applications

Unsolved problems in visibility graphs of points, segments, and polygons

ACM Computing Surveys (CSUR)

Compatible spanning trees

Computational Geometry: Theory and Applications