Computer aided design now aims to provide designers with a support during the early stages of design. The purpose is to translate the client's specifications into a shape as automatically as possible. However, the processing of a text in natural language is still out of reach. We then assume that the client's specifications are manually translated into intermediate specifications composed of intermediate constraints upon physical parameters. Our efforts concern the transformation of these intermediate specifications into a shape, precisely the way to complete whether a shape satisfies the intermediate specifications or not. We first study the case in which the shape is a single primitive solid; we also give elements to choose the instance that best fits the specifications. Then, we study the extension of the method to solids defined by a combination of primitive solids.
{"title":"On shape to specifications adequacy","authors":"Y. Gardan, C. Minich, Denis Pallez","doi":"10.1109/IV.1999.781576","DOIUrl":"https://doi.org/10.1109/IV.1999.781576","url":null,"abstract":"Computer aided design now aims to provide designers with a support during the early stages of design. The purpose is to translate the client's specifications into a shape as automatically as possible. However, the processing of a text in natural language is still out of reach. We then assume that the client's specifications are manually translated into intermediate specifications composed of intermediate constraints upon physical parameters. Our efforts concern the transformation of these intermediate specifications into a shape, precisely the way to complete whether a shape satisfies the intermediate specifications or not. We first study the case in which the shape is a single primitive solid; we also give elements to choose the instance that best fits the specifications. Then, we study the extension of the method to solids defined by a combination of primitive solids.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129114895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the advent of global competition, greater numbers of organisations require collaborations with others. Concurrent engineering can provide a highly effective framework for this collaboration. A distributed object oriented concurrent engineering system (DISCS) focuses on the communication of data between the members of a distributed project team. Conceptually the communication is the enabling factor; technologically the use of the WWW and object oriented technologies. A portfolio of collaboration support tools facilitates practical mechanisms for information sharing within the distributed enterprise, communication/conferencing for project teams, configuration/version control and workflow structures. DISCS effectively facilitates the virtual team, currently within an engineering context.
{"title":"Distributed Information Sharing for Collaborative Systems (DISCS)","authors":"H. Anderson, H. S. Abdalla","doi":"10.1109/IV.1999.781599","DOIUrl":"https://doi.org/10.1109/IV.1999.781599","url":null,"abstract":"With the advent of global competition, greater numbers of organisations require collaborations with others. Concurrent engineering can provide a highly effective framework for this collaboration. A distributed object oriented concurrent engineering system (DISCS) focuses on the communication of data between the members of a distributed project team. Conceptually the communication is the enabling factor; technologically the use of the WWW and object oriented technologies. A portfolio of collaboration support tools facilitates practical mechanisms for information sharing within the distributed enterprise, communication/conferencing for project teams, configuration/version control and workflow structures. DISCS effectively facilitates the virtual team, currently within an engineering context.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126495125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Modern GIS (geographic information system) application programs and simulation systems have to handle large datasets for rendering. Currently, three dimensional rendering hardware are facing a memory bus bandwidth bottleneck problem at the graphics pipeline. One general solution for this problem is to compress the static three dimensional geometry in a preprocessing phase. We present a new mesh compression/decompression algorithm for this application. Our compression algorithm breaks down a triangle mesh into a set of triangle strips and vertex chains. After decomposition, we encode vertex connectivity with entropy encoding. Our algorithm provides a 32% improvement in the compression ratio over existing "Generalized Triangle Mesh (GTM)" compression and supports parallel decompression. We also proposed a parallelogram prediction method for vertex coordinate compression.
{"title":"Triangle mesh compression for fast rendering","authors":"Dong-Gyu Park, Yang-Soo Kim, Hwan-Gue Cho","doi":"10.1109/IV.1999.781571","DOIUrl":"https://doi.org/10.1109/IV.1999.781571","url":null,"abstract":"Modern GIS (geographic information system) application programs and simulation systems have to handle large datasets for rendering. Currently, three dimensional rendering hardware are facing a memory bus bandwidth bottleneck problem at the graphics pipeline. One general solution for this problem is to compress the static three dimensional geometry in a preprocessing phase. We present a new mesh compression/decompression algorithm for this application. Our compression algorithm breaks down a triangle mesh into a set of triangle strips and vertex chains. After decomposition, we encode vertex connectivity with entropy encoding. Our algorithm provides a 32% improvement in the compression ratio over existing \"Generalized Triangle Mesh (GTM)\" compression and supports parallel decompression. We also proposed a parallelogram prediction method for vertex coordinate compression.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115737838","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In recent years, geographic information systems and spatial database technology are fast spreading across the tight circles of experts, working in the fields of geography and geodesy. In the first wave, GIS functions have been built into engineering applications, which were not just GIS centered (as for example road design, emission calculation, building site-plan etc.). The use has been accelerated through the component technology, which simplifies the insertion of GIS components into a variety of applications-including administration. We describe the upgrading of the business information system of the Slovenian road administration: basic application user interfaces were enriched with a specialized GIS component, which enables a fast and clear (geo)graphical view of the data about the selected part of the road network. The simplicity of using this intelligent digital map (as we named this specialized component) makes it possible to effectively and clearly display the relevant information, which is so necessary in the process of decision making. Besides, there is no need to leave the application the user is familiar with.
{"title":"Enhancement of decision support process in road administration domain with the use of GIS technology","authors":"Nenad Čuš-Babič, D. Rebolj, C. Gregorc","doi":"10.1109/IV.1999.781553","DOIUrl":"https://doi.org/10.1109/IV.1999.781553","url":null,"abstract":"In recent years, geographic information systems and spatial database technology are fast spreading across the tight circles of experts, working in the fields of geography and geodesy. In the first wave, GIS functions have been built into engineering applications, which were not just GIS centered (as for example road design, emission calculation, building site-plan etc.). The use has been accelerated through the component technology, which simplifies the insertion of GIS components into a variety of applications-including administration. We describe the upgrading of the business information system of the Slovenian road administration: basic application user interfaces were enriched with a specialized GIS component, which enables a fast and clear (geo)graphical view of the data about the selected part of the road network. The simplicity of using this intelligent digital map (as we named this specialized component) makes it possible to effectively and clearly display the relevant information, which is so necessary in the process of decision making. Besides, there is no need to leave the application the user is familiar with.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132474765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Formulas for representing the signed area of sectors between Bezier and B-spline curve segments and the origin are presented. The area is expressed by using the coordinates of the control points and coefficients calculated with the basis functions of the spline curves. Area-preserving deformations of the spline curves by moving the control points are also investigated.
{"title":"Signed area of sectors between spline curves and the origin","authors":"Kanji Ueda","doi":"10.1109/IV.1999.781575","DOIUrl":"https://doi.org/10.1109/IV.1999.781575","url":null,"abstract":"Formulas for representing the signed area of sectors between Bezier and B-spline curve segments and the origin are presented. The area is expressed by using the coordinates of the control points and coefficients calculated with the basis functions of the spline curves. Area-preserving deformations of the spline curves by moving the control points are also investigated.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130956451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The paper argues that whilst hypermedia systems potentially have a major role to play in education, there is the danger that they tend to engender cognitive and navigational overhead in their users, which in turn detracts from their educational value. A potentially valuable means of ameliorating this difficulty is to use metaphors to aid the user as they interact with the system. The value of metaphors in overcoming the problems of cognitive overloading and navigational overhead is discussed and an experimental study proposed to investigate the design and deployment of suitable metaphors in this context.
{"title":"Visual metaphors to enhance hypermedia","authors":"Senaka Perera, D. Hobbs, D. Moore","doi":"10.1109/IV.1999.781600","DOIUrl":"https://doi.org/10.1109/IV.1999.781600","url":null,"abstract":"The paper argues that whilst hypermedia systems potentially have a major role to play in education, there is the danger that they tend to engender cognitive and navigational overhead in their users, which in turn detracts from their educational value. A potentially valuable means of ameliorating this difficulty is to use metaphors to aid the user as they interact with the system. The value of metaphors in overcoming the problems of cognitive overloading and navigational overhead is discussed and an experimental study proposed to investigate the design and deployment of suitable metaphors in this context.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130914052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Authoring tool /sup /spl pi//J (piJ) is based on original results in the areas of visual languages and programming technology. It is developed in 2 main versions: (a) a tool to program in Java (as stay-alone tool, as add-on for MS FrontPage, and as a component of our MetaCalc environment); (b) add-on for MS FrontPage to develop fragments in JavaScript. The software supports chart versions of Java and JavaScript in V. Prokhorov's (1992) structured /spl pi/-chart, flow-chart, and Nessie-Shneidermann structure grams. /sup /spl pi//J includes tools to convert a plain Java text to chart and back. The tool allows the user to change textual representation of any structured part of a program to a graphic one and back. The tool realizes technology of extension/cutting of the user language and technology of linking with external languages. A version of a tool supports programming of microprocessor Z8 in visual assembler. The tool can be used in software design, education, Web design, supercomputing, and other areas.
{"title":"Environment piJ for visual programming in Java","authors":"V. V. Prokhorov, V. A. Kosarev","doi":"10.1109/IV.1999.781609","DOIUrl":"https://doi.org/10.1109/IV.1999.781609","url":null,"abstract":"Authoring tool /sup /spl pi//J (piJ) is based on original results in the areas of visual languages and programming technology. It is developed in 2 main versions: (a) a tool to program in Java (as stay-alone tool, as add-on for MS FrontPage, and as a component of our MetaCalc environment); (b) add-on for MS FrontPage to develop fragments in JavaScript. The software supports chart versions of Java and JavaScript in V. Prokhorov's (1992) structured /spl pi/-chart, flow-chart, and Nessie-Shneidermann structure grams. /sup /spl pi//J includes tools to convert a plain Java text to chart and back. The tool allows the user to change textual representation of any structured part of a program to a graphic one and back. The tool realizes technology of extension/cutting of the user language and technology of linking with external languages. A version of a tool supports programming of microprocessor Z8 in visual assembler. The tool can be used in software design, education, Web design, supercomputing, and other areas.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"16 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126534288","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents a 3D graphics rendering algorithm for photorealistic ray tracing operating over a network of personal computers. The implementation incorporates partitioning methodologies for both memory and workload to achieve efficient execution on a distributed personal computer, PC, network. Experimental results that compare algorithm efficiency in dual processor machines and TCP/IP networks with respect to execution on a single processor are discussed.
{"title":"3D ray-tracing on PC networks using TCP/IP","authors":"T. D. Scott, V. Fusco, R. S. Ferguson","doi":"10.1109/IV.1999.781542","DOIUrl":"https://doi.org/10.1109/IV.1999.781542","url":null,"abstract":"This paper presents a 3D graphics rendering algorithm for photorealistic ray tracing operating over a network of personal computers. The implementation incorporates partitioning methodologies for both memory and workload to achieve efficient execution on a distributed personal computer, PC, network. Experimental results that compare algorithm efficiency in dual processor machines and TCP/IP networks with respect to execution on a single processor are discussed.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121582963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the third act of Shakespeare's Hamlet, the hero is unsure whether to kill Claudius-the assassin of Hamlet's father-or not. He argues that if he does kill him, Claudius who is praying at that very moment goes to heaven and if he does not kill him Hamlet's father is not revenged. A contradiction. Ultima Ratio aims at formalization and visualization of argumentation for agents. An agent is constituted by a set of arguments and assumptions. Facing a particular world, the agent's believes may be inconsistent triggering a rational monologue to deal with the situation. Formally, we define a framework for argumentation based on extended logic programming under well-founded semantics. The system serves as decision support and is capable of detecting and removing contradictions and deriving conclusions of the agent's arguments. To demonstrate the structure and dynamics of the agent's argumentation, we visualise the process as dynamic construction of proof trees. The paper includes screenshots of the logical engine and the visualisation unit as exhibited at the computer arts exhibition Ars Electronica 98.
{"title":"Ultima Ratio-a visual language for argumentation","authors":"Michael Schroeder, D. Plewe, A. Raab","doi":"10.1109/IV.1999.781604","DOIUrl":"https://doi.org/10.1109/IV.1999.781604","url":null,"abstract":"In the third act of Shakespeare's Hamlet, the hero is unsure whether to kill Claudius-the assassin of Hamlet's father-or not. He argues that if he does kill him, Claudius who is praying at that very moment goes to heaven and if he does not kill him Hamlet's father is not revenged. A contradiction. Ultima Ratio aims at formalization and visualization of argumentation for agents. An agent is constituted by a set of arguments and assumptions. Facing a particular world, the agent's believes may be inconsistent triggering a rational monologue to deal with the situation. Formally, we define a framework for argumentation based on extended logic programming under well-founded semantics. The system serves as decision support and is capable of detecting and removing contradictions and deriving conclusions of the agent's arguments. To demonstrate the structure and dynamics of the agent's argumentation, we visualise the process as dynamic construction of proof trees. The paper includes screenshots of the logical engine and the visualisation unit as exhibited at the computer arts exhibition Ars Electronica 98.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115367333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We have designed and are implementing a system called ReV (Real estate Visualiser) for exploring real estate property listings on the World-Wide Web. Given the large number of different Web sites providing listings, each with its own presentation format, and the high dimensionality of the property space itself, it is difficult to obtain a comprehensive single view of property data on the Web. ReV addresses this problem by using grammar induction techniques to automatically learn to parse pages from new Web sites and collate all of their listings together. It them visualizes this listing data using a map based color coding technique. This work draws together a number of strands from the fields of information visualization, machine learning, and database integration. We also hypothesize that ReV will be adaptable to inducing structures from other types of Web data.
{"title":"Visualizing real estate property information on the Web","authors":"Theodore W. Hong","doi":"10.1109/IV.1999.781556","DOIUrl":"https://doi.org/10.1109/IV.1999.781556","url":null,"abstract":"We have designed and are implementing a system called ReV (Real estate Visualiser) for exploring real estate property listings on the World-Wide Web. Given the large number of different Web sites providing listings, each with its own presentation format, and the high dimensionality of the property space itself, it is difficult to obtain a comprehensive single view of property data on the Web. ReV addresses this problem by using grammar induction techniques to automatically learn to parse pages from new Web sites and collate all of their listings together. It them visualizes this listing data using a map based color coding technique. This work draws together a number of strands from the fields of information visualization, machine learning, and database integration. We also hypothesize that ReV will be adaptable to inducing structures from other types of Web data.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115569500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：