Pages that link to "Item:Q1312190"

The following pages link to An optimal convex hull algorithm in any fixed dimension (Q1312190):

Displaying 50 items.

• The symplectic geometry of closed equilateral random walks in 3-space (Q259598) (← links)
• Efficient operations on discrete paths (Q265059) (← links)
• Topological relations between separating circles (Q387873) (← links)
• Automorphism groups of hyperbolic lattices (Q402703) (← links)
• Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
• A general solution for robust linear programs with distortion risk constraints (Q492796) (← links)
• Voronoi-based estimation of Minkowski tensors from finite point samples (Q527434) (← links)
• A linear-time algorithm to compute the triangular hull of a digital object (Q528337) (← links)
• Graph problems arising from parameter identification of discrete dynamical systems (Q634788) (← links)
• Nonlocality in many-body quantum systems detected with two-body correlators (Q738220) (← links)
• On statistical learning of simplices: unmixing problem revisited (Q820821) (← 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)
• Finding largest rectangles in convex polygons (Q902427) (← links)
• On overlays and minimization diagrams (Q1014331) (← links)
• Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
• An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
• Derandomizing an output-sensitive convex hull algorithm in three dimensions (Q1346251) (← links)
• An introduction to randomization in computational geometry (Q1351693) (← links)
• How good are convex hull algorithms? (Q1356937) (← links)
• The number of cylindrical shells (Q1434253) (← links)
• Estimating the number of vertices of a polyhedron (Q1607035) (← links)
• The minimum convex container of two convex polytopes under translations (Q1622345) (← links)
• A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty (Q1634054) (← links)
• Methods for estimation of convex sets (Q1730906) (← links)
• Rigorous cubical approximation and persistent homology of continuous functions (Q1732427) (← links)
• Concentration of the empirical level sets of Tukey's halfspace depth (Q1740596) (← links)
• Constructing the convex hull of a partially sorted set of points (Q1803271) (← links)
• Applications of random sampling in computational geometry. II (Q1823685) (← links)
• Dynamic maintenance and visualization of molecular surfaces. (Q1868710) (← links)
• Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
• An algorithm for constructing the convex hull of a set of spheres in dimension \(d\) (Q1917048) (← links)
• Convex hulls of spheres and convex hulls of disjoint convex polytopes (Q1947973) (← links)
• Ellipsoidal one-class constraint acquisition for quadratically constrained programming (Q2030498) (← links)
• Estimation of convex supports from noisy measurements (Q2040036) (← links)
• On physics-informed data-driven isotropic and anisotropic constitutive models through probabilistic machine learning and space-filling sampling (Q2136745) (← links)
• Shortest paths and convex hulls in 2D complexes with non-positive curvature (Q2206723) (← links)
• \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data (Q2207493) (← links)
• An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier (Q2225169) (← links)
• Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball (Q2278205) (← links)
• A characterization theorem and an algorithm for a convex hull problem (Q2341220) (← links)
• Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q2391831) (← links)
• Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105) (← links)
• Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
• An algorithm for canonical forms of finite subsets of \(\mathbb {Z}^d\) up to affinities (Q2408208) (← links)
• Uniform behaviors of random polytopes under the Hausdorff metric (Q2419657) (← links)
• Manifold reconstruction using tangential Delaunay complexes (Q2441577) (← links)
• Equilibrium computation of the Hart and Mas-Colell bargaining model (Q2637848) (← links)
• Convex hulls, oracles, and homology (Q2643561) (← links)
• Polynomial Bell Inequalities (Q2960675) (← links)