A. Aggarwal, J. S. Chang, and C. K. Yap (1985). Minimum area circumscribing polygons.Visual Comput.
, pp. 112–117.MATHCrossRef
A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilber (1986). Geometric applications of a matrix searching algorithm.Proc. 2nd ACM Symposium on Computational Geometry, pp. 285–292.
A. Aggarwal, B. Chazelle, L. Guibas, C. Ó'Dúnlaing, and C. K. Yap (1987). Parallel computational geometry. Robotics Report No. 115, Courant Institute, New York University. (Reported at the 26th IEEE FOCS Symposium, Portland, Oregon, 1985.)
M. Ajtai, J. Komlós, and E. Szemerédi (1982). AnO(n log(n)) Sorting Network.Proc. 15th ACM Symposium on Theory of Computing, pp. 1–9. Also inCombinatorica,3(1) (1983), pp. 1–19.
S. Akl (1983). Parallel algorithm for convex hulls. Manuscript, Department of Computer Science, Queen's University, Kingston, Ontario.
M. J. Atallah and M. T. Goodrich (1985). Efficient parallel solutions to geometric problems.Proc. 1985 IEEE Conference on Parallel Processing, pp. 411–417.
M. J. Atallah and M. T. Goodrich (1986). Efficient plane sweeping in parallel.Proc. 2nd Symposium on Computational Geometry, pp. 216–225.
M. J. Atallah, R. Cole, and M. T. Goodrich (1987). Cascading divide- and-conquer: a technique for designing parallel algorithms.Proc. 28th IEEE FOCS Symposium, pp. 151–160.
M. Ben-Or (1983). Lower bounds for algebraic computational trees.Proc. 15th ACM Symposium on Theory of Computing, pp. 80–86.
M. Ben-Or, D. Kozen, and J. Reif (1984). The complexity of elementary algebra and geometry.Proc. 16th ACM Symposium on Theory of Computing, pp. 457–464.
J. L. Bentley (1977). Algorithms for Klee's rectangle problems. Unpublished manuscript, CMU.
J. L. Bentley and D. Wood (1980). An optimal worst-case algorithm for reporting intersections of rectangles.IEEE Trans. Comput.
, pp. 571–577.CrossRefMathSciNet
J. E. Boyce, D. P. Dobkin, R. L. Drysdale, and L. J. Guibas (1985). Finding extremal polygons.SIAM J. Comput.
, pp. 134–147.MATHCrossRefMathSciNet
R. P. Brent (1974). The parallel evaluation of general arithmetic expressions.J. Assoc. Comput. Mach.
(2), pp. 201–206.MATHMathSciNet
K. Q. Brown (1979). Voronoi diagrams from convex hulls.Inform. Process. Lett.
(5), pp. 223–228.MATHCrossRef
J. S. Chang (1986). Polygon optimization problems. Ph.D. Dissertation, Robotics Report No. 78, Department of Computer Science, Courant Institute, New York University.
B. Chazelle (1982). A theorem on polygon cutting with applications.Proc. 23rd IEEE FOCS Symposium, pp. 339–349.
B. M. Chazelle (1984). Computational geometry on a systolic chip.IEEE Trans. Comput.
, pp. 774–785.CrossRef
B. Chazelle (1986). Reporting and counting segment intersections.J. Comput. System Sci.
(2), pp. 156–182.MATHCrossRefMathSciNet
B. Chazelle and J. Incerpi (1984). Triangulation and shape-complexity.ACM Trans. Graphics
(2), pp. 135–152.MATHCrossRef
A. Chow (1980). Parallel algorithms for geometric problems. Ph.D. Dissertation, Computer Science Department, University of Illinois at Urbana-Champaign, 1980.
A. Chow (1981). A parallel algorithm for determining convex hulls of sets of points in two dimensions.Proc. 19th Allerton Conference on Communication, Control and Computing, pp. 214–233.
V. Chvátal (1975). A combinatorial theorem in plane geometry.J. Combin. Theory Ser. B
, pp. 39–41.MATHCrossRef
R. Cole (1986). Parallel merge sort.Proc. 27th IEEE FOCS Symposium, pp. 511–516.
G. E. Collins (1975). Quantifier elimination for real closed fields by cylindrical algebraic decomposition.2nd GI Conference on Automata Theory and Formal Languages. Lecture Notes in Computer Science, Vol. 33, Springer-Verlag, Berlin, pp. 134–183.
S. Cook and C. Dwork (1982). Bounds on the time for parallel RAMS to compute simple functions.Proc. 14th ACM Symposium on Theory of Computing, pp. 231–233.
N. Dadoun and D. G. Kirkpatrick (1987). Parallel processing for efficient subdivision search.Proc. 3rd Annual Symposium on Computational Geometry, 1987, 205–214.
D. P. Dobkin and D. G. Kirkpatrick (1983). Fast detection of polyhedral intersections.Theoret. Comput. Science
, pp. 241–253.MATHCrossRefMathSciNet
H. Freeman and R. Shapira (1975). Determining the minimum-area encasing rectangle for an arbitrary closed curve.Comm. ACM
L. J. Guibas and J. Stolfi (1983). Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. Proc.15th ACM Symposium on Theory of Computing, pp. 221–234. Also to appear inACM Trans. Graphics.
V. Klee and M. C. Laskowski (1985). Finding the smallest triangles containing a given polygon.J. Algorithms
, pp. 457–464.CrossRefMathSciNet
D. Kozen and C. K. Yap (1985). Algebraic cell decomposition in NC.Proc. 26th IEEE FOCS Symposium, pp. 515–521.
T. Leighton (1984). Tight bounds on the complexity of parallel sorting.Proc. 16th ACM Symposium on Theory of Computing, pp. 71–80.
W. Lipski, Jr., and F. P. Preparata (1981). Segments, rectangles, contours.J. Algorithms
, pp. 63–76.MATHCrossRefMathSciNet
D. Nath, S. N. Maheshwari, and P. C. P. Bhatt (1981). Parallel algorithms for the convex hull in two dimensions.Proc. Conference on Analysis Problem Classes and Programming for Parallel Computing, pp. 358–372.
J. O'Rourke, A. Aggarwal, S. Madilla, and M. Baldwin (1986). An optimal algorithm for finding minimal enclosing triangles.J. Algorithms
M. H. Overmars and J. Van Leeuwen (1981). Maintenance of configurations in the plane.J. Comput. Systems Sci.
, pp. 166–204.MATHCrossRef
F. Preparata and S. J. Hong (1977). Convex hulls of finite sets of points in two and three dimensions.Comm. ACM
, pp. 87–93.MATHCrossRefMathSciNet
F. Preparata and M. I. Shamos (1985).Computational Geometry: An Introduction. Springer-Verlag, Berlin.
M. I. Shamos (1977). Computational geometry. Ph.D. Dissertation, Yale University.
M.I. Shamos and D. Hoey (1975). Closest point problems.Proc. 16th IEEE Symposium on Foundations of Computing, pp. 151–162.
Y. Shiloach and U. Vishkin (1982). AnO
)) parallel connectivity algorithm.J. Algorithms
, pp. 57–67.MATHCrossRefMathSciNet
R. E. Tarjan and U. Vishkin (1985). An efficient parallel biconnectivity algorithm.SIAM J. Comput.
, 14(4), pp. 862–874.MATHCrossRefMathSciNet
G. T. Toussaint (1983). Solving geometric problems using “rotating callipers.”Proc. IEEE Melecon '83.
L. G. Valiant (1975). Parallelism in comparison problems.SIAM J. Comput.
(3), pp. 348–355.MATHCrossRefMathSciNet
H. Wagener (1985). Parallel computational geometry using polygon ordering. Ph.D. Thesis, Technical University of Berlin.
H. Wagener (1987). Optimally parallel algorithms for convex hull determination (submitted).
C. K. Yap (1987). What can be parallelized in computational geometry? International Workshop on Parallel Algorithms and Architecture, Humboldt University, Berlin, DDR (invited talk). Proceedings to appear.