Pages that link to "Item:Q800085"
From MaRDI portal
The following pages link to The complexity of incremental convex hull algorithms in \(R^ d\) (Q800085):
Displaying 14 items.
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas (Q672261) (← links)
- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) (Q827092) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- \(\alpha\)-concave hull, a generalization of convex hull (Q1676320) (← links)
- Structural health monitoring of tall buildings with numerical integrator and convex-concave hull classification (Q1954536) (← links)
- A new variational approach based on level-set function for convex hull problem with outliers (Q2037215) (← links)
- A filtering technique for fast convex hull construction in \(\mathbb{R}^2\) (Q2279854) (← links)
- QuickhullDisk: a faster convex hull algorithm for disks (Q2286150) (← links)
- Quicker than Quickhull (Q2354631) (← links)
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points (Q2365326) (← links)
- Multi-core Implementations of Geometric Algorithms (Q3644727) (← links)
- (Q4606269) (← links)
- (Q5091039) (← links)
- A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines (Q6618153) (← links)
