Pages that link to "Item:Q2559148"
From MaRDI portal
The following pages link to On the identification of the convex hull of a finite set of points in the plane (Q2559148):
Displaying 50 items.
- Computing a visibility polygon using few variables (Q396475) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- A linear-time algorithm to compute the triangular hull of a digital object (Q528337) (← links)
- Inconstancy of finite and infinite sequences (Q533867) (← links)
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- Output-sensitive peeling of convex and maximal layers (Q671619) (← links)
- Randomized quickhull (Q675302) (← links)
- Recursive voids for identifying a nonconvex boundary of a set of points in the plane (Q898221) (← links)
- An efficient convex hull algorithm using affine transformation in planar point set (Q900582) (← links)
- An efficient and numerically correct algorithm for the 2D convex hull problem (Q919797) (← links)
- Approximating a real number by a rational number with a limited denominator: a geometric approach (Q967407) (← links)
- Random convex hulls and extreme value statistics (Q967627) (← links)
- Dynamic polar diagram (Q975551) (← links)
- Convex hull properties and algorithms (Q984371) (← links)
- Some performance tests of convex hull algorithms (Q1070524) (← links)
- On determining the on-line minimax linear fit to a discrete point set in the plane (Q1098638) (← links)
- Scanline algorithms on a grid (Q1111020) (← links)
- An O(n) algorithm for discrete n-point convex approximation with applications to continuous case (Q1132491) (← links)
- Another efficient algorithm for convex hulls in two dimensions (Q1134526) (← links)
- On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination (Q1140425) (← links)
- A note on linear expected time algorithms for finding convex hulls (Q1142045) (← links)
- A note on finding convex hulls via maximal vectors (Q1144946) (← links)
- How to reduce the average complexity of convex hull finding algorithms (Q1151049) (← links)
- Maintenance of configurations in the plane (Q1158972) (← links)
- Moment inequalities for random variables in computational geometry (Q1172863) (← links)
- A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set (Q1241280) (← links)
- Convex hull of a finite set of points in two dimensions (Q1251803) (← links)
- A fast convex hull algorithm (Q1251805) (← links)
- Two remarks on a convex hull algorithm (Q1252725) (← links)
- Divide and conquer for linear expected time (Q1256853) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- Parallel solutions to geometric problems in the scan model of computation (Q1318471) (← links)
- A workbench for computational geometry (Q1322571) (← links)
- Robust gift wrapping for the three-dimensional convex hull (Q1337472) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- \(\alpha\)-concave hull, a generalization of convex hull (Q1676320) (← links)
- Convex-hull algorithms: implementation, testing, and experimentation (Q1712057) (← links)
- Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
- Optimal computation of finitely oriented convex hulls (Q1820432) (← 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)
- Structural health monitoring of tall buildings with numerical integrator and convex-concave hull classification (Q1954536) (← links)
- Direct sizing and characterization of energy storage systems in the energy-power plane (Q1997376) (← links)
- The DIRECT algorithm: 25 years later (Q2022319) (← links)
- A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation (Q2034245) (← links)
- A new variational approach based on level-set function for convex hull problem with outliers (Q2037215) (← links)
- A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects (Q2210520) (← links)
- An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier (Q2225169) (← links)
- A simple algorithm for building the 3-D convex hull (Q2266570) (← links)
- A filtering technique for fast convex hull construction in \(\mathbb{R}^2\) (Q2279854) (← links)
