On the identification of the convex hull of a finite set of points in the plane
From MaRDI portal
Publication:2559148
DOI10.1016/0020-0190(73)90020-3zbMath0256.68041OpenAlexW2000358470WikidataQ56017898 ScholiaQ56017898MaRDI QIDQ2559148
Publication date: 1973
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(73)90020-3
Related Items
Time-space trade-offs for triangulations and Voronoi diagrams, Robust gift wrapping for the three-dimensional convex hull, Time-Space Trade-offs for Triangulations and Voronoi Diagrams, On determining the on-line minimax linear fit to a discrete point set in the plane, Divide and Conquer Method for k-Set Polygons, Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments, The convex hull of a set of convex polygons, Scanline algorithms on a grid, Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization, Piece wise linear least–squares approximation of planar curves, ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE, Space-efficient planar convex hull algorithms, \(\alpha\)-concave hull, a generalization of convex hull, An O(n) algorithm for discrete n-point convex approximation with applications to continuous case, Another efficient algorithm for convex hulls in two dimensions, Computing a visibility polygon using few variables, Fast and accurate SPH modelling of 3D complex wall boundaries in viscous and non viscous flows, On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination, Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms, A note on linear expected time algorithms for finding convex hulls, A note on finding convex hulls via maximal vectors, Recursive voids for identifying a nonconvex boundary of a set of points in the plane, An efficient convex hull algorithm using affine transformation in planar point set, Cargo transport properties are enhanced by cylindrical microtubule geometry and elliptical contact zone on cargo surface, How to reduce the average complexity of convex hull finding algorithms, Convex hulls of spheres and convex hulls of disjoint convex polytopes, On computing the convex hull of (piecewise) curved objects, Maintenance of configurations in the plane, Structural health monitoring of tall buildings with numerical integrator and convex-concave hull classification, A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects, On the complexity of convex hull algorithms if rotational minima can be found very fast, Convex-hull algorithms: implementation, testing, and experimentation, An efficient and numerically correct algorithm for the 2D convex hull problem, Moment inequalities for random variables in computational geometry, An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier, Generalizing the Template Polyhedral Domain, Method of orienting curves for determining the convex hull of a finite set of points in the plane, Space-time trade-offs for stack-based algorithms, Output-sensitive peeling of convex and maximal layers, Randomized quickhull, Direct sizing and characterization of energy storage systems in the energy-power plane, A linear-time algorithm to compute the triangular hull of a digital object, Inconstancy of finite and infinite sequences, The complexity of linear programming, Fast greedy triangulation algorithms., Approximating a real number by a rational number with a limited denominator: a geometric approach, Random convex hulls and extreme value statistics, A new 2D tessellation for angle problems: the polar diagram, Dynamic polar diagram, Convex Hulls on Cellular Automata, A simple algorithm for building the 3-D convex hull, Convex hull properties and algorithms, A rule-based approach for robust clump splitting, The DIRECT algorithm: 25 years later, Unnamed Item, A filtering technique for fast convex hull construction in \(\mathbb{R}^2\), A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set, A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation, QuickhullDisk: a faster convex hull algorithm for disks, A new variational approach based on level-set function for convex hull problem with outliers, Convex hull of a finite set of points in two dimensions, A fast convex hull algorithm, A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions, Two remarks on a convex hull algorithm, Divide and conquer for linear expected time, Optimal output-sensitive convex hull algorithms in two and three dimensions, Optimal computation of finitely oriented convex hulls, Dimer models and Calabi-Yau algebras, Convex hull of a planar set of straight and circular line segments, An approximate algorithm for computing multidimensional convex hulls, VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME, An Exact Algorithm for Minimizing a Sum of Euclidean Norms on Rays in 2D and 3D, Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae, On constant factors in comparison-based geometric algorithms and data structures, Parallel solutions to geometric problems in the scan model of computation, Some performance tests of convex hull algorithms, An Output-Sensitive Convex Hull Algorithm for Planar Objects, Quicker than Quickhull, A workbench for computational geometry
Cites Work
