Onion polygonizations

Information Processing Letters

Volumn 57, Issue 3, 1996, Pages 165-173

  Abellanas, Manuel ^a   García, Jesús ^b   Hernández Peñalver, Gregorio ^a   Hurtado, Ferrán ^c   Serra, Oriol ^c   Urrutia, Jorge ^d  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^b UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^d UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Combinatorial optimization; Computational geometry; Depth sequences; Polygonizations

Indexed keywords

EID: 30244435662     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(95)00193-X     Document Type: Article

References (11)

1. A.M. Ajtai, V. Chvátal, M. Newborn and E. Szemeredi, Crossing-free subgraphs, Ann. of Discrete Math. 12 (1981) 9-12.
2. B. Chazelle, On the convex layers of a planar set, IEEE Trans. Inform. Theory 31 (1985) 509-517.
3. L. Deneen and G. Shute, Polygonizations of point sets in the plane, Discrete Comput. Geom. 3 (1988) 77-87.
4. R.B. Hayward, A lower bound for the optimal crossing free Hamiltonian cycle problem, Discrete Comput. Geom. 2 (1987) 327-343.
5. P.J. Huber, Robust statistics: A review, Ann. Math. Statist. 43 (1972) 1041-1067.
6. H. Meijer and D. Rappaport, Upper and lower bounds for the number of monotone crossing free Hamiltonian cycles from a set of points, Ars Combin. 30 (1990) 203-208.
7. n, J. Combin. Theory Ser. B 29 (1980) 13-26.
8. J. O'Rourke, H. Booth and R. Washington, Connect the dots: A new heuristic, Computer Vision, Graphics and Image Processing 39 (1987) 258-266.
9. F. Preparata and M.I. Shamos, Computational Geometry: An Introduction (Springer, Berlin, 1988).
10. G.T. Toussaint, ed., Computational Morphology (North-Holland, Amsterdam, 1988).
11. G.T. Toussaint, New results in computational geometry relevant to pattern recognition in practice, in: E.S. Gelsema and L.N. Kanal, eds., Pattern Recognition in Practice, Vol. II (Elsevier, Amsterdam, 1986).