An optimal algorithm for the rectilinear link center of a rectilinear polygon

Computational Geometry: Theory and Applications

Volumn 6, Issue 3, 1996, Pages 169-194

  Nilsson, Bengt J ^a   Schuierer, Sven ^b  

^a LUND UNIVERSITY   (Sweden)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30244495643     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00026-7     Document Type: Article

References (10)

1. G. Das and G. Narasimhan, Geometric searching and link distance, in: Proc. 2nd Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 519 (Springer, Berlin, 1991) 261-272.
2. M. de Berg, On rectilinear link distance, Computational Geometry: Theory and Applications 1(1) (1991) 13-34.
3. H.N. Djidjev, A. Lingas and J.-R. Sack, An O(n log n) algorithm for computing the link center of a simple polygon, Discrete and Computational Geometry 8 (1992) 131-152.
4. A. Ferreira and J. Peters, Finding smallest paths in rectilinear polygons on a hypercube multiprocessor, in: T. Shermer, ed., Proc. 3rd Canadian Conference on Computational Geometry (1991) 162-165.
5. Y. Ke, An efficient algorithm for link-distance problems, in: Proc. 5th ACM Symposium on Computational Geometry (1989) 69-78.
6. W. Lenhart, R. Pollack, J.-R. Sack, R. Seidel, M. Sharir, S. Suri, G. Toussaint, S. Whitesides and C. Yap, Computing the link center of a simple polygon, Discrete and Computational Geometry 3 (1988) 281-293.
7. A. Lingas, A. Maheshwari and J.-R. Sack, Parallel algorithms for rectilinear link distance problems, in: Proc. 7th IEEE International Parallel Processing Symposium (1993), to appear in Algorithmica.
8. K. McDonalds and J. Peters, Smallest paths in simple rectilinear polygons, IEEE Transactions on Computer Aided Design 11 (1992) 864-875.
9. B.J. Nilsson and S. Schuierer, Computing the rectilinear link diameter of a polygon, in: Computational Geometry - Methods, Algorithms, and Applications, Lecture Notes in Computer Science 553 (Springer, Berlin, 1991) 203-215.
10. S. Suri, Minimum link paths in polygons and related problems, Ph.D. thesis, Johns Hopkins University (1987).