- Closest Pair and the Post Office Problem for Stochastic Points
- Curves of Width One and the River Shore Problem Timothy M. Chan Alexander Golynski
- Three Problems about Dynamic Convex Hulls Timothy M. Chan
- The Complexity of a Single Face of a Minkowski Sum Sariel HarPeled \Lambda Timothy M. Chan y Boris Aronov z Dan Halperin x Jack Snoeyink --
- Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions
- Optimal Partition Trees Timothy M. Chan
- Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
- Tighter Bounds on the Genus of Nonorthogonal Polyhedra Built from Rectangles
- Stochastic Minimum Spanning Trees in Euclidean Spaces Pegah Kamousi #
- Approximating the Diameter, Width, Smallest Enclosing Cylinder, and Minimum-Width Annulus
- Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
- CCCG 2011, Toronto ON, August 1012, 2011 Exact Algorithms and APX-Hardness Results for Geometric Set Cover
- CCCG 2011, Toronto ON, August 1012, 2011 Bichromatic Line Segment Intersection Counting in O(n
- The Asteroid Surveying Problem and Other Puzzles Timothy M. Chan Alexander Golynski Alejandro Lopez-Ortiz Claude-Guy Quimper
- CS 860, Spring 2011 Timothy Chan
- On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences
- A Note on Maximum Independent Sets in Rectangle Intersection Timothy M. Chan
- CS 860, Spring 2011 Timothy Chan
- Curves of Width One and the River Shore Problem Timothy M. Chan Alexander Golynski
- A Fully Dynamic Algorithm for Planar Width Timothy M. Chan
- Semi-Online Maintenance of Geometric Optima and Measures Timothy M. Chan
- A Space-Efficient Algorithm for Segment Intersection Eric Y. Chen
- Well-Separated Pair Decomposition in Linear Time? Timothy M. Chan
- Remarks on kLevel Algorithms in the Plane Timothy M. Chan \Lambda
- Quake Heaps: A Simple Alternative to Fibonacci Heaps
- Comparison-Based Time{Space Lower Bounds for Selection Timothy M. Chan y
- On the Bichromatic k-Set Problem Timothy M. Chan
- Random Sampling, Halfspace Range Reporting, and Construction of ( k)Levels in Three Dimensions \Lambda
- Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
- Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time
- Approximation Algorithms for Maximum Independent Set of PseudoDisks #
- In-Place 2-d Nearest Neighbor Search Timothy M. Chan Eric Y. Chen
- Balanced kColorings Therese C. Biedl Eowyn
- Approximate Nearest Neighbor Queries Revisited \Lambda Timothy M. Chan
- On Levels in Arrangements of Curves, III: Further Improvements
- Finding the Shortest Bottleneck Edge in a Parametric Minimum Spanning Tree Timothy M. Chan
- Deterministic Algorithms for 2d Convex Programming and 3d Online Linear Programming \Lambda
- A Minimalist's Implementation of an Approximate Nearest Neighbor Algorithm in Fixed Dimensions
- The Asteroid Surveying Problem and Other Puzzles Timothy M. Chan Alexander Golynski Alejandro L
- Polynomial-Time Approximation Schemes for Packing and Piercing Fat Objects
- All-Pairs Shortest Paths for Unweighted Undirected Graphs in o(mn) Time
- Primal Dividing and Dual Pruning: OutputSensitive Construction of 4d Polytopes and 3d Voronoi Diagrams \Lambda
- On Levels in Arrangements of Curves Timothy M. Chan y
- Semi-Online Maintenance of Geometric Optima and Measures Timothy M. Chan y
- Dynamic Connectivity for Axis-Parallel Peyman Afshani and Timothy M. Chan ?
- On Enumerating and Selecting Distances \Lambda Timothy M. Chan y
- OUTPUTSENSITIVE CONSTRUCTION OF CONVEX HULLS TIMOTHY MOONYEW CHAN
- Dynamic Coresets Timothy M. Chan
- Voronoi Diagrams in n 2 O( # lg lg n) Time Timothy M. Chan
- Multi-Pass Geometric Algorithms Timothy M. Chan y Eric Y. Chen z
- Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings
- Reporting Curve Segment Intersections Using Restricted Predicates Timothy M. Chan
- Dynamic Subgraph Connectivity with Geometric Applications Timothy M. Chan y
- A (Slightly) Faster Algorithm for Klee's Measure Problem Timothy M. Chan
- Three problems about simple polygons Timothy M. Chan y
- All-Pairs Shortest Paths with Real Weights in O(n 3 = log n) Time Timothy M. Chan
- Backwards Analysis of the KargerKleinTarjan Algorithm for Minimum Spanning Trees
- FixedDimensional Linear Programming Queries Made Easy \Lambda Timothy M. Chan y
- More Planar TwoCenter Algorithms Timothy M. Chan \Lambda
- Closest-Point Problems Simpli ed on the RAM Timothy M. Chan
- Optimal Halfspace Range Reporting in Three Dimensions Peyman Afshani Timothy M. Chan
- OutputSensitive Results on Convex Hulls, Extreme Points, and Related Problems
- Optimal In-Place and Cache-Oblivious Algorithms for 3-d Convex Hulls and 2-d Segment Intersection
- Euclidean Bounded-Degree Spanning Tree Ratios Timothy M. Chan y
- Geometric Applications of a Randomized Optimization Technique \Lambda Timothy M. Chan
- On Levels in Arrangements of Surfaces in Three Dimensions Timothy M. Chan y
- On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences
- A Note on Maximum Independent Sets in Rectangle Intersection Timothy M. Chan
- Optimal OutputSensitive Convex Hull Algorithms in Two and Three Dimensions
- A Near-Linear Area Bound for Drawing Binary Trees Timothy M. Chan y
- Low-Dimensional Linear Programming with Violations Timothy M. Chan y
- On Approximate Range Counting and Depth Peyman Afshani and Timothy M. Chan
- InstanceOptimal Geometric Algorithms Peyman Afshani Jrmy Barbay y Timothy M. Chan z
- Faster Core-Set Constructions and Data-Stream Algorithms in Fixed Dimensions
- A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections
- FunSort ---Or the Chaos of Unordered Binary Search
- On Levels in Arrangements of Lines, Segments, Planes, and Triangles \Lambda
- A Fully Dynamic Algorithm for Planar Width Timothy M. Chan y
- A Space-Ecient Algorithm for Segment Intersection Eric Y. Chen Timothy M. Chan y
- A Randomized Algorithm for Online Unit Timothy M. Chan and Hamid Zarrabi-Zadeh
- An Optimal Randomized Algorithm for Maximum Tukey Depth Timothy M. Chan
- CS 860, Spring 2011 Timothy Chan
- More Algorithms for All-Pairs Shortest Paths in Weighted Graphs Timothy M. Chan
- Dynamic Connectivity: Connecting to Networks and Geometry Timothy M. Chan
- A Minimalist's Implementation of the 3-d Divide-and-Conquer Convex Hull Algorithm
- A Dynamic Data Structure for 3-d Convex Hulls and 2-d Nearest Neighbor Queries
- Low-Dimensional Linear Programming with Violations Timothy M. Chan
- Weighted Capacitated, Priority, and Geometric Set Cover via Improved Quasi-Uniform Sampling
- Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
- Optimal Partition Trees Timothy M. Chan
- Linear-Space Data Structures for Range Mode Query in Arrays
