Computational Geometry through the Information Lens

Computational Geometry through the Information Lens (2007)

Cached

Download Links

[people.csail.mit.edu]

by Erik D. Demaine

BibTeX

@MISC{Demaine07computationalgeometry,
    author = {Erik D. Demaine},
    title = {Computational Geometry through the Information Lens},
    year = {2007}
}

Bookmark

OpenURL

Abstract

revisits classic problems in computational geometry from the modern algorithmic

Citations

643	Algorithms in combinatorial geometry - Edelsbrunner - 1987
494	The input/output complexity of sorting and related problems. Commun - AGGARWAL, VITTER - 1988
275	Computational Geometry: An Introduction Through Randomized Algorithms - Mulmuley - 1993
268	Triangulating a simple polygon in linear time - Chazelle - 1991
182	Design and implementation of an efficient priority queue - Boas, Kaas, et al. - 1977
160	Planar point location using persistent search trees - Sarnak, Tarjan - 1986
143	Two algorithms for maintaining order in a list - Dietz, Sleator - 1987
141	Trans-dichotomous algorithms for minimum spanning trees and shortest paths - Fredman, Willard - 1990
135	Surpassing the information theoretic bound with fusion trees - Fredman, Willard - 1993
134	Applications of random sampling - Clarkson, Shor - 1989
104	A randomized algorithm for closest-point queries - Clarkson - 1988
104	Preparata and Michael Ian Shamos. Computational Geometry: An Introduction - Franco - 1985
79	A fast planar partition algorithm - Mulmuley - 1990
79	Probabilistic algorithms - Rabin - 1976
70	Binary Search Trees of Bounded Balance - Nievergelt, Reingold - 1972
58	Faster core-set constructions and data-stream algorithms in fixed dimensions. Computational Geometry: Theory and Applications - Chan - 2006
52	Two simplified algorithms for maintaining order in a list - Bender, Cole, et al. - 2005
50	Triangulating simple polygons and equivalent problems - Fournier, Montuno - 1984
48	Searching and storing similar lists - Cole - 1986
44	Optimal bounds for the predecessor problem and related problems - Beame, Fich
42	Dynamic planar convex hull - Brodal, Jacob - 2002
35	Optimal output-sensitive convex hull algorithms in two and three dimensions - Chan - 1996
35	auf der Heide. A New Universal Class of Hash Functions and Dynamic Hashing in Real Time - Dietzfelbinger, Meyer - 1990
31	János Komlós, and Endre Szemerédi. Storing a sparse table with 0(1) worst case access time - Fredman - 1984
29	Random sampling, halfspace range reporting, and construction of (≤ k)-levels in three dimensions - Chan
27	Time-space trade-offs for predecessor search - Pătra¸scu, Thorup - 2006
23	Logarithmic lower bounds in the cell-probe model - Pǎtras¸cu, Demaine - 2006
20	Two- and Three-Dimensional Point Location in Rectangular Subdivisions - Berg, Kreveld, et al. - 1995
20	and Robert Endre Tarjan. Applications of a planar separator theorem - Lipton - 1980
20	Point location - Snoeyink - 2004
15	Optimal static range reporting in one dimension - Alstrup, Brodal, et al. - 2001
15	Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations - Thorup - 1997
14	A simple entropy-based algorithm for planar point location - Arya, Malamatos, et al. - 2001
14	Fast algorithms for computing the smallest k-enclosing disc - Har-Peled, Mazumdar
14	On dynamic range reporting in one dimension - Mortensen, Pagh, et al. - 2005
13	Entropy-preserving cuttings and space-efficient planar point location - Arya, Malamatos, et al. - 2001
13	Fast geometric approximation techniques and geometric embedding problems - Bern, Karlo - 1992
12	Fusion trees can be implemented with AC 0 instructions only - Andersson, Miltersen, et al.
12	Trans-dichotomous algorithms without multiplication— some upper and lower bounds - Brodnik, Miltersen, et al. - 1997
11	Dynamic planar convex hull with optimal query time and O(log n · log log n) update time - Brodal, Jacob - 2000
11	Sorting helps for Voronoi diagrams - Chew, Fortune - 1988
9	On enumerating and selecting distances - Chan
8	Improved fast integer sorting in linear space - Han - 2001
7	Expected asymptotically optimal planar point location - Iacono
5	Dynamic point location in fat hyperrectangles with integer coordinates - Iacono, Langerman - 2000
5	Planar point location in sublogarithmic time - Pǎtra¸scu - 2006
4	Dominic Sleator, and Robert Endre Tarjan. Making data structures persistent - Driscoll, Sarnak, et al. - 1986
3	Mihai Pǎtra¸scu. Subquadratic algorithms for 3sum - Baran, Demaine
3	Integer sorting in 0(n √ log log n) expected time and linear space - Han, Thorup - 2002
2	Making deterministic signatures quickly - Ruˇzić - 2007