Pages that link to "Item:Q1312190"
From MaRDI portal
The following pages link to An optimal convex hull algorithm in any fixed dimension (Q1312190):
Displaying 49 items.
- 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)
- (Q3138743) (← links)
- Skew Jensen-Bregman Voronoi Diagrams (Q3223927) (← links)
- COMPUTING CONVEX HULLS BY AUTOMATA ITERATION (Q3395136) (← links)
- Optimal Algorithm for Solution of Discrete Convex Combinations Problem (Q3439530) (← links)
- Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems (Q3452793) (← links)
- OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS (Q3503107) (← links)
- (Q3814809) (← links)
- On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm (Q4366880) (← links)
- Voronoi Diagrams of Moving Points (Q4513216) (← links)
- Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling (Q4629598) (← links)
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS (Q4682170) (← links)
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS (Q4818546) (← links)
- CONFORMAL GEOMETRY OF ESCORT PROBABILITY AND ITS APPLICATIONS (Q4918262) (← links)
- A complete description of cones and polytopes including hypervolumes of all facets of a polytope (Q4928893) (← links)
- (Q4952599) (← links)
- Conformal Flattening on the Probability Simplex and Its Applications to Voronoi Partitions and Centroids (Q4967755) (← links)
- (Q4998935) (← links)
- Efficient algorithm for simulating particles in true quasiperiodic environments (Q5048892) (← links)
- Fast and efficient computation of additively weighted Voronoi cells for applications in molecular biology (Q5054867) (← links)
- Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates (Q5054978) (← links)
- (Q5089169) (← links)
- Efficient Algorithms to Test Digital Convexity (Q5237086) (← links)
- Valuations in Image Analysis (Q5275825) (← links)
- Polar degrees and closest points in codimension two (Q5383874) (← links)
- SUPERIMPOSING VORONOI COMPLEXES FOR SHAPE DEFORMATION (Q5470169) (← links)
- Monotone and consistent discretization of the Monge-Ampère operator (Q5741491) (← links)
- On the Computational Complexity of Linear Discrepancy (Q5874541) (← links)
- An alternative definition for digital convexity (Q5918416) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)
- An alternative definition for digital convexity (Q5925581) (← links)
- Bregman Voronoi diagrams (Q5962350) (← links)
- Holistic fleet optimization incorporating system design considerations (Q6057031) (← links)
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q6126717) (← links)
- How to build high quality L2R training data: unsupervised compression-based selective sampling for learning to rank (Q6150450) (← links)
- Sufficient condition for injectivity of NURBS volumes by tangent cones (Q6175196) (← links)
- Incremental convex hull algorithms are not output sensitive (Q6487422) (← links)
- The rectilinear convex hull of line segments (Q6546584) (← links)
- Minimum-width double-slabs and widest empty slabs in high dimensions (Q6547941) (← links)
- Skeleton Clustering: Dimension-Free Density-Aided Clustering (Q6567907) (← links)
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems (Q6616278) (← links)
- Computational polyconvexification of isotropic functions (Q6644356) (← links)
- Witnessing subsystems for probabilistic systems with low tree width (Q6649513) (← links)