Pages that link to "Item:Q596137"
From MaRDI portal
The following pages link to Space-efficient planar convex hull algorithms (Q596137):
Displaying 18 items.
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Prune-and-search with limited workspace (Q473192) (← links)
- An in-place algorithm for Klee's measure problem in two dimensions (Q845997) (← links)
- In-place algorithms for computing (Layers of) maxima (Q848632) (← links)
- Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
- An efficient convex hull algorithm using affine transformation in planar point set (Q900582) (← links)
- A new algorithm for computing the convex hull of a planar point set (Q926679) (← links)
- Convex hull properties and algorithms (Q984371) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- Convex-hull algorithms: implementation, testing, and experimentation (Q1712057) (← links)
- Synergistic solutions for merging and computing planar convex hulls (Q1790964) (← links)
- A new active convex hull model for image regions (Q2384092) (← links)
- Line-segment intersection made in-place (Q2385700) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (Q2489016) (← links)
- Minimum Dominating Set Problem for Unit Disks Revisited (Q3459050) (← links)
- (Q5091039) (← links)
- LATIN 2004: Theoretical Informatics (Q5901636) (← links)
