Pages that link to "Item:Q5901636"
From MaRDI portal
The following pages link to LATIN 2004: Theoretical Informatics (Q5901636):
Displaying 9 items.
- A linear-time algorithm to compute the triangular hull of a digital object (Q528337) (← links)
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- An algorithm to find the lineality space of the positive hull of a set of vectors (Q662122) (← links)
- Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
- Simplified linear-time Jordan sorting and polygon clipping (Q911762) (← links)
- Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time (Q1276944) (← links)
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (Q2489016) (← links)
- A linear-time algorithm for solving the strong hidden-line problem in a simple polygon (Q3776622) (← links)
- (Q4606269) (← links)