Pages that link to "Item:Q2489016"
From MaRDI portal
The following pages link to Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (Q2489016):
Displaying 18 items.
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- Memory efficient algorithms for cactus graphs and block graphs (Q528335) (← links)
- 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)
- In-place algorithms for computing (Layers of) maxima (Q848632) (← links)
- Simplified linear-time Jordan sorting and polygon clipping (Q911762) (← links)
- A new algorithm for computing the convex hull of a planar point set (Q926679) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time (Q1276944) (← links)
- Covering paths for planar point sets (Q2250054) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- A linear-time algorithm for solving the strong hidden-line problem in a simple polygon (Q3776622) (← links)
- (Q4606269) (← links)
- LATIN 2004: Theoretical Informatics (Q5901636) (← links)
