[ACM Press the eighth annual symposium - Berlin, Germany (1992.06.10-1992.06.12)] Proceedings of the eighth annual symposium on Computational geometry - SCG '92 - Intersection detection and separators for simple polygons

[ACM Press the eighth annual symposium -

[ACM Press the eighth annual symposium - Berlin, Germany (1992.06.10-1992.06.12)] Proceedings of the eighth annual symposium on Computational geometry - SCG '92 - Optical computational geometry

✍ Karasik, Y. B.; Sharir, M. 📂 Article 📅 1992 🏛 ACM Press ⚖ 912 KB

[ACM Press the eighth annual symposium -

[ACM Press the eighth annual symposium - Berlin, Germany (1992.06.10-1992.06.12)] Proceedings of the eighth annual symposium on Computational geometry - SCG '92 - New sparseness results on graph spanners

✍ Chandra, Barun; Das, Gautam; Narasimhan, Giri; Soares, José 📂 Article 📅 1992 🏛 ACM Press ⚖ 964 KB

[ACM Press the eighth annual symposium -

[ACM Press the eighth annual symposium - Berlin, Germany (1992.06.10-1992.06.12)] Proceedings of the eighth annual symposium on Computational geometry - SCG '92 - Numerical stability of algorithms for 2D Delaunay triangulations

✍ Fortune, Steven 📂 Article 📅 1992 🏛 ACM Press ⚖ 889 KB

[ACM Press the fourth annual symposium -

[ACM Press the fourth annual symposium - Urbana-Champaign, Illinois, United States (1988.06.06-1988.06.08)] Proceedings of the fourth annual symposium on Computational geometry - SCG '88 - Optimal parallel algorithms for polygon and point-set problems

✍ Cole, R.; Goodrich, M. T. 📂 Article 📅 1988 🏛 ACM Press ⚖ 954 KB

[ACM Press the fourth annual symposium -

[ACM Press the fourth annual symposium - Urbana-Champaign, Illinois, United States (1988.06.06-1988.06.08)] Proceedings of the fourth annual symposium on Computational geometry - SCG '88 - Optimal parallel algorithms for polygon and point-set problems

✍ Cole, R.; Goodrich, M. T. 📂 Article 📅 1988 🏛 ACM Press ⚖ 954 KB

In this paper we give parallel algorithms for a number of problems defined on polygons and point sets. All of our algorithms have optimal T(n) \* P(n) products, where T(n) is the time complexity and P(n} is the number of processors used, and are for the EREW PRAM or CREW PRAM models. In addition, ou

[ACM Press the seventh annual symposium

[ACM Press the seventh annual symposium - North Conway, New Hampshire, United States (1991.06.10-1991.06.12)] Proceedings of the seventh annual symposium on Computational geometry - SCG '91 - Randomized parallel algorithms for trapezoidal diagrams

✍ Clarkson, Kenneth L.; Cole, Richard; Tarjan, Robert E. 📂 Article 📅 1991 🏛 ACM Press ⚖ 1009 KB