An Algorithm for Convex Polytopes
Journal of the ACM (JACM)
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
Determining the minimum-area encasing rectangle for an arbitrary closed curve
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Triangulating simplicial point sets in space
SCG '86 Proceedings of the second annual symposium on Computational geometry
Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Parallel processing for efficient subdivision search
SCG '87 Proceedings of the third annual symposium on Computational geometry
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
SCG '87 Proceedings of the third annual symposium on Computational geometry
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Parallel Convex Hull Algorithms
IEEE Transactions on Computers
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Representing geometric structures in d dimensions: topology and order
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
The implementation of an algorithm to find the convex hull of a set of three-dimensional points
ACM Transactions on Graphics (TOG)
Linear programming and convex hulls made easy
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Tetrahedrizing point sets in three dimensions
Journal of Symbolic Computation
On the two-dimensional davenport-schinzel problem
Journal of Symbolic Computation
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Visibility-ordering meshed polyhedra
ACM Transactions on Graphics (TOG)
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An NC parallel 3D convex hull algorithm
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Time-space optimal convex Hull algorithms
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Robust gift wrapping for the three-dimensional convex hull
Journal of Computer and System Sciences
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the shortest paths between two convex polyhedra
Journal of the ACM (JACM)
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
New lower bounds for convex hull problems in odd dimensions
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
A Simple Voronoi Diagram Algorithm for a Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
An efficient algorithm for the three-dimensional diameter problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A practical algorithm for computing the Delaunay triangulation for convex distance functions
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Fast linear expected-time alogorithms for computing maxima and convex hulls
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Computating the width of a set
SCG '85 Proceedings of the first annual symposium on Computational geometry
Computing separating planes for pairs of disjoint polytopes
SCG '85 Proceedings of the first annual symposium on Computational geometry
Extended Gaussian images, mixed volumes, shape reconstruction
SCG '85 Proceedings of the first annual symposium on Computational geometry
SCG '85 Proceedings of the first annual symposium on Computational geometry
SCG '85 Proceedings of the first annual symposium on Computational geometry
New techniques for computing order statistics in Euclidean space (extended abstract)
SCG '85 Proceedings of the first annual symposium on Computational geometry
Voronoi diagrams and arrangements
SCG '85 Proceedings of the first annual symposium on Computational geometry
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software (TOMS)
Representation of Three-Dimensional Digital Images
ACM Computing Surveys (CSUR)
Convex Decomposition of Simple Polygons
ACM Transactions on Graphics (TOG)
Geometric structures for three-dimensional shape representation
ACM Transactions on Graphics (TOG)
Approximation algorithms for convex hulls
Communications of the ACM
An optimal real-time algorithm for planar convex hulls
Communications of the ACM
In-Place Planar Convex Hull Algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Distribution-sensitive algorithms
Nordic Journal of Computing
Linear time approximation of 3D convex polytopes
Computational Geometry: Theory and Applications
Digital straightness and convexity (Extended Abstract)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Dynamically maintaining configurations in the plane (Detailed Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A family of new algorithms for soft filling
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima
Journal of Parallel and Distributed Computing
Towards in-place geometric algorithms and data structures
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
Modeling and Computing Ternary Projective Relations between Regions
IEEE Transactions on Knowledge and Data Engineering
Spatial Planning: A Configuration Space Approach
IEEE Transactions on Computers
An Optimal Illumination Region Algorithm for Convex Polygons
IEEE Transactions on Computers
A 3D Convex Hull algorithm for modelling medical data in a virtual environment
International Journal of Intelligent Systems Technologies and Applications
Hausdorff approximation of 3D convex polytopes
Information Processing Letters
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection
Proceedings of the twenty-fifth annual symposium on Computational geometry
Contributing vertices-based Minkowski sum computation of convex polyhedra
Computer-Aided Design
Computing minimum-area rectilinear convex hull and L-shape
Computational Geometry: Theory and Applications
Polyhedra of minimal area as 3D object models
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Characterization of polyhedron monotonicity
Computer-Aided Design
Navel Orange Blemish Identification for Quality Grading System
ICONIP '09 Proceedings of the 16th International Conference on Neural Information Processing: Part II
Loss-aware geographic routing for unreliable wireless sensor networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Pervasive and Mobile Computing
Hierarchical convex approximation of 3D shapes for fast region selection
SGP '08 Proceedings of the Symposium on Geometry Processing
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
Red-blue separability problems in 3D
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Maintaining extremal points and its applications to deciding optimal orientations
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection
Computational Geometry: Theory and Applications
A simple and efficient approach for 3D mesh approximate convex decomposition
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
A simplex-based approach to implement dimension independent spatial analyses
Computers & Geosciences
The system of common algorithmic space to create visual models of phenomena and processes
Proceedings of the International Conference on Applications of Computer and Information Sciences to Nature Research
An improved construction of progression-free sets
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
SubsetTrio: An evolutionary, geometric, and statistical benchmark subsetting framework
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Inconstancy of finite and infinite sequences
Theoretical Computer Science
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
Proceedings of the twenty-seventh annual symposium on Computational geometry
The two variable per inequality abstract domain
Higher-Order and Symbolic Computation
Multi-DaC programming model: a variant of multi-BSP model for divide-and-conquer algorithms
DAMP '12 Proceedings of the 7th workshop on Declarative aspects and applications of multicore programming
Self-stabilizing gathering with strong multiplicity detection
Theoretical Computer Science
Fast edge-routing for large graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Outlier respecting points approximation
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Applications of Geometry Processing: CudaHull: Fast parallel 3D convex hull on the GPU
Computers and Graphics
SMI 2012: Full GPU accelerated convex hull computation
Computers and Graphics
List processing primitives for parallel computation
Computer Languages
On the ultimate convex hull algorithm in practice
Pattern Recognition Letters
Computing Voronoi Treemaps: Faster, Simpler, and Resolution-independent
Computer Graphics Forum
Slime mould computes planar shapes
International Journal of Bio-Inspired Computation
Hybrid machine learning approach for object recognition: fusion of features and decisions
Machine Graphics & Vision International Journal
Convex hull game: a tangible context for algorithms and computer graphics concepts
Journal of Computing Sciences in Colleges
New algorithms for computer graphics
EGGH'87 Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware
Convex hulls of spheres and convex hulls of disjoint convex polytopes
Computational Geometry: Theory and Applications
Detection of trojans using a combined ring oscillator network and off-chip transient power analysis
ACM Journal on Emerging Technologies in Computing Systems (JETC)
gHull: A GPU algorithm for 3D convex hull
ACM Transactions on Mathematical Software (TOMS)
M-cluster and X-ray: Two methods for multi-jammer localization in wireless sensor networks
Integrated Computer-Aided Engineering
| Hi-index | 48.26 |
The convex hulls of sets of n points in two and three dimensions can be determined with O(n log n) operations. The presented algorithms use the “divide and conquer” technique and recursively apply a merge procedure for two nonintersecting convex hulls. Since any convex hull algorithm requires at least O(n log n) operations, the time complexity of the proposed algorithms is optimal within a multiplicative constant.