Optimal in-place planar convex hull algorithms (2002)

by Hervé Brönnimann , John Iacono , Jyrki Katajainen , Pat Morin , Godfried Toussaint
Venue:Proceedings of Latin American Theoretical Informatics (LATIN 2002), volume 2286 of Lecture Notes in Computer Science
Citations:6 - 2 self

Active Bibliography

Space-Efficient Planar Convex Hull Algorithms – Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried Toussaint
20 Space-efficient planar convex hull algorithms – Herve Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried Toussaint - 2002
3 Output-Sensitive Construction Of Convex Hulls – Timothy Moon-yew Chan - 1995
501 The Quickhull algorithm for convex hulls – C. Bradford Barber, David P. Dobkin, Hannu Huhdanpaa - 1996
480 Problems in Computational Geometry – Michael Ian Shamos - 1974
605 A Transformation System for Developing Recursive Programs – R. M. Burstall, John Darlington - 1977
792 Introduction to Algorithms, Second Edition – T H Leiserson, C E Cormen, R L Rivest, C Stein - 2001
861 Applied Cryptography -- Protocols, Algorithms, and . . . – Bruce Schneier
520 Nearest Neighbor Queries – Nick Roussopoulos, Stephen Kelley, Frederic Vincent - 1995