Decomposing a simple polygon into simpler components is one of the basic tasks in computational geometry and its applications. The most important simple polygon decomposition is triangulation. Different techniques for triangulating a simple polygon were designed. The first part of the paper is an overview of triangulation algorithms based on diagonal insertion. In the second part, we present algorithms based on Delaunay triangulation. The basic ideas and approach for each algorithm are presented. Finally, some representative algorithms are compared by efficiency.
{"title":"An overview of triangulation algorithms for simple polygons","authors":"M. Lamot, B. Žalik","doi":"10.1109/IV.1999.781552","DOIUrl":"https://doi.org/10.1109/IV.1999.781552","url":null,"abstract":"Decomposing a simple polygon into simpler components is one of the basic tasks in computational geometry and its applications. The most important simple polygon decomposition is triangulation. Different techniques for triangulating a simple polygon were designed. The first part of the paper is an overview of triangulation algorithms based on diagonal insertion. In the second part, we present algorithms based on Delaunay triangulation. The basic ideas and approach for each algorithm are presented. Finally, some representative algorithms are compared by efficiency.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"21 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":"117114470","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 describes an investigation of the generation of surrealistic spaces that aim to achieve a new communications environment in which people can mutually convey their thoughts, mental images, and passions. Passion images here can be compared with conceptual images in the analogy of "logos versus pathos". Our focus was on the phenomenon of synesthesia, and the results shown are of the testing of color image creation involving "tanka" (i.e., 31-syllable Japanese poems), aiming at the generation of images where some passions are reflected rather than concrete scenes imagined from word meanings. In addition, the paper proposes an application that judges the similarity of pieces of music, showing the possibility of making instant, subjective judgements without the need for a performance.
{"title":"Generation of passion images from \"tanka\" poems based on the synesthesia phenomenon","authors":"T. Miyasato","doi":"10.1109/IV.1999.781605","DOIUrl":"https://doi.org/10.1109/IV.1999.781605","url":null,"abstract":"The paper describes an investigation of the generation of surrealistic spaces that aim to achieve a new communications environment in which people can mutually convey their thoughts, mental images, and passions. Passion images here can be compared with conceptual images in the analogy of \"logos versus pathos\". Our focus was on the phenomenon of synesthesia, and the results shown are of the testing of color image creation involving \"tanka\" (i.e., 31-syllable Japanese poems), aiming at the generation of images where some passions are reflected rather than concrete scenes imagined from word meanings. In addition, the paper proposes an application that judges the similarity of pieces of music, showing the possibility of making instant, subjective judgements without the need for a performance.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"2 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":"121867584","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 describes a new spline formulation that supports deformation of polygonal shapes into smooth spline surface models. Once a polygonal shape with underlying rectangular topology is specified by the user, it is deformed into a smooth surface that interpolates all the polygonal vertices. The user can then modify the default smooth surface by increasing or decreasing the amount of deformation, either globally or locally. This is accomplished by interactively controlling the shape parameters associated with the polygonal vertices. This modeling paradigm is conceptually simple, and allows C/sup 2/ continuous surfaces to be easily designed, even by a novice user.
{"title":"A method for deforming polygonal shapes into smooth spline surface models","authors":"Chiew-Lan Tai, K. Loe, B. Barsky, Y. Chan","doi":"10.1109/IV.1999.781574","DOIUrl":"https://doi.org/10.1109/IV.1999.781574","url":null,"abstract":"The paper describes a new spline formulation that supports deformation of polygonal shapes into smooth spline surface models. Once a polygonal shape with underlying rectangular topology is specified by the user, it is deformed into a smooth surface that interpolates all the polygonal vertices. The user can then modify the default smooth surface by increasing or decreasing the amount of deformation, either globally or locally. This is accomplished by interactively controlling the shape parameters associated with the polygonal vertices. This modeling paradigm is conceptually simple, and allows C/sup 2/ continuous surfaces to be easily designed, even by a novice user.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"27 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":"127059789","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}
To study the three-dimensional evolution of a CA model of a sandpile as a function of control parameters, a computational steering approach was used. Sandpile profiles are calculated in real time and displayed in three dimensions simultaneously with the evolution plots of state variables. This represents a generic problem of multiscale structure in data sets derived from nonlinear systems. The software modules were developed in OpenGL/sup TM/ and the Glut/sup TM/ library and will ultimately be implemented in semi-immersive VR on ImmersaDesk/sup TM/. To achieve sufficient speed in real time display, the full data set is represented graphically in a compact form.
{"title":"Visualization of multi-scale data sets in self-organized criticality sandpile model","authors":"B. Hnat, S. Chapman","doi":"10.1109/IV.1999.781598","DOIUrl":"https://doi.org/10.1109/IV.1999.781598","url":null,"abstract":"To study the three-dimensional evolution of a CA model of a sandpile as a function of control parameters, a computational steering approach was used. Sandpile profiles are calculated in real time and displayed in three dimensions simultaneously with the evolution plots of state variables. This represents a generic problem of multiscale structure in data sets derived from nonlinear systems. The software modules were developed in OpenGL/sup TM/ and the Glut/sup TM/ library and will ultimately be implemented in semi-immersive VR on ImmersaDesk/sup TM/. To achieve sufficient speed in real time display, the full data set is represented graphically in a compact form.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"10 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":"122272704","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}
It has been previously shown that the visual approach to the analysis of the behaviour of growth patterns can provide a viable solution to the understanding of the physical behaviour of the subject matter. Also, it has been demonstrated that the shape of the profile can be defined in terms of a number of characteristics some of which are general for all profiles and others are specific to individual circumstances. These characteristics, referred to as shape-parameters, are used for the analysis of the profile. Also, they are used for construction of the profile that the phenomenon is likely to assume. The method was validated by applying it to construction project expenditure pattern forecasting and further validation was undertaken by the use of statistical technique, namely, principal component analysis. In this paper, the mathematics of the model is represented whereby, for a given set of shape-parameters, the precise profile is mathematically generated. Due to its complex nature, the problem is decomposed into separate modules each satisfying a number of requirements. The modules operate independently but when combined, the overall boundary requirements are also satisfied.
{"title":"The mathematics of shape-geometry approach to the analysis of curve profile","authors":"F. Khosrowshahi","doi":"10.1109/IV.1999.781536","DOIUrl":"https://doi.org/10.1109/IV.1999.781536","url":null,"abstract":"It has been previously shown that the visual approach to the analysis of the behaviour of growth patterns can provide a viable solution to the understanding of the physical behaviour of the subject matter. Also, it has been demonstrated that the shape of the profile can be defined in terms of a number of characteristics some of which are general for all profiles and others are specific to individual circumstances. These characteristics, referred to as shape-parameters, are used for the analysis of the profile. Also, they are used for construction of the profile that the phenomenon is likely to assume. The method was validated by applying it to construction project expenditure pattern forecasting and further validation was undertaken by the use of statistical technique, namely, principal component analysis. In this paper, the mathematics of the model is represented whereby, for a given set of shape-parameters, the precise profile is mathematically generated. Due to its complex nature, the problem is decomposed into separate modules each satisfying a number of requirements. The modules operate independently but when combined, the overall boundary requirements are also satisfied.","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":"128217320","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}
E. Sandor, Janine Fron, Kristine Greiber, Fernando Orellana, Stephan Meyers, D. Plepys, Margaret Dolinsky, Mohammed Dastagir Ali
(art)/sup n/ Laboratory and the Electronic Visualization Laboratory (EVL) at the University of Illinois at Chicago have collaborated in the development of the first real time, stereoscopic hardcopy output of virtual reality applications-the ImmersaGram (IGram). The results of this new technology directly address a broad range of information visualization issues along a wide spectrum of disciplines from art, architecture, and science, to medicine, engineering and education.
{"title":"Collaborative visualization: new advances in documenting virtual reality with IGrams","authors":"E. Sandor, Janine Fron, Kristine Greiber, Fernando Orellana, Stephan Meyers, D. Plepys, Margaret Dolinsky, Mohammed Dastagir Ali","doi":"10.1109/IV.1999.781607","DOIUrl":"https://doi.org/10.1109/IV.1999.781607","url":null,"abstract":"(art)/sup n/ Laboratory and the Electronic Visualization Laboratory (EVL) at the University of Illinois at Chicago have collaborated in the development of the first real time, stereoscopic hardcopy output of virtual reality applications-the ImmersaGram (IGram). The results of this new technology directly address a broad range of information visualization issues along a wide spectrum of disciplines from art, architecture, and science, to medicine, engineering and education.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"46 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":"125673076","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 Reorderable Matrix is a simple visualization method for quantitative tabular data. The paper examines how first-time users interact with the Reorderable Matrix and how well they perform a simple task of finding correlating attributes. Visualizing a set of data is a common task in various activities such as decision making or opinion forming. Typical situations are a person making business related decisions, a doctor examining test results of a patient or an engineer making choices between different constructs. All these situations involve examining complex data interactions in a limited time. In this experiment the participants were interacting with the Reorderable Matrix for the first time and tried to find correlating attributes from an unfamiliar set of data.
{"title":"Interaction with the Reorderable Matrix","authors":"H. Siirtola","doi":"10.1109/IV.1999.781570","DOIUrl":"https://doi.org/10.1109/IV.1999.781570","url":null,"abstract":"The Reorderable Matrix is a simple visualization method for quantitative tabular data. The paper examines how first-time users interact with the Reorderable Matrix and how well they perform a simple task of finding correlating attributes. Visualizing a set of data is a common task in various activities such as decision making or opinion forming. Typical situations are a person making business related decisions, a doctor examining test results of a patient or an engineer making choices between different constructs. All these situations involve examining complex data interactions in a limited time. In this experiment the participants were interacting with the Reorderable Matrix for the first time and tried to find correlating attributes from an unfamiliar set of data.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"10 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":"129204429","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}
Within the Visualization project of the Austrian Joint Research Initiative (JRI) Numerical Simulation in Tunnelling (SiTu), the Tunnelling Visualization System (TVS) is being developed, to display information in tunnelling. The aim of the Project is to implement a user friendly visualization system, where the data can be displayed in a way that tunnelling engineers can understand. Virtual reality techniques are new in tunnelling and offer a lot of new possibilities. 3D scalar fields are visualised in a novel way. The data to be visualised are either results from numerical simulation or ones describing geological features. Such data have special properties, which have to be considered by the visualization system. The paper presents innovative techniques for this purpose.
{"title":"Visualization in tunnelling-new developments","authors":"Gernot Opriessnig, G. Beer","doi":"10.1109/IV.1999.781596","DOIUrl":"https://doi.org/10.1109/IV.1999.781596","url":null,"abstract":"Within the Visualization project of the Austrian Joint Research Initiative (JRI) Numerical Simulation in Tunnelling (SiTu), the Tunnelling Visualization System (TVS) is being developed, to display information in tunnelling. The aim of the Project is to implement a user friendly visualization system, where the data can be displayed in a way that tunnelling engineers can understand. Virtual reality techniques are new in tunnelling and offer a lot of new possibilities. 3D scalar fields are visualised in a novel way. The data to be visualised are either results from numerical simulation or ones describing geological features. Such data have special properties, which have to be considered by the visualization system. The paper presents innovative techniques for this purpose.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"70 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":"133921281","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 appraises the role of Virtual Reality Modelling Language (VRML) based 3D computer based urban and heritage models in assisting professional collaboration on common tasks and engaging the participation of the general public in decision making. The University of the West of England (UWE) have created such models of both a significant area of central Bristol and for the Tower of London. The model and associated information can be interactively viewed through low cost WWW browsers and updated online. The model is held to be a useful analogue for linking available information in more accessible form. Use of an underlying geographic information system (GIS) allows other information to be readily associated with elements within the models. The costs of creation and ownership of traditional and digital models are compared with those of GIS generated models. Developments are discussed to improve and ease collaborative creation and use of such models.
{"title":"Usability of associated GIS and VRML urban models","authors":"N. Bates-Brkljac, J. Counsell","doi":"10.1109/IV.1999.781611","DOIUrl":"https://doi.org/10.1109/IV.1999.781611","url":null,"abstract":"The paper appraises the role of Virtual Reality Modelling Language (VRML) based 3D computer based urban and heritage models in assisting professional collaboration on common tasks and engaging the participation of the general public in decision making. The University of the West of England (UWE) have created such models of both a significant area of central Bristol and for the Tower of London. The model and associated information can be interactively viewed through low cost WWW browsers and updated online. The model is held to be a useful analogue for linking available information in more accessible form. Use of an underlying geographic information system (GIS) allows other information to be readily associated with elements within the models. The costs of creation and ownership of traditional and digital models are compared with those of GIS generated models. Developments are discussed to improve and ease collaborative creation and use of such models.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"29 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":"131146821","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}
Delaunay triangulation is well known for its use in geometric design. A derived version of this structure, the Delaunay constrained triangulation, takes into account the triangular mesh problem in presence of rectilinear constraints. The Delaunay constrained triangulation is very useful for CAD, topography and mapping and in finite element analysis. This technique is still developing. We present a taxonomy of this geometric structure. First we describe the different tools used to introduce the problem. Then we introduce the different approaches highlighting various points of view of the problem. We focus on the Delaunay stable methods. A Delaunay stable method preserves the Delaunay nature of the constrained triangulation. Each method is detailed by its algorithms, performances, and properties. For instance we show how these methods approximate the generalised Voronoi diagram of the configuration. The Delaunay stable algorithms are used for 2.5D DEM design. The aim of this work is to demonstrate that the use of topographic constraints in a regular DEM without adding new points preserves the terrain shape. So the resulting DEM can be more easily interpreted because its realism is preserved and the mesh still owns all the Delaunay triangulation properties.
{"title":"The Delaunay constrained triangulation: the Delaunay stable algorithms","authors":"L. Rognant, J. Chassery, S. Goze, J. Planès","doi":"10.1109/IV.1999.781551","DOIUrl":"https://doi.org/10.1109/IV.1999.781551","url":null,"abstract":"Delaunay triangulation is well known for its use in geometric design. A derived version of this structure, the Delaunay constrained triangulation, takes into account the triangular mesh problem in presence of rectilinear constraints. The Delaunay constrained triangulation is very useful for CAD, topography and mapping and in finite element analysis. This technique is still developing. We present a taxonomy of this geometric structure. First we describe the different tools used to introduce the problem. Then we introduce the different approaches highlighting various points of view of the problem. We focus on the Delaunay stable methods. A Delaunay stable method preserves the Delaunay nature of the constrained triangulation. Each method is detailed by its algorithms, performances, and properties. For instance we show how these methods approximate the generalised Voronoi diagram of the configuration. The Delaunay stable algorithms are used for 2.5D DEM design. The aim of this work is to demonstrate that the use of topographic constraints in a regular DEM without adding new points preserves the terrain shape. So the resulting DEM can be more easily interpreted because its realism is preserved and the mesh still owns all the Delaunay triangulation properties.","PeriodicalId":340240,"journal":{"name":"1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)","volume":"4 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":"124887438","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
扫码关注我们
求助内容：
应助结果提醒方式：