Skip to content

Implementation of the research paper “Optimal Divide-and-Conquer to Compute Measure and Contour for a Set of Iso-Rectangles” by Ralf Hartmut Guting.

Notifications You must be signed in to change notification settings

anuj-kh/DAA-Assignment-1

Repository files navigation

DAA-Assignment-1

Implementation of the research paper “Optimal Divide-and-Conquer to Compute Measure and Contour for a Set of Iso-Rectangles” by Ralf Hartmut Guting.

The problem statement can be found here

The code documentation can be found here
The input/output, discussion of the algorithm and complexity analysis can be found here

About

Implementation of the research paper “Optimal Divide-and-Conquer to Compute Measure and Contour for a Set of Iso-Rectangles” by Ralf Hartmut Guting.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published