An optimal contour algorithm for iso-oriented rectangles
From MaRDI portal
Recommendations
- Time-and space-optimal contour computation for a set of rectangles
- The contour problem for rectilinear polygons
- scientific article; zbMATH DE number 3846893
- Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
- An optimal time and minimal space algorithm for rectangle intersection problems
Cited in
(17)- Time-and space-optimal contour computation for a set of rectangles
- The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees
- scientific article; zbMATH DE number 2105040 (Why is no real title available?)
- Sweep methods for parallel computational geometry
- Isothetic polygon representation for contours
- A new contouring algorithm
- An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles
- An output-sensitive algorithm for computing the union of cubes and fat boxes in 3D
- Interval graphs and related topics
- An optimal time and minimal space algorithm for rectangle intersection problems
- Divide-and-conquer in planar geometry
- scientific article; zbMATH DE number 3846893 (Why is no real title available?)
- Hole Problems for Rectangles in the Plane
- scientific article; zbMATH DE number 3804872 (Why is no real title available?)
- 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: An optimal contour algorithm for iso-oriented rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3339305)
