Pages that link to "Item:Q1816463"
From MaRDI portal
The following pages link to Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463):
Displaying 30 items.
- Competing output-sensitive frame algorithms (Q419370) (← links)
- Optimal partition trees (Q420575) (← links)
- A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations (Q471140) (← links)
- Outlier respecting points approximation (Q517798) (← links)
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- Output-sensitive peeling of convex and maximal layers (Q671619) (← links)
- Robust vertex enumeration for convex hulls in high dimensions (Q827269) (← links)
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q831714) (← links)
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Incremental convex hull algorithms are not output sensitive (Q1283741) (← links)
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel (Q1367171) (← links)
- Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams (Q1380808) (← links)
- An output sensitive algorithm for discrete convex hulls (Q1388138) (← links)
- Combinatorial redundancy detection (Q1657399) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
- Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing (Q1940703) (← links)
- Convex hulls of spheres and convex hulls of disjoint convex polytopes (Q1947973) (← links)
- A characterization theorem and an algorithm for a convex hull problem (Q2341220) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- Approximating points by a piecewise linear function (Q2375945) (← links)
- Enumerating extreme points in higher dimensions (Q2748152) (← links)
- On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm (Q4366880) (← links)
- Approximate Polytope Membership Queries (Q4600697) (← links)
- ON ENUMERATING AND SELECTING DISTANCES (Q4682169) (← links)
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS (Q4818546) (← links)
- Economical Delone Sets for Approximating Convex Bodies (Q5116467) (← links)
- FINDING SIMPLICES CONTAINING THE ORIGIN IN TWO AND THREE DIMENSIONS (Q5388706) (← links)
- On approximate range counting and depth (Q5902137) (← links)
- Incremental convex hull algorithms are not output sensitive (Q6487422) (← links)
