The following pages link to An Algorithm for Convex Polytopes (Q5597968):
Displaying 50 items.
- Faster geometric algorithms via dynamic determinant computation (Q283878) (← links)
- Certifying algorithms (Q465678) (← links)
- A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations (Q471140) (← links)
- Newton polytopes and witness sets (Q475408) (← links)
- Higher-dimensional Voronoi diagrams in linear expected time (Q804320) (← links)
- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) (Q827092) (← links)
- Medial axis lookup table and test neighborhood computation for 3D chamfer norms (Q834268) (← links)
- Clustering reduced interval data using Hausdorff distance (Q880910) (← links)
- A new clustering algorithm for coordinate-free data (Q962672) (← links)
- Convex hull properties and algorithms (Q984371) (← links)
- Geometric containment and vector dominance (Q1093914) (← links)
- Primitives for the manipulation of three-dimensional subdivisions (Q1115576) (← links)
- Voronoi diagrams from convex hulls (Q1135110) (← links)
- Convex hulls of samples from spherically symmetric distributions (Q1175782) (← links)
- Small-dimensional linear programming and convex hulls made easy (Q1176319) (← links)
- A new representation and algorithm for constructing convex hulls in higher dimensional spaces (Q1192490) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- Algorithm for determining the reachability set of a linear control system (Q1321153) (← links)
- Robust gift wrapping for the three-dimensional convex hull (Q1337472) (← links)
- How good are convex hull algorithms? (Q1356937) (← links)
- Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation (Q1371879) (← links)
- Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
- \(\alpha\)-concave hull, a generalization of convex hull (Q1676320) (← links)
- Fuzzy clustering using the convex hull as geometrical model (Q1750199) (← links)
- Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
- Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
- An algorithm for determining redundant inequalities and all solutions to convex polyhedra (Q1846732) (← links)
- Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\) (Q1894936) (← 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)
- A simple algorithm for building the 3-D convex hull (Q2266570) (← links)
- Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball (Q2278205) (← links)
- A filtering technique for fast convex hull construction in \(\mathbb{R}^2\) (Q2279854) (← links)
- QuickhullDisk: a faster convex hull algorithm for disks (Q2286150) (← links)
- Quicker than Quickhull (Q2354631) (← links)
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points (Q2365326) (← links)
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q2391831) (← links)
- A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions (Q2803265) (← links)
- Least distance methods for the scheme of polytopes (Q4192906) (← links)
- Computing the vector in the convex hull of a finite set of points having minimal length (Q4327958) (← links)
- Convex hull of a planar set of straight and circular line segments (Q4484714) (← links)
- An Output-Sensitive Convex Hull Algorithm for Planar Objects (Q4513200) (← links)
- Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling (Q4629598) (← links)
- Modélisation et optimisation numérique pour la reconstruction d'un polyèdre à partir de son image gaussienne généralisée (Q4694995) (← links)
- (Q4909818) (← links)
- The complexity of linear programming (Q5904560) (← links)
- Identifying genuine clusters in a classification (Q5917672) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)
- Extended convex hull (Q5952968) (← links)
