scholartag logo
 

Easy access to all your course materials and research articles. Try it out

 
 

DOCUMENTS

URLs to documents are signed and short lived for security

Resource NameCollection Name
  
    Many faces complexity, incidence bounds, crossing numbers, probabilistic methods, 1/r-cuttings: February 26, 2023Profile: PROSENJIT KUNDU
    Randomized incremental construction, Configuration spaces, Range-trees, random sampling, e-nets, VC-dimension, cutting lemmas, e-approximation/e-sample, kd-trees, online convex hull computation, Voronoi diagram computation, Point-location: Lectures of January-March 2023: Updated March 02, 2023Profile: PROSENJIT KUNDU
    Dynamic hull maintenance: Section 3.3.7, Pages 124-131, Theorem 3.12., Computational Geometry: An Introduction by Preparata and ShamosProfile: PROSENJIT KUNDU
    Binary hierarchical representation: Theorem 2, Page 87, Volume 3, Data Structures and Algorithms: Multi-dimensional Searching and Computational Geometry: Kurt MehlhornProfile: PROSENJIT KUNDU
    CGAL ProgrammingProfile: PROSENJIT KUNDU
    CGAL robust computationsProfile: PROSENJIT KUNDU
    Segment treesProfile: PROSENJIT KUNDU
    Kirkpatrick planar point location triangulationsProfile: PROSENJIT KUNDU
    Chan algorithm for computing convex hullsProfile: PROSENJIT KUNDU
    Many faces complexity, incidence bounds, crossing numbers, probabilistic methods, 1/r-cuttings: February 26, 2023COMPUTATIONAL GEOMETRY (CS60064)
    Randomized incremental construction, Configuration spaces, Range-trees, random sampling, e-nets, VC-dimension, cutting lemmas, e-approximation/e-sample, kd-trees, online convex hull computation, Voronoi diagram computation, Point-location: Lectures of January-March 2023: Updated March 02, 2023COMPUTATIONAL GEOMETRY (CS60064)
    Dynamic hull maintenance: Section 3.3.7, Pages 124-131, Theorem 3.12., Computational Geometry: An Introduction by Preparata and ShamosCOMPUTATIONAL GEOMETRY (CS60064)
    Binary hierarchical representation: Theorem 2, Page 87, Volume 3, Data Structures and Algorithms: Multi-dimensional Searching and Computational Geometry: Kurt MehlhornCOMPUTATIONAL GEOMETRY (CS60064)
    Kirkpatrick planar point location triangulations: Pages 56-60, Section 2.2.2.3, Theorem 2.7, Computational Geometry: An Introduction by Preparata and ShamosCOMPUTATIONAL GEOMETRY (CS60064)
    Chan algorithm for computing convex hullsCOMPUTATIONAL GEOMETRY (CS60064)
    CGAL ProgrammingCOMPUTATIONAL GEOMETRY (CS60064)
    CGAL robust computationsCOMPUTATIONAL GEOMETRY (CS60064)
    Segment treesCOMPUTATIONAL GEOMETRY (CS60064)