Abstract
The following result is established. LetP be a rectilinear polygon whose all holes are rectangles. If there are no maximal cut segments ofP whose end-points lie on the boundary of different holes thenP isL 1-embeddable.
Similar content being viewed by others
References
ASSOUAD P. and DEZA M., Espaces métriques plongeables dans un hypercube: aspects combinatoires,Annals of Discrete Mathematics 8 (1980) 197–210.
AVIS D. and DEZA M., The cut cone,L 1-embeddability, complexity and multicommodity flows,Networks 21 (1991) 595–617.
BRETAGNOLLE J., DACUNA CASTELLE D. and KRIVINE J.-L., Lois stables et espaces LP,Annales de l'Institut Henri Poincaré 2(3) (1966) 231–259.
DEZA M. and LAURENT M.,l 1-Rigid graphs,J. Algebraic Combinatorics 3 (1994) 153–175.
DEZA M. and LAURENT M., Applications of cut polyhedra,Rapport LIENS-92-18, Ecole Normale Supérieure (Paris) 1992 to appear inJ. Comp. Appl. Math.
DJOKOVIC D.J., Distance-preserving subgraphs of hypercubes,J. Combin. Theory B14 (1973) 263–267.
de REZENDE P.J., LEE D.T. and WU Y.F., Rectilinear shortest paths in the presence of rectangular barriers,Discrete Comput. Geom. 4 (1989) 41–53.
VERHEUL E.R., Multimedians in metric and normed spacesPh. D. Thesis, Free University, Amsterdam, 1991.
van de VEL M.,Theory of Convex Structures.Elsevier Science Publications, Amsterdam, 1993.
Author information
Authors and Affiliations
Additional information
Supported by the Alexander von Humboldt Stiftung
Rights and permissions
About this article
Cite this article
Chepoi, V., Patlatîi, V. & Prisăcaru, C. L1-embeddability of rectilinear polygons with holes. J Geom 56, 18–24 (1996). https://doi.org/10.1007/BF01222679
Issue Date:
DOI: https://doi.org/10.1007/BF01222679