{"title":"基于约束的图美化","authors":"Sitt Sen Chok, K. Marriott, Tom Paton","doi":"10.1109/VL.1999.795870","DOIUrl":null,"url":null,"abstract":"Recently a new metaphor for diagramming, the intelligent diagram has emerged. This new metaphor provides an excellent basis for diagram beautification since it automatically collects geometric constraints which capture the semantics of a diagram during diagram construction. By applying visual-language-specific layout rules which impose additional desired constraints on the diagram component placement, we can provide powerful semantics preserving diagram beautification. We have demonstrated the feasibility of this approach by developing a simple extension to the Penguins system which generates beautification rules from a grammatical specification of the visual language and tested the system with three example visual languages: Binary trees, state transition diagrams and mathematical equations.","PeriodicalId":113128,"journal":{"name":"Proceedings 1999 IEEE Symposium on Visual Languages","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"Constraint-based diagram beautification\",\"authors\":\"Sitt Sen Chok, K. Marriott, Tom Paton\",\"doi\":\"10.1109/VL.1999.795870\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently a new metaphor for diagramming, the intelligent diagram has emerged. This new metaphor provides an excellent basis for diagram beautification since it automatically collects geometric constraints which capture the semantics of a diagram during diagram construction. By applying visual-language-specific layout rules which impose additional desired constraints on the diagram component placement, we can provide powerful semantics preserving diagram beautification. We have demonstrated the feasibility of this approach by developing a simple extension to the Penguins system which generates beautification rules from a grammatical specification of the visual language and tested the system with three example visual languages: Binary trees, state transition diagrams and mathematical equations.\",\"PeriodicalId\":113128,\"journal\":{\"name\":\"Proceedings 1999 IEEE Symposium on Visual Languages\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1999 IEEE Symposium on Visual Languages\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VL.1999.795870\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1999 IEEE Symposium on Visual Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VL.1999.795870","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Recently a new metaphor for diagramming, the intelligent diagram has emerged. This new metaphor provides an excellent basis for diagram beautification since it automatically collects geometric constraints which capture the semantics of a diagram during diagram construction. By applying visual-language-specific layout rules which impose additional desired constraints on the diagram component placement, we can provide powerful semantics preserving diagram beautification. We have demonstrated the feasibility of this approach by developing a simple extension to the Penguins system which generates beautification rules from a grammatical specification of the visual language and tested the system with three example visual languages: Binary trees, state transition diagrams and mathematical equations.