Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
From MaRDI portal
Publication:790614
DOI10.1007/BF00264251zbMATH Open0534.68031OpenAlexW2294023352MaRDI QIDQ790614FDOQ790614
Publication date: 1984
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00264251
Recommendations
computational geometryrectanglesdivide-and-conquer algorithmcontour problemmeasure problemorthogonal planer objectsseparational representation
Cites Work
- Title not available (Why is that?)
- Algorithms for Reporting and Counting Geometric Intersections
- Optimal algorithms to compute the closure of a set of iso-rectangles
- Finding Rectangle Intersections by Divide-and-Conquer
- An optimal contour algorithm for iso-oriented rectangles
- Finding the contour of a union of iso-oriented rectangies
Cited In (10)
- Time-and space-optimal contour computation for a set of rectangles
- A practical divide-and-conquer algorithm for the rectangle intersection problem
- Parallel computational geometry of rectangles
- Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra
- On the parallel-decomposability of geometric problems
- An optimal contour algorithm for iso-oriented rectangles
- Finding Rectangle Intersections by Divide-and-Conquer
- Divide-and-conquer in planar geometry
- Title not available (Why is that?)
- The contour problem for rectilinear polygons
This page was built for publication: Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790614)
