Pages that link to "Item:Q1816462"

The following pages link to Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462):

Displaying 50 items.

• Efficient operations on discrete paths (Q265059) (← links)
• Reprint of: Extreme point and halving edge search in abstract order types (Q390177) (← links)
• Faster output-sensitive skyline computation algorithm (Q402378) (← links)
• Planar lower envelope of monotone polygonal chains (Q495682) (← links)
• Space-efficient planar convex hull algorithms (Q596137) (← links)
• Connectivity guarantees for wireless networks with directional antennas (Q654284) (← links)
• Computing pseudotriangulations via branched coverings (Q714984) (← links)
• An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem (Q785628) (← 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)
• Robust vertex enumeration for convex hulls in high dimensions (Q827269) (← links)
• New variants of perfect non-crossing matchings (Q831710) (← links)
• In-place algorithms for computing (Layers of) maxima (Q848632) (← 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)
• Hausdorff approximation of 3D convex polytopes (Q963404) (← links)
• Approximating a real number by a rational number with a limited denominator: a geometric approach (Q967407) (← links)
• Convex hull properties and algorithms (Q984371) (← links)
• Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
• Convex-hull algorithms: implementation, testing, and experimentation (Q1712057) (← links)
• Optimizing a constrained convex polygonal annulus (Q1775012) (← links)
• Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
• Linear time approximation of 3D convex polytopes (Q1862132) (← 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)
• Randomized approximation scheme for Steiner multi cycle in the Euclidean plane (Q2192387) (← links)
• Efficiently testing digital convexity and recognizing digital convex polygons (Q2203347) (← links)
• Shortest paths and convex hulls in 2D complexes with non-positive curvature (Q2206723) (← 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 new framework to relax composite functions in nonlinear programs (Q2235154) (← 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)
• On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
• Quicker than Quickhull (Q2354631) (← links)
• Extreme point and halving edge search in abstract order types (Q2391543) (← links)
• A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation (Q2515072) (← links)
• ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM (Q2932519) (← links)
• APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
• Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments (Q3183469) (← links)
• The Complex Version of the Minimum Support Criterion (Q3608517) (← links)
• Semidual Regularized Optimal Transport (Q4554909) (← links)
• Convex Hulls on Cellular Automata (Q4931189) (← links)
• Skyline Computation with Noisy Comparisons (Q5041199) (← links)
• Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
• (Q5091039) (← links)
• Efficient Algorithms to Test Digital Convexity (Q5237086) (← links)
• Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance (Q5458565) (← links)
• Techniques and Open Questions in Computational Convex Analysis (Q5746453) (← links)
• Linear-Time Convexity Test for Low-Order Piecewise Polynomials (Q5857296) (← links)
• An alternative definition for digital convexity (Q5918416) (← links)