scientific article; zbMATH DE number 3846893

MaRDI QIDQ3316614zbMATH OpenFDO

Authors Ralf Hartmut Gueting

Publication date 1982

zbMATH Keywords

contour problemmeasure problemtime- optimal divide-and-conquer algorithmunion of a set of rectangles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
• Divide-and-conquer in planar geometry
• An optimal contour algorithm for iso-oriented rectangles
• The contour problem for rectilinear polygons
• Time-and space-optimal contour computation for a set of rectangles

Cited in

(7)

• Time-and space-optimal contour computation for a set of rectangles
• An optimal contour algorithm for iso-oriented rectangles
• Finding Rectangle Intersections by Divide-and-Conquer
• Divide-and-conquer in planar geometry
• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
• The contour problem for rectilinear polygons
• Optimal algorithms to compute the closure of a set of iso-rectangles

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 Q3316614)