The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
An efficient output-sensitive hidden surface removal algorithm and its parallelization
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Offline maintenance of planar configurations
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Computing the rectangle discrepancy
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Approximate data structures with applications
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Convex Decomposition of Simple Polygons
ACM Transactions on Graphics (TOG)
Approximation algorithms for convex hulls
Communications of the ACM
An on-line algorithm for fitting straight lines between data ranges
Communications of the ACM
Determining the Convex Hull in Large Multidimensional Databases
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
In-Place Planar Convex Hull Algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Dynamically maintaining configurations in the plane (Detailed Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
Computational Geometry on a Systolic Chip
IEEE Transactions on Computers
Relative Convex Hulls in Semi-dynamic Subdivisions
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Topological sweep of the complete graph
Discrete Applied Mathematics
Packet pacing in small buffer optical packet switched networks
IEEE/ACM Transactions on Networking (TON)
Journal of Computer and System Sciences
An algorithm for discrete approximation by quasi-convex functions on Rm
Computers & Mathematics with Applications
Self-adjusting computation with Delta ML
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
A practical on-line pacing scheme at edges of small buffer networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Fitting a two-joint orthogonal chain to a point set
Computational Geometry: Theory and Applications
Inconstancy of finite and infinite sequences
Theoretical Computer Science
Interval scheduling on related machines
Computers and Operations Research
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
Proceedings of the twenty-seventh annual symposium on Computational geometry
How to cover a point set with a V-shape of minimum width
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On the ultimate convex hull algorithm in practice
Pattern Recognition Letters
How to cover a point set with a V-shape of minimum width
Computational Geometry: Theory and Applications
Convex hulls of spheres and convex hulls of disjoint convex polytopes
Computational Geometry: Theory and Applications
| Hi-index | 48.28 |
An algorithm is described for the construction in real-time of the convex hull of a set of n points in the plane. Using an appropriate data structure, the algorithm constructs the convex hull by successive updates, each taking time O(log n), thereby achieving a total processing time O(n log n).