- Uniform Samples of Generic Surfaces Have Nice Delaunay Triangulations
- Greedy Optimal Homotopy and Homology Generators # Je# Erickson + Kim Whittlesey #
- DivideandConquer Lower Bounds He who can properly define and divide is to be considered a god.
- Bibliography [1] Pankaj K. Agarwal. Partitioning arrangements of lines: II. Applications. Discrete
- MinimumCost Coverage of Point Sets by Disks # Helmut Alt + Esther M. Arkin # Herve Bronnimann Jeff Erickson Sandor P. Fekete #
- Geometric Range Searching and Its Relatives \Lambda Pankaj K. Agarwal Jeff Erickson
- Games of No Chance MSRI Publications
- ARBITRARILY LARGE NEIGHBORLY FAMILIES OF CONGRUENT SYMMETRIC CONVEX 3POLYTOPES
- On the Relative Complexities of Some Geometric Problems \Lambda (Extended Abstract)
- VIETORIS-RIPS COMPLEXES OF PLANAR POINT SETS ERIN W. CHAMBERS, VIN DE SILVA, JEFF ERICKSON, AND ROBERT GHRIST
- Dense Point Sets Have Sparse Delaunay Triangulations # or ``. . . But Not Too Nasty''
- Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
- Iterated Nearest Neighbors and Finding Minimal Polytopes \Lambda
- New Lower Bounds for Hopcroft's Problem \Lambda Jeff Erickson
- AUTOMATIC BLOCKING SCHEME FOR STRUCTURED MESHING IN 2D MULTIPHASE FLOW SIMULATION
- Tightening Non-Simple Paths and Cycles on Surfaces Eric Colin de Verdi`ere
- New Lower Bounds for Halfspace Emptiness Je Erickson
- Local Polyhedra and Geometric Graphs Jeff Erickson
- Introduction The overwhelming majority of research in computational geometry is devoted to
- On the Relative Complexities of Some Geometric Problems \Lambda Jeff Erickson
- NEW LOWER BOUNDS FOR CONVEX HULL PROBLEMS IN ODD DIMENSIONS \Lambda
- Separation-Sensitive Collision Detection for Convex Objects Je Erickson Leonidas J. Guibas y Jorge Stol z Li Zhang x
- Better Lower Bounds on Detecting Affine and Spherical Degeneracies
- Session C1 12th Canadian Conference on Computational Geometry Reconfiguring Convex Polygons
- Spacetime Meshing with Adaptive Re nement and Coarsening Reza Abedi y Shuo-Heng Chung z Je Erickson zx Yong Fan y Michael Garland z
- Algorithmic Issues in Modeling Motion Pankaj K. Agarwal, Leonidas J. Guibas,
- Both copies of this form must be signed by you. The original must be returned to your Book Editor, and a copy should be retained for your files.
- Linear Satis ability Problems Many computational decision problems, particularly in computational geometry,
- Kinetic Collision Detection Between Two Simple Polygons Julien Basch
- ARBITRARILY LARGE NEIGHBORLY FAMILIES OF CONGRUENT SYMMETRIC CONVEX 3-POLYTOPES
- Building Spacetime Meshes over Arbitrary Spatial Domains # Je# Erickson + Damrong Guoy # John M. Sullivan Alper
- On the Least Median Square Problem # Je# Erickson + Sariel HarPeled #
- Tightening NonSimple Paths and Cycles on Surfaces # Eric Colin de Verdiere + Jeff Erickson #
- It was a large room. Full of people. All kinds. And they had all arrived at the same building at more or less the same time.
- Dense Point Sets Have Sparse Delaunay Triangulations Je Erickson
- Optimally Cutting a Surface into a Disk # Je# Erickson + Sariel HarPeled
- Lower Bounds for Fundamental Geometric Problems Je rey Gordon Erickson
- Finite-Resolution Hidden Surface Removal Je Erickson y
- New Lower Bounds for Convex Hull Problems in Odd Dimensions
- Homology Flows, Cohomology Cuts Erin W. Chambers
- Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
- OutputSensitive Algorithms for Computing NearestNeighbour Decision Boundaries David Bremner y Erik Demaine z Jeff Erickson x John Iacono { Stefan Langerman k
- Linear Satisfiability Problems Many computational decision problems, particularly in computational geometry,
- Lower Bounds for External Algebraic Decision Trees # Je# Erickson +
- 1. Introduction HW Cl, Cl2 CS
- Spherical Degeneracies The spherical degeneracy problem asks, given n points in IR d , if any d+ 2 lie on
- Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries David Bremner
- Optimally Cutting a Surface into a Disk # Je# Erickson + Sariel HarPeled #
- Chicago Journal of Theoretical Computer Science
- Finding Longest Arithmetic Progressions Je Erickson
- Divide-and-Conquer Lower Bounds He who can properly de ne and divide is to be considered a god.
- Nice Point Sets Can Have Nasty Delaunay Triangulations Je Erickson
- Introduction The overwhelming majority of research in computational geometry is devoted to
- Lower Bounds for Fundamental Geometric Problems Jeffrey Gordon Erickson
- Lower Bounds for Fundamental Geometric Problems Jeffrey Gordon Erickson
- Computing Replacement Paths in Surface Embedded Graphs Jeff Erickson
- Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers
- Computing the Shortest Essential Cycle Jeff Erickson
- WALKING YOUR DOG IN THE WOODS IN POLYNOMIAL TIME ERIN WOLF CHAMBERS, ERIC COLIN DE VERDI`ERE, JEFF ERICKSON,
- Finding one tight cycle SERGIO CABELLO
- Necklaces, Convolutions, and X + Y David Bremner
- Minimum-Cost Coverage of Point Sets by Disks Helmut Alt Esther M. Arkin Herve Bronnimann Jeff Erickson Sandor P. Fekete
- Author's personal copy Journal of Discrete Algorithms 6 (2008) 5158
- Greedy Optimal Homotopy and Homology Generators Jeff Erickson
- Lower Bounds for External Algebraic Decision Trees Jeff Erickson
- Spacetime Meshing with Adaptive Refinement and Coarsening Shuo-Heng Chung
- Local Polyhedra and Geometric Graphs Jeff Erickson
- Flipping Cubical Meshes Marshall Bern1, David Eppstein2, and Jeff Erickson3
- Optimally Cutting a Surface into a Disk Jeff Erickson
- E cient Searching with Linear Constraints Pankaj K. Agarwaly Lars Argez Je Ericksonx
- Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles
- 1. Introduction HW Cl, Cl2 CS
- Games of No Chance MSRI Publications
- Games of No Chance MSRI Publications
- On the Relative Complexities of Some Geometric Problems Je Erickson
- Chicago Journal of Theoretical Computer Science
- Tightening Non-Simple Paths and Cycles on Surfaces Eric Colin de Verdi`ere
- E cient Searching with Linear Constraints (Extended Abstract)
- Space-Time Tradeo s for Emptiness Queries (Extended abstract)
- Spherical Degeneracies The spherical degeneracy problem asks, given n points in IRd, if any d+ 2 lie on
- Halfspace Emptiness The halfspace emptiness problem asks, given a set of points and a set of halfspaces,
- On the Relative Complexities of Some Geometric Problems(Extended Abstract) Je Ericksony
- New Lower Bounds for Hopcroft's Problem (Extended Abstract)
- arXiv:cs.CG/010702318Jul2001 Vertex-Unfoldings
- Bibliography 1] Pankaj K. Agarwal. Partitioning arrangements of lines: II. Applications. Discrete
- New Lower Bounds for Hopcroft's Problem Je Erickson
- On the Complexity of Halfspace Volume Queries Erik D. Demaine # Je# Erickson + Stefan Langerman #
- Optimally Cutting a Surface into a Disk Jeff Erickson
- New Lower Bounds for Hopcroft's Problem \Lambda (Extended Abstract)
- Efficient Searching with Linear Constraints (Extended Abstract)
- Convex Hull Problems The construction of convex hulls is perhaps the oldest and beststudied problems
- Geometric Range Searching and Its Relatives Pankaj K. Agarwal Je Erickson
- Kinetic Collision Detection Between Two Simple Polygons Julien Basch Je Ericksony
- Splitting (Complicated) Surfaces Is Hard # Erin W. Chambers +
- Kinetic Collision Detection Between Two Simple Polygons Julien Basch \Lambda Jeff Erickson y Leonidas J. Guibas z John Hershberger x
- Ecient Tradeo Schemes in Data Structures for Querying Moving Objects
- Separation-Sensitive Collision Detection for Convex Objects Je Erickson y Leonidas J. Guibas z Jorge Stol x Li Zhang {
- Uniform Samples of Generic Surfaces Have Nice Delaunay Triangulations #
- Dense Point Sets Have Sparse Delaunay Triangulations or ". . . But Not Too Nasty"
- Convex Hull Problems The construction of convex hulls is perhaps the oldest and best-studied problems
- SpaceTime Tradeoffs for Emptiness Queries \Lambda (Extended abstract)
- Flipping Cubical Meshes Marshall Bern
- Adversary Lower Bounds Down with Euclid! Death to the triangles!
- Local Polyhedra and Geometric Graphs # Je# Erickson +
- Efficient Searching with Linear Constraints \Lambda Pankaj K. Agarwal y Lars Arge z Jeff Erickson x
- Adversary Lower Bounds Down with Euclid! Death to the triangles!
- Iterated Nearest Neighbors and Finding Minimal Polytopes
- Better Lower Bounds on Detecting A ne and Spherical Degeneracies
- Games of No Chance MSRI Publications
- Kinetic Collision Detection Between Two Simple Polygons Julien Basch # Je# Erickson + Leonidas J. Guibas # John Hershberger Li Zhang
- Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
- Lower Bounds for Fundamental Geometric Problems Je rey Gordon Erickson
- Better Lower Bounds on Detecting A ne and Spherical Degeneracies
- NEW LOWER BOUNDS FOR CONVEX HULL PROBLEMS IN ODD DIMENSIONS
- Dense Point Sets Have Sparse Delaunay Triangulations or \. . . But Not Too Nasty"
- Better Lower Bounds on Detecting Affine and Spherical Degeneracies \Lambda
- Nice Point Sets Can Have Nasty Delaunay Triangulations Je Erickson
- Indexing Moving Points (Extended Abstract)
- Algorithmic Issues in Modeling Motion Pankaj Agarwal, Leonidas
- Shortest Non-Crossing Walks in the Plane Jeff Erickson
- New Lower Bounds for Halfspace Emptiness \Lambda Jeff Erickson
- Indexing Moving Points Pankaj K. Agarwal y Lars Arge z Je Erickson x
- Local Polyhedra and Geometric Graphs # Je# Erickson +
- BUILDING SPACE-TIME MESHES OVER ARBITRARY SPATIAL DOMAINS
- Halfspace Emptiness The halfspace emptiness problem asks, given a set of points and a set of halfspaces,
- Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles
- New Lower Bounds for Convex Hull Problems in Odd Dimensions \Lambda
- On the Least Median Square Problem Jeff Erickson
- Building Spacetime Meshes over Arbitrary Spatial Domains Jeff Erickson
- SPACE-TIME TRADEOFFS FOR EMPTINESS QUERIES JEFF ERICKSON y
- Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
- Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
- Maximum Flows and Parametric Shortest Paths in Planar Graphs Jeff Erickson
- Finding one tight cycle Sergio Cabello
- Shortest Non-trivial Cycles in Directed Surface Graphs Jeff Erickson
- Proceedings of Symposia in Applied Mathematics Combinatorial Optimization of Cycles and Bases
- Splitting (Complicated) Surfaces Is Hard Erin W. Chambers
- Multiple Source Shortest Paths in a Genus g Graph Sergio Cabello
- Empty-Ellipse Graphs Olivier Devillers
- Finding one tight cycle Sergio Cabello
- Global Minimum Cuts in Surface Embedded Graphs Jeff Erickson
- Multiple-Source Shortest Paths in Embedded Graphs Sergio Cabello
- Walking Your Dog in the Woods in Polynomial Time Erin Wolf Chambers
- Necklaces, Convolutions, and X + Y David Bremner1
- Tracing Compressed Curves in Triangulated Surfaces Jeff Erickson
