Treaties such as the European Landscape Convention, are increasingly requiring an "objective " view of 'landscape quality' to determine where planning controls and special protections should apply. Although the technology exists to visualize landscapes for manual interpretation, planning processes remain dependent on cartographic views for the summarized information needed to objectively compare different sites. This paper presents a method for automatically analyzing data in perspective view, with an example application to 'landscape quality' assessment.
{"title":"Shadow of the Standford Bunny : Analysing Visual Models of Landscape Data Using Delaunay TIN","authors":"N. Sang, C. Gold, D. Miller","doi":"10.1109/ISVD.2007.35","DOIUrl":"https://doi.org/10.1109/ISVD.2007.35","url":null,"abstract":"Treaties such as the European Landscape Convention, are increasingly requiring an \"objective \" view of 'landscape quality' to determine where planning controls and special protections should apply. Although the technology exists to visualize landscapes for manual interpretation, planning processes remain dependent on cartographic views for the summarized information needed to objectively compare different sites. This paper presents a method for automatically analyzing data in perspective view, with an example application to 'landscape quality' assessment.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124974795","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}
Three strategies are presented for developing a knowledge-based statistical contact potential from computationally hydrated proteins that may be useful in studies of protein folding and stability. The potentials employ a definition of nearest neighbor contact based on Delaunay tessellation that identifies quadruplets of neighboring residues. The potentials are derived from a large set of proteins with explicit waters of hydration to improve the representation of the protein environment. The decoy discrimination ability of the three potentials as well as an unhydrated potential are evaluated and compared using four sets of publicly available protein decoy structures. The results suggest that the potentials can be used to infer the compatibility of a sequence of residues with a specific protein structure.
{"title":"Decoy Discrimination Using Contact Potentials Based on Delaunay Tessellation of Hydrated Proteins","authors":"G. M. Reck, I. Vaisman","doi":"10.1109/ISVD.2007.13","DOIUrl":"https://doi.org/10.1109/ISVD.2007.13","url":null,"abstract":"Three strategies are presented for developing a knowledge-based statistical contact potential from computationally hydrated proteins that may be useful in studies of protein folding and stability. The potentials employ a definition of nearest neighbor contact based on Delaunay tessellation that identifies quadruplets of neighboring residues. The potentials are derived from a large set of proteins with explicit waters of hydration to improve the representation of the protein environment. The decoy discrimination ability of the three potentials as well as an unhydrated potential are evaluated and compared using four sets of publicly available protein decoy structures. The results suggest that the potentials can be used to infer the compatibility of a sequence of residues with a specific protein structure.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124746346","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}
Joonghyun Ryu, Rhohun Park, Youngsong Cho, Jeongyeon Seo, Deok-Soo Kim
It has been generally accepted that the structure of molecule is one of the most important factors which determine the functions of a molecule. Hence, studies have been conducted to analyze the structure of a molecule. Molecular surface is an important example of molecular structure. Given a molecular surface, the area and volume of the molecule can be computed to facilitate problems such as protein docking and folding. Therefore, it is important to compute a molecular surface precisely and efficiently. This paper presents an algorithm for correctly and efficiently computing the blending surfaces of a protein which is an important part of the molecular surface. Assuming that the Voronoi diagram of atoms of a protein is given, we first compute the beta-shape of the protein corresponding to a solvent probe. Then, we use a search space reduction technique for the intersection tests while the link blending surface is computed. Once a beta-shape is obtained, the blending surfaces corresponding to a given solvent probe can be computed in O(n) in the worst case, where n is the number of atoms. The correctness and efficiency of the algorithm stem from the powerful properties of beta-shape, quasi-triangulation, and the interworld data structure.
{"title":"beta-shape Based Computation of Blending Surfaces on a Molecule","authors":"Joonghyun Ryu, Rhohun Park, Youngsong Cho, Jeongyeon Seo, Deok-Soo Kim","doi":"10.1109/ISVD.2007.1","DOIUrl":"https://doi.org/10.1109/ISVD.2007.1","url":null,"abstract":"It has been generally accepted that the structure of molecule is one of the most important factors which determine the functions of a molecule. Hence, studies have been conducted to analyze the structure of a molecule. Molecular surface is an important example of molecular structure. Given a molecular surface, the area and volume of the molecule can be computed to facilitate problems such as protein docking and folding. Therefore, it is important to compute a molecular surface precisely and efficiently. This paper presents an algorithm for correctly and efficiently computing the blending surfaces of a protein which is an important part of the molecular surface. Assuming that the Voronoi diagram of atoms of a protein is given, we first compute the beta-shape of the protein corresponding to a solvent probe. Then, we use a search space reduction technique for the intersection tests while the link blending surface is computed. Once a beta-shape is obtained, the blending surfaces corresponding to a given solvent probe can be computed in O(n) in the worst case, where n is the number of atoms. The correctness and efficiency of the algorithm stem from the powerful properties of beta-shape, quasi-triangulation, and the interworld data structure.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132820173","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 present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a possibly non-convex polyhedral surface in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) on a polyhedral surface with obstacles. To obtain the discrete Voronoi diagrams our algorithms, exploiting hardware graphics capabilities, compute shortest path distances defined by the sites.
{"title":"Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces","authors":"Marta Fort, J. A. Sellarès","doi":"10.1109/ISVD.2007.24","DOIUrl":"https://doi.org/10.1109/ISVD.2007.24","url":null,"abstract":"We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a possibly non-convex polyhedral surface in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) on a polyhedral surface with obstacles. To obtain the discrete Voronoi diagrams our algorithms, exploiting hardware graphics capabilities, compute shortest path distances defined by the sites.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128521611","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}
There has been considerable interest in the physical basis for the increased thermostability of thermophilic proteins with respect to their mesophilic counterparts since the discovery of highly heat tolerant organisms. We have systematically studied several large sets of protein structures in order to find those properties with the most power to discriminate mesophilic proteins from their thermophilic orthologs and then to classify proteins based on sequence and structural properties. Most of the structure-based descriptors used in our discrimination and classification experiments were derived from the Delaunay tessellations of the protein structures.
{"title":"Discrimination and Classification of Thermophilic and Mesophilic Proteins","authors":"T. Taylor, I. Vaisman","doi":"10.1109/ISVD.2007.18","DOIUrl":"https://doi.org/10.1109/ISVD.2007.18","url":null,"abstract":"There has been considerable interest in the physical basis for the increased thermostability of thermophilic proteins with respect to their mesophilic counterparts since the discovery of highly heat tolerant organisms. We have systematically studied several large sets of protein structures in order to find those properties with the most power to discriminate mesophilic proteins from their thermophilic orthologs and then to classify proteins based on sequence and structural properties. Most of the structure-based descriptors used in our discrimination and classification experiments were derived from the Delaunay tessellations of the protein structures.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129319486","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 this paper, we apply an additively weighted power diagram to divide a region such that the area of influence of public facilities is equalized in order to achieve equality. The weights of the power diagram were changed using Newton's method in order to divide the region into equal areas and obtain its weights and partitions such that the areas are equal.
{"title":"Division of a Region into Equal Areas Using Additively Weighted Power Diagrams","authors":"T. Ohyama","doi":"10.1109/ISVD.2007.20","DOIUrl":"https://doi.org/10.1109/ISVD.2007.20","url":null,"abstract":"In this paper, we apply an additively weighted power diagram to divide a region such that the area of influence of public facilities is equalized in order to achieve equality. The weights of the power diagram were changed using Newton's method in order to divide the region into equal areas and obtain its weights and partitions such that the areas are equal.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121300318","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}
Motivated by the work of Asano et al.[l], we consider the distance trisector problem and Zone diagram considering segments in the plane as the input geometric objects. As the most basic case, we first consider the pair of curves (distance trisector curves) trisecting the distance between a point and a line. This is a natural extension of the bisector curve (that is a parabola) of a point and a line. In this paper, we show that these trisector curves C1 and C2 exist and are unique. We then give a practical algorithm for computing the Zone diagram of a set of segments in a digital plane.
{"title":"Distance Trisector of Segments and Zone Diagram of Segments in a Plane","authors":"Jinhee Chun, Y. Okada, T. Tokuyama","doi":"10.1109/ISVD.2007.19","DOIUrl":"https://doi.org/10.1109/ISVD.2007.19","url":null,"abstract":"Motivated by the work of Asano et al.[l], we consider the distance trisector problem and Zone diagram considering segments in the plane as the input geometric objects. As the most basic case, we first consider the pair of curves (distance trisector curves) trisecting the distance between a point and a line. This is a natural extension of the bisector curve (that is a parabola) of a point and a line. In this paper, we show that these trisector curves C1 and C2 exist and are unique. We then give a practical algorithm for computing the Zone diagram of a set of segments in a digital plane.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114178542","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}
CGAL, the computational geometry algorithms library, is a C++ library of geometric algorithms and data structures which is developed in the framework of the CGAL open source project. This talk gives an overview on the various types of Voronoi diagrams which are in the CGAL library or under development.
{"title":"Voronoi Diagrams in CGAL, the Computational Geometry Algorithms Library","authors":"Andreas Fabri","doi":"10.1109/ISVD.2007.46","DOIUrl":"https://doi.org/10.1109/ISVD.2007.46","url":null,"abstract":"CGAL, the computational geometry algorithms library, is a C++ library of geometric algorithms and data structures which is developed in the framework of the CGAL open source project. This talk gives an overview on the various types of Voronoi diagrams which are in the CGAL library or under development.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122228390","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 this paper, we incorporate the concept of differentiability into Voronoi diagrams. We consider the influence area diagrams consisting of areas with differentiable boundaries. The diagram is called a curved Voronoi diagram. Any level of differentiability can be used in the definition of the curved Voronoi diagram depending on its applications. One of the applications is path planning for car-like robots in an area with obstacles. Carlike robots can easily drive along a path consisting of clothoid curve segments, circular arcs, and line segments. Therefore, we discuss a method for constructing a clothoid curve, circle, and line (CCL) diagram.
{"title":"Curved Voronoi Diagrams Consisting of Influence Areas with Differentiable Boundaries","authors":"Yusuke Matsumoto, K. Imai, Hisashi Suzuki","doi":"10.1109/ISVD.2007.12","DOIUrl":"https://doi.org/10.1109/ISVD.2007.12","url":null,"abstract":"In this paper, we incorporate the concept of differentiability into Voronoi diagrams. We consider the influence area diagrams consisting of areas with differentiable boundaries. The diagram is called a curved Voronoi diagram. Any level of differentiability can be used in the definition of the curved Voronoi diagram depending on its applications. One of the applications is path planning for car-like robots in an area with obstacles. Carlike robots can easily drive along a path consisting of clothoid curve segments, circular arcs, and line segments. Therefore, we discuss a method for constructing a clothoid curve, circle, and line (CCL) diagram.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114732230","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 this paper a new type of GIS system for maritime navigation safety is proposed. The system takes advantage of the properties of the kinetic Voronoi diagram (VD), and uses the "quad-edge" data structure for the maintenance of the spatial relationships of ships and other navigational objects. The locations of ships are updated in real-time using a standard onboard transponder, and moving-points VD algorithms. These spatial relationships are used for collision detection and avoidance. The system is aimed at tackling the main cause of marine accidents - human errors - by providing navigational aid and decision support to mariners. A brief introduction into static and kinematic Voronoi methods is given and is followed by a discussion of different types of GIS systems for marine purposes. The state-of-the-art in maritime safety and its major developments are also covered.
{"title":"Maintaining the Spatial Relationships of Marine Vessels Using the Kinetic Voronoi Diagram","authors":"Ignacy R. Goralski, C. Gold","doi":"10.1109/ISVD.2007.30","DOIUrl":"https://doi.org/10.1109/ISVD.2007.30","url":null,"abstract":"In this paper a new type of GIS system for maritime navigation safety is proposed. The system takes advantage of the properties of the kinetic Voronoi diagram (VD), and uses the \"quad-edge\" data structure for the maintenance of the spatial relationships of ships and other navigational objects. The locations of ships are updated in real-time using a standard onboard transponder, and moving-points VD algorithms. These spatial relationships are used for collision detection and avoidance. The system is aimed at tackling the main cause of marine accidents - human errors - by providing navigational aid and decision support to mariners. A brief introduction into static and kinematic Voronoi methods is given and is followed by a discussion of different types of GIS systems for marine purposes. The state-of-the-art in maritime safety and its major developments are also covered.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125106694","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
扫码关注我们
求助内容：
应助结果提醒方式：