Jump to content

Search results

  • Marc; Overmars, Mark (2008). Computational Geometry. doi:10.1007/978-3-540-77974-2. ISBN 978-3-540-77973-5. Range and Segment Trees in CGAL, the Computational...
    10 KB (1,248 words) - 16:55, 6 February 2024
  • Thumbnail for Graham scan
    Algorithms and Applications. Berlin: Springer. pp. 2–14. doi:10.1007/978-3-540-77974-2. ISBN 978-3-540-77973-5. Arkin, Esther M.; Fekete, Sándor P.; Hurtado...
    12 KB (1,731 words) - 19:46, 28 June 2024
  • Thumbnail for Segment tree
    (2nd ed.). Springer-Verlag Berlin Heidelberg New York. doi:10.1007/978-3-540-77974-2. ISBN 3-540-65620-0. http://www.cs.nthu.edu.tw/~wkhon/ds/ds10/tutorial/tutorial6...
    12 KB (1,787 words) - 21:32, 11 June 2024
  • Thumbnail for Simple polygon
    Algorithms and Applications (3rd ed.). Springer. p. 58. doi:10.1007/978-3-540-77974-2. Meisters, G. H. (1975). "Polygons have ears". The American Mathematical...
    31 KB (3,199 words) - 07:45, 18 July 2024
  • Thumbnail for K-d tree
    Range Searching". Computational Geometry. pp. 95–120. doi:10.1007/978-3-540-77974-2_5. ISBN 978-3-540-77973-5. Blum, M.; Floyd, R. W.; Pratt, V. R.; Rivest...
    28 KB (3,770 words) - 20:44, 23 May 2024
  • Thumbnail for Voronoi diagram
    (2008). Computational Geometry (Third ed.). Springer-Verlag. ISBN 978-3-540-77974-2. 7.4 Farthest-Point Voronoi Diagrams. Includes a description of the...
    46 KB (5,590 words) - 18:51, 13 June 2024
  • Thumbnail for Ronald Graham
    Algorithms and Applications. Berlin: Springer. pp. 2–14. doi:10.1007/978-3-540-77974-2. ISBN 978-3-540-77973-5. Foster, Jim; Szabo, Tamas (2007). "Diameter...
    52 KB (4,442 words) - 06:56, 29 May 2024