Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried Toussaint  Home/Search
Context
Related
| cgm.cs.mcgill.ca/~godfri...insitu.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cgm.cs.mcgill.ca/~godfried/pub... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A space-ecient 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-ecient algorithms for computing the convex hull of a planar point set. (Update)
Active bibliography (related documents): More All
3.9: Space-Efficient Planar Convex Hull Algorithms - Brönnimann, Iacono.. (Correct)
3.5: In-Place Planar Convex Hull Algorithms - Brönnimann, Iacono, Katajainen.. (Correct)
0.5: Optimal Stable Merging - Symvonis (1994) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ nnimann-spaceefficient,
author = "Hervé Brönnimann and John Iacono and Jyrki Katajainen and Pat Morin
and Jason Morrison and Godfried Toussaint",
title = "Space-Efficient Planar Convex Hull Algorithms",
url = "citeseer.ist.psu.edu/762599.html" }
Citations (may not include all citations):508 Computational Geometry (context) - Preparata, Shamos - 1985
508 Computational Geometry (context) - Shamos - 1978
335 Applications of random sampling in computational geometry - Clarkson, Shor - 1988
122 Linear programming in linear time when the dimension is xed (context) - Megiddo - 1984
69 Small-dimensional linear programming and convex hulls made e.. (context) - Seidel - 1991
64 The ultimate planar convex hull algorithm (context) - Kirkpatrick, Seidel - 1986
59 Communications of the ACM (context) - Floyd, Treesort - 1964
25 Primal dividing and dual pruning: Output-sensitive construct.. - Chan, Snoeyink et al. - 1997
23 Communications of the ACM (context) - Williams, Heapsort - 1964
22 Optimal output-sensitive convex hull algorithms in two and t.. - Chan - 1996
21 An optimal real time algorithm for planar convex hulls (context) - Preparata - 1979
20 A new convex hull algorithm for planar sets (context) - Eddy - 1977
20 Maintenance of con gurations in the plane (context) - Overmars, van Leeuwen - 1981
16 Randomized quick hull - Wenger - 1997
15 Practical in-place merging (context) - Huang, Langston - 1988
14 output-sensitive randomized planar convex hull algorithm (context) - Bhattacharya, Sen et al. - 1997
11 Practical in-place mergesort - Katajainen, Pasanen et al. - 1996
11 Computer Science Press (context) - Horowitz, Sahni et al. - 1998
10 An ecient algorithm for determining the convex hull of a nit.. (context) - Graham - 1972
10 A simple linear-time algorithm for in situ merging (context) - Mannila, Ukkonen - 1984
9 the identi cation of the convex hull of a nite set of points.. (context) - Jarvis - 1973
9 Fast stable merging and sorting in constant extra space - Huang, Langston - 1992
8 Optimal stable merging - Symvonis - 1995
7 Stable minimum space partitioning in linear time - Katajainen, Pasanen - 1992
7 Stable in situ sorting and minimum data movement (context) - Munro, Raman et al. - 1990
7 Stable linear time sublinear space merging (context) - Dvo, Durian - 1987
6 Implicit selection (context) - Lai, Wood - 1988
6 Science of Computer Programming (context) - Dijkstra, an et al. - 1982
5 An introduction to three algorithms for sorting in situ (context) - Dijkstra, van Gasteren - 1982
5 Unstable linear time O (context) - Dvo, Durian - 1988
5 Intersection of convex objects in 2 and 3 dimensions (context) - Chazelle, Dobkin - 1987
5 Another ecient algorithm for convex hulls in two dimensions (context) - Andrew - 1979
4 Sorting a random access le in situ (context) - Six, Wegner - 1984
4 Simpli ed stable merging tasks (context) - Salowe, Steiger - 1987
4 Convex hulls of nite point sets in two and three dimensions (context) - Preparata, Hong - 1977
3 Available online httpwww (context) - tgz, at et al. - 2002
Documents on the same site (http://cgm.cs.mcgill.ca/~godfried/publications/): More
On the Sectional Area of Convex Polytopes - Avis, Bose, Shermer, Snoeyink.. (1996) (Correct)
Convexifying Polygons in 3D: a Survey - Soss, Toussaint (Correct)
A Faster Algorithm for Computing the Link Distance between .. - Colannino, Toussaint (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC