Pages that link to "Item:Q3339305"

The following pages link to An optimal contour algorithm for iso-oriented rectangles (Q3339305):

Displayed 6 items.

• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles (Q790614) ‎ (← links)
• The contour problem for rectilinear polygons (Q802313) ‎ (← links)
• Interval graphs and related topics (Q1060229) ‎ (← links)
• Time-and space-optimal contour computation for a set of rectangles (Q1108000) ‎ (← links)
• Sweep methods for parallel computational geometry (Q1907233) ‎ (← links)
• Divide-and-conquer in planar geometry (Q3802611) ‎ (← links)