Geometric Computing
Project status: Active
Research Areas
People
| Roberto Tamassia |
Publications
Barequet, G., Bridgeman, S. S., Duncan, C. A., Goodrich, M. T., and Tamassia, R. Geometric Computing Over the Internet. IEEE Internet Computing 3, 2 (1999), 21-29. [ pdf ]
Devillers, O., Liotta, G., Preparata, F., and Tamassia, R. Checking the convexity of polytopes and the planarity of subdivisions. Computational Geometry: Theory and Applications 11, 3-4 (1998), 187-208. [ pdf ]
Goodrich, M. T., and Tamassia, R. Dynamic Trees and Dynamic Point Location. SIAM Journal on Computing 28, 2 (1998), 612-636. [ pdf ]
Liotta, G., Preparata, F., and Tamassia, R. Robust proximity queries: An illustration of degree-driven algorithm design. SIAM Journal on Computing 28, 3 (1998), 864-889. [ pdf ]
Barequet, G., Bridgeman, S., Duncan, C., Goodrich, M., and Tamassia, R. Classical Computational Geometry in GeomNet. In Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97) (Jun 1997), ACM Press, New York, NY, pp. 412-414.
Chiang, Y.-J., and Tamassia, R. Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside a Simple Polygonal Obstacle. International Journal of Computational Geometry and Applications 7, 1-2 (1997), 85-121. [ pdf ]
Goodrich, M. T., and Tamassia, R. Dynamic Ray Shooting and Shortest Paths via Balanced Geodesic Triangulations. Journal of Algorithms 23 (1997), 51-73. [ pdf ]
Liotta, G., Tamassia, R., Tollis, I. G., and Vocca, P. Area Requirement of Gabriel Drawings. In Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC '97) (1997), Springer-Verlag, pp. 135-146.
Tamassia, R., Vismara, L., and Baker, J. E. A Case Study in Algorithm Engineering for Geometric Computing. In Proceedings of the Workshop on Algorithm Engineering (Sep 1997), pp. 136-145. [ pdf ]
Chiang, Y.-J., Preparata, F. P., and Tamassia, R. A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps. SIAM Journal on Computing 25, 1 (1996), 207-233. [ pdf ]
Tamassia, R., and Vitter, J. S. Optimal Cooperative Search in Fractional Cascaded Data Structures. Algorithmica 15, 2 (1996). [ pdf ]
Chiang, Y.-J., Goodrich, M. T., Grove, E. F., Tamassia, R., Vengroff, D. E., and Vitter, J. S. External-Memory Graph Algorithms. In Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms (1995), pp. 139-149.
Chiang, Y.-J., and Tamassia, R. Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles. In Proceedings of the 2nd Annual European Symposium on Algorithms (1994), Springer-Verlag, pp. 266-277.
Chiang, Y.-J., Preparata, F. P., and Tamassia, R. A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps. In Proceedings of the 4th ACM Society for Industrial and Applied Mathematics Symposium on Discrete Algorithms (1993), pp. 44-53. [ pdf ]
Chiang, Y.-J., and Tamassia, R. Dynamic algorithms in Computational Geometry. Proceedings of the IEEE 80, 9 (Sep 1992), 1412-1434.
Chiang, Y.-J., and Tamassia, R. Dynamization of the trapezoid method for planar point location in monotone subdivisions. International Journal of Computational Geometry and Applications 2, 3 (1992), 311-333.
Preparata, F. P., and Tamassia, R. Efficient point location in a convex spatial cell-complex. SIAM Journal on Computing 21 (1992), 267-280. [ pdf ]
Tamassia, R. A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. In Abstracts 8th European Workshop on Computational Geometry (1992), Utrecht University, p. 39. [ pdf ]
Chiang, Y.-J., and Tamassia, R. Dynamization of the trapezoid method for planar point location. In Proceedings of the 7th Annual ACM Symposium on Computational Geometry (1991), pp. 61-70.
Tamassia, R. An incremental reconstruction method for dynamic planar point location. Information Processing Letters 37 (1991), 79-83.
Tamassia, R., and Vitter, J. S. Parallel transitive closure and point location in planar structures. SIAM Journal on Computing 20, 4 (1991), 708-725. [ pdf ]
Preparata, F. P., and Tamassia, R. Dynamic planar point location with optimal query time. Theoretical Computer Science 74 (1990), 95-114.
Tamassia, R., and Vitter, J. S. Optimal Cooperative Search in Fractional Cascaded Data Structures. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (1990), pp. 307-316. [ pdf ]
Dehne, F., and Tamassia, R. Cutting polygons to achieve separability, with dynamization. In Abstracts 1st Canadian Conference on Computational Geometry (1989), p. 32.
Preparata, F. P., and Tamassia, R. Dynamic planar point location with optimal query time. In Proceedings on the 6th Symposium on Theoretical Aspects of Computer Science (1989), Springer-Verlag, pp. 84-95.
Preparata, F. P., and Tamassia, R. Efficient spatial point location. In Proceedings of the 1st Workshop on Algorithms and Data Structures (1989), Springer-Verlag, pp. 3-11.
Preparata, F. P., and Tamassia, R. Fully dynamic point location in a monotone subdivision. SIAM Journal on Computing 18, 4 (1989), 811-830. [ pdf ]
Tamassia, R., and Vitter, J. S. Optimal parallel algorithms for transitive closure and point location in planar structures. In Proceedings of the International Workshop on Discrete Algorithms and Complexity (Fukuoka, Japan, Nov 1989), Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo, pp. 169-178.
Preparata, F. P., and Tamassia, R. Fully dynamic techniques for point location and transitive closure in planar structures. In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (1988), pp. 558-567.
| Page Owner: Webmaster | Last Modified: Mon Oct 23 14:57:09 2006 |