Space-efficient planar convex hull algorithms

Authors:
Hervé Brönnimann;John Iacono;Jyrki Katajainen;Pat Morin;Jason Morrison;Godfried Toussaint
Affiliations:
CIS, Polytechnic University;CIS, Polytechnic University;Department of Computing, University of Copenhagen, Denmark;School of Computer Science, Carleton University, Canada;School of Computer Science, Carleton University, Canada;School of Computer Science, McGill University, Canada
Venue:
Theoretical Computer Science - Latin American theorotical informatics
Year:
2004

Citing 25
Cited 14

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
Computer Algorithms: C++

Computer Algorithms: C++
A Discipline of Programming

A Discipline of Programming
Practical in-place mergesort

Nordic Journal of Computing
Computational geometry.

Computational geometry.

Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time

Computational Geometry: Theory and Applications
A New Active Convex Hull Model for Image Regions

Journal of Mathematical Imaging and Vision
An in-place algorithm for Klee's measure problem in two dimensions

Information Processing Letters
Line-segment intersection made in-place

Computational Geometry: Theory and Applications
In-place 2-d nearest neighbor search

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Constant-Working-Space Algorithms for Image Processing

Emerging Trends in Visual Computing
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection

Proceedings of the twenty-fifth annual symposium on Computational geometry
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time

Computational Geometry: Theory and Applications
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection

Computational Geometry: Theory and Applications
Adaptive algorithms for planar convex hull problems

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
In-Place algorithms for computing (layers of) maxima

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
In-place randomized slope selection

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
An in-place min-max priority search tree

Computational Geometry: Theory and Applications
Reprint of: Memory-constrained algorithms for simple polygons

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A space-efficient 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. We describe four space-efficient algorithms for computing the convex hull of a planar point set.