Pages that link to "Item:Q1134526"

The following pages link to Another efficient algorithm for convex hulls in two dimensions (Q1134526):

Displaying 38 items.

• Continuous Markov equilibria with quasi-geometric discounting (Q281372) (← links)
• Optimal convergence rate of the multitype sticky particle approximation of one-dimensional diagonal hyperbolic systems with monotonic initial data (Q321609) (← links)
• Linear time algorithm for optimal feed-link placement (Q482338) (← links)
• An algorithm for continuous piecewise linear bounding of discrete time series data (Q486719) (← links)
• Space-efficient planar convex hull algorithms (Q596137) (← links)
• The two variable per inequality abstract domain (Q656848) (← links)
• The power and limitations of uniform samples in testing properties of figures (Q666678) (← links)
• Compressing spatio-temporal trajectories (Q833705) (← links)
• An efficient convex hull algorithm using affine transformation in planar point set (Q900582) (← links)
• Parameter identification of 1D fractal interpolation functions using bounding volumes (Q1034661) (← links)
• On determining the on-line minimax linear fit to a discrete point set in the plane (Q1098638) (← links)
• Further comments on Bykat's convex hull algorithm (Q1147518) (← links)
• Convex-hull algorithms: implementation, testing, and experimentation (Q1712057) (← links)
• A time-optimal parallel algorithm for three-dimensional convex hulls (Q1899449) (← links)
• Deconstructing approximate offsets (Q1930550) (← links)
• Convex hulls of spheres and convex hulls of disjoint convex polytopes (Q1947973) (← links)
• A new variational approach based on level-set function for convex hull problem with outliers (Q2037215) (← links)
• Silhouette vectorization by affine scale-space (Q2127270) (← links)
• Existence and hardness of conveyor belts (Q2209897) (← links)
• An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier (Q2225169) (← links)
• A filtering technique for fast convex hull construction in \(\mathbb{R}^2\) (Q2279854) (← links)
• An effective implementation of a modified Laguerre method for the roots of a polynomial (Q2334816) (← links)
• Quicker than Quickhull (Q2354631) (← links)
• An adaptable and extensible geometry kernel (Q2371334) (← links)
• Geometry and algorithms for upper triangular tropical matrix identities (Q2417805) (← links)
• On polyhedra induced by point sets in space (Q2462350) (← links)
• Classroom examples of robustness problems in geometric computations (Q2479475) (← links)
• Convergence of the embedded mean-variance optimal points with discrete sampling (Q2634609) (← links)
• Quasi-Monotonic Sequences: Theory, Algorithms and Applications (Q3033808) (← links)
• On finding the convex hull of a simple polygon (Q3331831) (← links)
• Hommel's procedure in linear time (Q4626708) (← links)
• Robust Adaptive Routing Under Uncertainty (Q4969320) (← links)
• Mean area of the convex hull of a run and tumble particle in two dimensions (Q5048546) (← links)
• (Q5088998) (← links)
• (Q5091039) (← links)
• The convex hull of the run-and-tumble particle in a plane (Q5135142) (← links)
• Testing convexity of figures under the uniform distribution (Q5381051) (← links)
• A fast algorithm to solve large-scale matrix games based on dimensionality reduction and its application in multiple unmanned combat air vehicles attack-defense decision-making (Q6118650) (← links)