Computing the optimal bridge between two convex polygons

Information Processing Letters

Volumn 69, Issue 3, 1999, Pages 127-130

  Cai, Leizhen ^a   Xu, Yinfeng ^d   Zhu, Binhai ^b,c  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c LAURENTIAN UNIVERSITY   (Canada)

^d NONE

Author keywords

Approximation; Computational geometry; Discrete optimization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING;

CARDINALITY;

COMPUTATIONAL GEOMETRY;

EID: 0033075662     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(99)00003-4     Document Type: Article

References (8)

1. F. Aurenhammer, Power diagrams: Properties, algorithms and applications, SIAM J. Comput. 16 (1) (1987) 78-96.
2. F. Aurenhammer, Voronoi diagrams: A survey of a fundamental geometric data structures, ACM Comput. Surveys 23 (3) (1991) 343-405.
3. F. Aurenhammer, H. Imai, Geometric relations among Voronoi diagrams, Geom. Dedicata 27 (1988) 65-75.
4. H. Edelsbrunner, L.J. Guibas, J. Stolfi, Optimal point location in a monotone subdivision, SIAM J. Comput. 15 (1986) 317-340.
5. Z.A. Melzak, On the problem of Steiner, Canad. Math. Bull. 4 (1961) 143-148.
6. F. Preparata, M. Shamos, Computational Geometry, Springer, Berlin, 1985.
7. M. Sarnak, R.E. Tarjan, Planar point location using persistent search trees, Comm. ACM 29 (1986) 669-679.
8. G. Toussaint, Computational Geometry, North-Holland, Amsterdam, 1985.