{"title":"Planar Tree Transformation through Flips","authors":"M. Kamrul Islam, S. Haque","doi":"10.1109/ICICT.2007.375332","DOIUrl":null,"url":null,"abstract":"A flip or edge-replacement is considered as a transformation by which one edge e of a geometric object is removed and an edge f (f ne e) is inserted such that the resulting object belongs to the same class as the original object. Here, we consider planar trees as geometric objects. In this paper, we present a technique for transforming a given planar tree into another one for a set S of n points in general position in the plane. We show that any planar tree can be transformed into another planar tree by at most 2n-k-s-2 (0(n)) flips (k > 0 and s > 0 are defined later) which is an improvement of the result in [3].","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Information and Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICT.2007.375332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
A flip or edge-replacement is considered as a transformation by which one edge e of a geometric object is removed and an edge f (f ne e) is inserted such that the resulting object belongs to the same class as the original object. Here, we consider planar trees as geometric objects. In this paper, we present a technique for transforming a given planar tree into another one for a set S of n points in general position in the plane. We show that any planar tree can be transformed into another planar tree by at most 2n-k-s-2 (0(n)) flips (k > 0 and s > 0 are defined later) which is an improvement of the result in [3].