Pages that link to "Item:Q3718154"
From MaRDI portal
The following pages link to The Ultimate Planar Convex Hull Algorithm? (Q3718154):
Displaying 50 items.
- Reprint of: Extreme point and halving edge search in abstract order types (Q390177) (← links)
- Prune-and-search with limited workspace (Q473192) (← links)
- A linear-time algorithm to compute the triangular hull of a digital object (Q528337) (← links)
- Computing simple circuits from a set of line segments (Q583232) (← links)
- Optimal parallel algorithms for computing convex hulls and for sorting (Q594601) (← links)
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- Connectivity guarantees for wireless networks with directional antennas (Q654284) (← links)
- Output-sensitive peeling of convex and maximal layers (Q671619) (← links)
- Randomized quickhull (Q675302) (← links)
- Fast randomized parallel methods for planar convex hull construction (Q676065) (← links)
- Computing pseudotriangulations via branched coverings (Q714984) (← links)
- Computing shortest transversals (Q757096) (← links)
- Opportunistic algorithms for eliminating supersets (Q758205) (← links)
- On partitions and presortedness of sequences (Q808689) (← 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)
- Computing Euclidean maximum spanning trees (Q911288) (← links)
- An optimal parallel algorithm for linear programming in the plane (Q915450) (← links)
- An efficient and numerically correct algorithm for the 2D convex hull problem (Q919797) (← links)
- A new algorithm for computing the convex hull of a planar point set (Q926679) (← links)
- Random convex hulls and extreme value statistics (Q967627) (← links)
- Geometric containment and vector dominance (Q1093914) (← links)
- A variant of Ben-Or's lower bound for algebraic decision trees (Q1096401) (← links)
- Some problems in computational geometry (Q1101225) (← links)
- Finding the convex hull of a sorted point set in parallel (Q1108791) (← links)
- An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains (Q1124331) (← links)
- A lower bound for the integer element distinctness problem (Q1175947) (← links)
- Computing the convex hull in a hammock (Q1177390) (← links)
- Applications of a semi-dynamic convex hull algorithm (Q1196456) (← links)
- Geometric medians (Q1201233) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- An optimal convex hull algorithm in any fixed dimension (Q1312190) (← links)
- Derandomizing an output-sensitive convex hull algorithm in three dimensions (Q1346251) (← links)
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel (Q1367171) (← links)
- Fast stabbing of boxes in high dimensions (Q1583093) (← links)
- Convex-hull algorithms: implementation, testing, and experimentation (Q1712057) (← links)
- Optimizing a constrained convex polygonal annulus (Q1775012) (← links)
- Constructing the convex hull of a partially sorted set of points (Q1803271) (← links)
- Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
- Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
- Applications of random sampling in computational geometry. II (Q1823685) (← links)
- On computing the closest boundary point on the convex hull (Q1824383) (← links)
- Lower bounds for maximal and convex layers problems (Q1825651) (← links)
- Staircase visibility and computation of kernels (Q1894710) (← links)
- Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\) (Q1894936) (← links)
- A time-optimal parallel algorithm for three-dimensional convex hulls (Q1899449) (← links)
- Convex hulls of spheres and convex hulls of disjoint convex polytopes (Q1947973) (← links)
- On computing the convex hull of (piecewise) curved objects (Q1948676) (← links)
- A new variational approach based on level-set function for convex hull problem with outliers (Q2037215) (← links)
- Efficiently testing digital convexity and recognizing digital convex polygons (Q2203347) (← links)
- Shortest paths and convex hulls in 2D complexes with non-positive curvature (Q2206723) (← links)
