- Assignment 5 Computational Geometry (03684211)
- Assignment 3 -Computational Geometry (0368-4211)
- Cutting Triangular Cycles of Lines in Space Boris Aronov
- Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other
- The Number of Edges of Many Faces in a Line Segment Arrangement 1
- Efficient Algorithms for Geometric Optimization \Lambday Pankaj K. Agarwal z Micha Sharir x
- Counting and Representing Intersections Among Triangles in Three Dimensions
- Random Triangulations of Planar Point Sets Micha Sharir #
- On the Union of #Round Objects in Three and Four Dimensions #
- Efficient algorithms for maximum regression depth Marc van Kreveld \Lambda
- On Lines and Joints Haim Kaplan
- Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells
- Ray Shooting Amidst Spheres in Three Dimensions and Related Problems \Lambda
- On The Complexity of Arrangements of Circles in the Plane \Lambda
- On the Number of Congruent Simplices in a Point Set Pankaj K. Agarwal y Micha Sharir z
- A Kinetic Triangulation Scheme for Moving Points in The Haim Kaplan
- Improved Bound for the Union of Fat Triangles Esther Ezra
- On Incidences Between Points and Hyperplanes Roel Apfelbaum
- Near-Linear Approximation Algorithms for Geometric Hitting Sets
- Small-size -Nets for Axis-Parallel Rectangles and Boxes [Extended Abstract]
- Assignment 2 -Geometric Optimization (0368-4144) Due: November 23, 2009
- DYNAMICALLY MAINTAINING CONFIGURATIONS IN THE PLANE (detailed abstract)
- Assignment 2 -Computational Geometry (0368-4211)
- Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions \Lambda
- ONLINE CONFLICTFREE COLORING FOR INTERVALS KE CHEN + , AMOS FIAT # , HAIM KAPLAN , MEITAL LEVY , JI
- Linear Programming --Randomization and Abstract Frameworks ?
- Vertical Decomposition of Shallow Levels in 3Dimensional Arrangements and Its Applications #
- Colored Intersection Searching via Sparse Rectangular Matrix Multiplication
- The Discrete 2Center Problem \Lambda Pankaj K. Agarwal y Micha Sharir z Emo Welzl x
- DOI: 10.1007/s00454-005-1166-2 Discrete Comput Geom 34:231250 (2005) Discrete & Computational
- COMPUTATIONAL GEOMETRY FINAL TAKEHOME EXAM
- On Cell Complexities in Hyperplane Arrangements # Boris Aronov + Micha Sharir #
- On Lines, Joints, and Incidences in Three Dimensions Gyorgy Elekes
- Curve-Sensitive Cuttings Vladlen Koltun
- Applications of Parametric Searching in Geometric Optimization
- Largest Placement of One Convex Polygon inside Another \Lambda Pankaj K. Agarwal y Nina Amenta z Micha Sharir x
- Vertical Decomposition of a Single Cell in a ThreeDimensional Arrangement of Surfaces and its Applications \Lambda
- Geometrically Aware Communication in Random Wireless Networks Reconsidered #
- State of the Union (of Geometric Objects): A Review Pankaj K. Agarwal
- On the Complexity of Many Faces in Arrangements of PseudoSegments and of Circles
- Semi-algebraic Range Reporting and Emptiness Searching with Applications
- A NearLinear Algorithm for the Planar 2Center Problem \Lambda Micha Sharir y
- COMPUTATIONAL GEOMETRY -FINAL Prof. Micha Sharir
- Online Conflict Free Coloring for Halfplanes, Congruent Disks, and AxisParallel Rectangles #
- An Improved Bound on the Number of Unit Area Roel Apfelbaum
- SIAM J. COMPUT. c 2005 Society for Industrial and Applied Mathematics Vol. 34, No. 6, pp. 13311351
- Pseudo-line Arrangements: Duality, Algorithms, and Applications Pankaj K. Agarwal y Micha Sharir z
- On the ICP Algorithm # Esther Ezra
- Randomized Algorithms for Geometric Optimization Problems \Lambda
- Exact and Approximation Algortihms for Clustering \Lambda Pankaj K. Agarwal y Cecilia M. Procopiuc z
- Motion Planning for a Convex Polygon in a Polygonal Environment
- Rectilinear and Polygonal pPiercing and pCenter Problems \Lambda Micha Sharir y Emo Welzl z
- New Results on Shortest Paths in Three Dimensions Joseph S. B. Mitchell
- The Partition Technique for Overlays of Envelopes Vladlen Koltun
- Weak -Nets and Interval Chains NOGA ALON, HAIM KAPLAN, GABRIEL NIVASCH,
- On the Number of CrossingFree Matchings, Cycles, and Partitions #
- On the Complexity of the Union of Fat Objects in the Plane
- Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions \Lambda
- Pruning Planes in Megiddo's 3-Dimensional LP algorithm Geometric Optimization
- A Subexponential Bound for Linear Programming \Lambday Ji r' i Matou sek z
- Distinct Distances in Three and Higher Dimensions # Boris Aronov + Janos Pach # Micha Sharir Gabor Tardos
- The Common Exterior of Convex Polygons in the Plane \Lambda Boris Aronov y Micha Sharir z
- Algorithmic Techniques for Geometric Optimization ?
- On the Number of Directions Determined by a Three-Dimensional Points Set
- Optimal cover of points by disks in a simple polygon
- Assignment 1 -Geometric Optimization (0368-4144) Due: November 9, 2009
- On Approximate Halfspace Range Counting and Relative Epsilon-Approximations
- On Generalized Geometric Graphs and Pseudolines Micha Sharir y Shakhar Smorodinsky z
- Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles
- Balanced Lines, Halving Triangles, and the Generalized Lower Bound Theorem
- Extremal problems on triangle areas in two and three dimensions Adrian Dumitrescu
- On Distinct Distances and Incidences: Elekes's Transformation and the New Algebraic Developments
- On a Single Cell in an Arrangement of Convex Polyhedra in R 3# Esther Ezra + Micha Sharir #
- 0-8493-8524-5/97/$0.00+$.50 1997 by CRC Press LLC
- 3-DIMENSIONAL EUCLIDEAN VORONOI DIAGRAMS OF LINES WITH A FIXED NUMBER OF ORIENTATIONS
- Coresets for Weighted Facilities and Their Applications Dan Feldman
- TELAVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER
- On Levels in Arrangements of Lines, Segments, Planes, and Triangles
- Discrete and Computational Geometry MSRI Publications
- Computing the Volume of the Union of Cubes Pankaj K. Agarwal
- SIAM J. COMPUT. c 2010 Society for Industrial and Applied Mathematics Vol. 39, No. 7, pp. 32833310
- Arrangements and Their Applications Pankaj K. Agarwaly Micha Sharirz
- Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions
- ARTICLE IN PRESS UNCORRECTEDPROOF
- Hausdorff Distance under Translation for Points and Balls Pankaj K. Agarwal
- The Simplex Algorithm in Dimension Three1 Volker Kaibel2
- On k-Sets in Four Dimensions Jiri Matousek
- Computing Maximally Separated Sets in the Plane and Independent Sets in the Intersection Graph of Unit Disks
- ACMB079A-05 Journal of the ACM November 12, 2008 2:6 Algorithms for Center and Tverberg Points
- Guarding a Terrain by Two Watchtowers Pankaj K. Agarwal
- Computing a Center-Transversal Line Pankaj K. Agarwal 1
- Counting Colors in Boxes Haim Kaplan
- Similar Simplices in a d-Dimensional Point Set Pankaj K. Agarwal
- Bi-criteria Linear-time Approximations for Generalized k-Mean/Median/Center
- Arrangements in Geometry: Recent Advances and Challenges
- Almost Tight Bound for the Union of Fat Tetrahedra in Three Esther Ezra
- ACMB079A-04 Journal of the ACM November 6, 2008 20:35 Kinetic and Dynamic Data Structures for Closest Pair
- The Overlay of Minimization Diagrams in a Randomized Incremental Construction
- Stabbing Convex Polygons with a Segment or a Pankaj K. Agarwal1
- On Degrees in Random Triangulations of Point Sets Micha Sharir
- Incidences in Three Dimensions and Distinct Distances in [Extended Abstract]
- Nondegenerate Spheres in Three Dimensions Roel Apfelbaum
- Assignment 1 -Computational Geometry (0368-4211)
- Assignment 5 -Computational Geometry (0368-4211)
- Advanced Topics in Computational and Combinatorial Prof. Micha Sharir
- Advanced Topics in Computational and Combinatorial Geometry
- Assignment 3 Advanced Topics in Computational Geometry
- Assignment 4 -Geometric Optimization (0368-4144) Due: January 4, 2010
- Assignment 5 -Geometric Optimization (0368-4144) Due: January 25, 2010
- Discrete Comput Geom 22:547567 (1999) Discrete & Computational Geometry 1999 Springer-Verlag New York Inc.
- Assignment 3 -Geometric Optimization (0368-4144) Due: December 21, 2009
- An Improved Bound for k-Sets in Four Dimensions Micha Sharir
- On Empty Convex Polygons in a Planar Point Set # Rom Pinchasi + Rados Radoicic # Micha Sharir
- The Clarkson-Shor Technique Revisited and Extended Micha Sharir y
- Efficient Randomized Algorithms for Some Geometric Optimization Problems \Lambda
- Clustering: Applications
- An OptimalTime Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions #
- (a) " . (b) , )
- arXiv:1012.0591v1[cs.DM]2Dec2010 Counting Plane Graphs: Flippability and its Applications
- Assignment 5 -Computational Geometry (0368-4211)
- Seminar on Voronoi Diagrams and Delaunay Triangulations Talk 3, Material: [AK] Sections 3.4, 4.1, 4.2, 4.3.1
- Voronoi Diagrams Franz Aurenhammer
- Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in IR d
- Approximation Algorithms for Minimum-Width Annuli and Shells
- Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions \Lambda
- Cutting Circles into Pseudosegments and Improved Bounds for Incidences #
- Advanced Topics in Computational and Combinatorial Geometry
- Voronoi Diagrams of Lines in 3Space Under Polyhedral Convex Distance Functions \Lambda
- TELAVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER
- Radial Points in the Plane \Lambda J'anos Pach y Micha Sharir z
- A NearLinear Algorithm for the Planar 2Center Problem # Micha Sharir +
- An Improved Bound for kSets in Three Dimensions Micha Sharir \Lambda Shakhar Smorodinsky y G'abor Tardos z
- Simple Proofs of Classical Theorems in Discrete Geometry via the GuthKatz Polynomial Partitioning
- Assignment 4 -Computational Geometry (0368-4211)
- The 2-Center Problem in Three Dimensions Pankaj K. Agarwal
- The 2-Center Problem with Obstacles Dan Halperin y Micha Sharir z Ken Goldberg x
- An Improved Bound for Joints in Arrangements of Lines in Sharona Feldman y Micha Sharir z
- The Overlay of Lower Envelopes and its Applications \Lambda Pankaj K. Agarwal y Otfried Schwarzkopf z Micha Sharir x
- On Overlays and Minimization Diagrams Vladlen Koltun
- REPEATED ANGLES IN THREE AND FOUR DIMENSIONS ROEL APFELBAUM AND MICHA SHARIR
- Counting Triangulations of Planar Point Sets Micha Sharir
- Assignment 4 Advanced Topics in Computational Geometry
- Relative (p, )-Approximations in Geometry Sariel Har-Peled
- Excess in Arrangements of Segments Micha Sharir \Lambda
- From Joints to Distinct Distances and Beyond: The Dawn of an Algebraic Era
- Finding the Maximal Empty Disk Containing a Query Haim Kaplan
- Unit Distances in Three Dimensions Haim Kaplan
