scientific article; zbMATH DE number 4062603

MaRDI QIDQ3796759zbMATH OpenFDO

Authors Mark H. Overmars

Publication date 1988

zbMATH Keywords

computational geometryconnectabilityintersectionobstacle avoidingvisibility

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1182918
• Non-crossing connectors in the plane
• Visibility graphs and obstacle-avoiding shortest paths
• On finding non-intersecting straightline connections of grid points to the boundary
• ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS

Cited in

(1)

• scientific article; zbMATH DE number 1424300 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3796759)