Pages that link to "Item:Q802313"
From MaRDI portal
The following pages link to The contour problem for rectilinear polygons (Q802313):
Displaying 9 items.
- Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles (Q790614) (← links)
- Time-and space-optimal contour computation for a set of rectangles (Q1108000) (← links)
- Systolic algorithms for rectilinear polygons (Q1108798) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles (Q1943607) (← links)
- A fast algorithm for an envelope construction of a huge set of topologically consistent polygons (Q2575283) (← links)
- The Hausdorff core problem on simple polygons (Q2968107) (← links)
- An application of the Hooley-Huxley contour (Q4275451) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901273) (← links)