Pages that link to "Item:Q1108000"
From MaRDI portal
The following pages link to Time-and space-optimal contour computation for a set of rectangles (Q1108000):
Displaying 8 items.
- Space-optimal hidden line elimination for rectangles (Q673345) (← links)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles (Q790614) (← links)
- The contour problem for rectilinear polygons (Q802313) (← 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)
- Data filtering based least squares iterative algorithm for parameter identification of output error autoregressive systems (Q2015157) (← links)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777) (← links)