In-Place Planar Convex Hull Algorithms

Authors:
Hervé Brönnimann;John Iacono;Jyrki Katajainen;Pat Morin;Jason Morrison;Godfried T. Toussaint
Affiliations:
-;-;-;-;-;-
Venue:
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Year:
2002

Citing 23
Cited 6

A simple linear-time algorithm for in situ merging

Information Processing Letters
Sorting a random access file in situ

The Computer Journal
Computational geometry: an introduction

Computational geometry: an introduction
The ultimate planar convex hull algorithm

SIAM Journal on Computing
Intersection of convex objects in two and three dimensions

Journal of the ACM (JACM)
Stable linear time sublinear space merging

The Computer Journal
Simplified stable merging tasks

Journal of Algorithms
Practical in-place merging

Communications of the ACM
Unstable linear time (1) space merging

The Computer Journal
Implicit selection

No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Applications of random sampling in computational geometry, II

Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Stable in situ sorting and minimum data movement

BIT
Small-dimensional linear programming and convex hulls made easy

Discrete & Computational Geometry
Stable minimum space partitioning in linear time

BIT
On a simple, practical, optimal, output-sensitive randomized planar convex hull algorithm

Journal of Algorithms
Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)
In-place sorting with fewer moves

Information Processing Letters
A New Convex Hull Algorithm for Planar Sets

ACM Transactions on Mathematical Software (TOMS)
An optimal real-time algorithm for planar convex hulls

Communications of the ACM
Convex hulls of finite sets of points in two and three dimensions

Communications of the ACM
Algorithm 245: Treesort

Communications of the ACM
Practical in-place mergesort

Nordic Journal of Computing
Computational geometry.

Computational geometry.

Towards in-place geometric algorithms and data structures

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Space-efficient geometric divide-and-conquer algorithms

Computational Geometry: Theory and Applications
Linear Time Constant-Working Space Algorithm for Computing the Genus of a Digital Object

ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
An efficient algorithm for RFID reader positioning forcoverage of irregularly-shaped areas

CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
The two variable per inequality abstract domain

Higher-Order and Symbolic Computation
Line-segment intersection made in-place

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

An in-place algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. In this paper we describe three in-place algorithms for computing the convex hull of a planar point set. All three algorithms are optimal, some more so than others.