CONSISTENT LINE SIMPLIFICATION BASED ON CONSTRAINT POINTS
|
|
- Melinda Arlene Warren
- 6 years ago
- Views:
Transcription
1 CONSISTENT LINE SIMPLIFICATION BASED ON CONSTRAINT POINTS Shen Ying, Lin Li and Yuanyu Zhang School of Resource and Environment Science, Wuhan University, China, ABSTRACT Line generalization, one of the most important fields of the cartographic generalization, still has a robust life with many years development. That has two reasons: one is the importance of polylines in map representation, the other is the imperfectability and immaturity of the theory of cartographic generalization. Making a comprehensive view of the past algorithms and papers, we find that almost all of them are inclusively concerned with polyline s geometric characters, and care little about cartographic contexture which map features deal with. But the constraints and the operations play an important role in line simplification. They guide and govern map generalization. Topological consistency is a primary criterion of the estimation of cartographic generalization, especially in structural cartographic generalization based on geographic environment. During line simplification we should keep spatial relations consistent according to the geographic characters adjacent to linear features. This paper develops some algorithms to simplify polylines consistently based on the constraint points, whether they are on lines or not. Keywords: map Generalization; line simplification; Binary-Line-Generalization Tree; Constraint Point INTRODUCTION Line simplification plays an important role in cartographic generalization because most map features are represented by polylines and polygons composed of polylines. Line simplification, known as a method of reducing the polyline details, not only make map more legible and clearly but improves efficiency and visualization of cartography. With several decades development, there are several approaches in polyline simplification such as Douglas-Peucker (DP) algorithm (Douglas D H, Peucker T K., 1973), Reumann-Witkam algorithm (1974), Strip-tree (Buttenfield B P. 1986; 1989;1991) and BLG-tree (Peter van Oosterom, Vincent Schenkelaars, 1995; Zhan F, Mark D M., 1993; Saalfeld A., 1999; Cromley, R. G.,1991;1992). We can come to one point according to these algorithms that they are all based on the simplification of feature individuals. They simplify the polylines simply through selection of geometric characteristic points on polylines of each map individual object. However, geographic structural/context characteristics is another crucial factor in cartographic generalization and the research about simplification based on them, especially on the spatial structural characteristic constraints, becomes a hotspot and more and more popular. There are two kinds of characteristic constraint points: natural characteristic points and cultural characteristic points. The natural characteristic points are mainly defined as the characteristic points of landform and geometry like inflexions of landform, geometric inflexions and extreme value points, while the cultural characteristic points are characteristic points formed by human beings during the process of conquest and reconstruction of nature varying from cities, residences to bridges, boundary positions and so on. Of course, many polygon features have been abstracted into points in the foregoing simplification. We always assume there are no self-intersection and topological conflicts to shy away these problems, let the solution methods be alone. Actually these happens Because of improper geometric threshold, non-synchronous simplification or ignorance of spatial structural characteristics, which all influence data accuracy and the efficiency of spatial database Let us begin by illustrating some things that can go wrong with simplification algorithm. For example, Figure 1 below is a simplified North European map from which we can see many topological character or sidedness of some points altered as a result of DP algorithm: the land Canterbry lies in the sea, Maastricht has been changed its national boundary and there also exists self-intersection in the simplified map which is opposite to the true situation of the original map. The reasons for these inaccurate results are the polyline simplification algorithm has not taken the spatial relation of polyline and cultural characteristic constraint points into account, which changed the positions of map objects essentially. Proceedings of the 21 st International Cartographic Conference (ICC) Durban, South Africa, August 2003 Cartographic Renaissance Hosted by The International Cartographic Association (ICA) ISBN: Produced by: Document Transformation Technologies
2 Figure 1. Inconsistent Simplification Using DP Algorithm (Mark de Berg, et al, 1998) The paper applies DP algorithm and BLG-tree which are commonplace in map generalization integrated with relationships among points, polylines and polygons to carry out consistent line simplification with constraint points. The methods in this paper have small complexity of computation and practicability. The paper is organized as follows. Section 2 analyzes the theory and relation between geographic context characteristics and geometric graph; section 3 develops three methods to solve consistent line simplification in illusion to characteristic points on polylines and section 4 aim at constraint points out of polylines; section 5 gives an example and some concluding remarks. 2. ANALYSIS In the course of spatial analysis and decision-making process, geographic spatial contextual characteristics are often in a higher level while geometric ones in a lower level, between which the relationship is similar to that of decision-making level and implemental level. The objects of Cartographic generalization are geographic structural characteristics objects not geometric detail characteristics of specific features, and the aim of generalization is to make decisions to stand out the main characteristics of geographic environment on the basis of structural analysis of geographic context. While the implementation of map generalization is carried out by a series of geometric operators and the geometric graphs express and present the process and result of map generalization. These form the mutual conditional and restricted relationship between geographic spatial characteristics and geometric characteristics. The relationships among spatial objects, as the primary method to describe the geographic characteristics, can be interpret as integrity constraints of spatial database; topological relations, as the essential representation of spatial relationships, can be considered as primary factor in map generalization. Above all, during line simplification based on geographic structural characteristics, the paper focuses on characteristic constraint points, topological relation is in the first status and geometric precise second. Actually in most cases, the precise of characteristics constraints is more important than that of polylines because of for their locational, cultural and military significances. Hence, no replacement among constraint points is constantly required in the following analysis. Generally speaking, generalized polylines after line simplification should have less internal nodes, geometric simplification conditions satisfied and no self-intersection. Considering restrict conditions of constraint points, the relations between points in the plane and polylines should keep consistent both before and after simplification. That is to say we shouldn t change the structure of characteristic points distribution in the plane with line simplification. So, if line simplification has no self-intersection, satisfy geometric threshold and maintain topological relationship, we can define it as consistent line simplification. Many researches have be studied in the field of consistent polyline simplification: research of intersection and selfintersection in contour generalization (SHEN Ying, 2001), comparisons among the relations of points, lines and polygons (Qingsheng Guo, 1993), a cognitive study about constraint conflicts of simplification (Zhan F, Mark, 1993), topologically correct subdivision simplification using the bandwidth criterion (Mark de Berg et al., 1998), consistent line simplification with the Douglas-Peucker Algorithm(Saalfeld A, 1999) and about frameworks for generalization constraints and operations based on object-oriented data structure in database generalization(yaolin Liu, et al.,2001). 3. CONSISTENT SIMPLIFICATION BASED ON CONSTRAINT POINTS ON THE POLYLINE For the constraint points on the polyline, such as a residential point on a road, a bridge on a river, a boundary point on a bourn and so on, they are not allowed to have any displacement for their locational significances. So we should make
3 sure the simplified polyline passes or contains these cultural characteristics points as they do before line generalization. Three methods are introduced to deal with this problem in this section. 3.1 Constraint point segmentation If we segment a polyline according to the constraint point, the point will become a starting-point or end-point of new polylines. Then we simplify the new polylines with DP algorithm or any other algorithms as to reserve starting-points and end-points frequently in the polyline simplification. In Figure 2, for example, we hypothesize that P 3 and P 7 are constraint points. Figure 2a shows DP algorithm in the entire polyline while Figure 2b is the result of segmenting the line on P 3 and P 7 and corresponding simplification separately. Obviously, because of the difference of begin-point, the chosen polyline s characteristic points and the ultimate graphs are correspondingly different. That also indicates the drawbacks of DP algorithm like that for its excessive dependence on starting-points. The disadvantage of the segmentation method is that: it adds certain the complexity of spatial database since segmentation inevitably will need more identified information when polylines are to be stored. 3.2 BLG-tree simplification The algorithm of BLG-tree to construct a hierarchical structure about points on line is based on the Douglas-Peucker algorithm (e.g. Figure 3b). BLG-tree simplification can not only reduce the repeatedly calls for DP algorithm to speed the data retrieve, but also simplify on the fly in different scale with the help of reducing or adding the whole or part of polyline points tree level according to scales or details requirement. Figure 2. Constraint Points Segmentation To simplify with constraint points using BLG-tree, first we should construct a BLG-tree of a polyline and do pay much attention that constraint points are the polyline interior nodes all the same but they need special labels. During line simplification, we trace throughout BLG-tree, select nodes from the top to bottom of the tree and examine whether they meet the requirements of simplification, that s geometric threshold. If there are still some constraint points left to be chosen and then we need go on selecting nodes in the part of polyline until it meet all the constraint conditions, especially the topological constraints. For example, in Figure 2a, given P 7 is a constraint point that has not been chosen within DP algorithm. Figure 3a is the BLG-tree for figure 2a in the graph. We can see the simplified result with BLGtree choosing points by tracing throughout the sub-tree from P 4 to P 8 and end up on P 7 which is a constraint point. BLGtree simplification can not only guarantee the whole coordination, symmetry and perfection of graph structure, but also keep consistent topological relation constraint between points and polyline unchanged. Figure 3. BLG-Tree Simplification 3.3 Points displacement In addition, we can calculate the nearest point to constraint point P on DP simplified line and displace that point to the constraint one. But it is merely an post-process method for the later modifications and disposal of a few points.
4 Figure 4. Points Displacement 4. CONSISTENT SIMPLIFICATION BASED ON CONSTRAINT POINTS OUT OF POLYLINES The constraint points on the line can be retained compulsive as characteristic points, while constraint points out of polyline will be more complicated to handle with and we should examine the topological relation between constraint points and polyline. In order to reduce the volume of data, we can cut down the field of researched rang with constraint points. There are often two means to achieve it:! Just test characteristic points on the contiguity relevant to polyline (always two);! Just test constraint points in the convex hull determined by polyline. In essence, topologically consistent simplification require the topological relation between constraint points and polyline (prior to or after simplification) should be unchanged, which means the area bounded by the source polyline and the target one should contain no constraint points. Then spatial relations among geographic structural characteristics objects will not change. We can tell whether topological inconsistency happens or not by examine if a constraint point lies inside the polygon formed by the source and simplified polylines. From the viewpoints of plane division, the domain of these polygons is smaller than both areas acquired by former two approaches. Through the analyses, we can infer that polylines of source and target make up of several polygons and each polygon is composed of the segment of simplified polyline and a series of original polyline segment. For an instance, polygon P 4 P 5 P 6 P 7 P 8 in Figure 5 is a complicated one that consists of original segment P 4 P 5 P 5 P 6 P 6 P 7 P 7 P 8 and simplified line P 4 P 8. Topological inconsistency can be identified by means of examining if there are constraint points in the polygon. Two approaches are described in the following in the opinion of constraint point out of polylines. 4.1 Consistent simplification with shortcut What we called shortcut is that it connects the starting-point with the point followed to build a new straight line. It makes threshold or bandwidth etc. a geometric condition and the topological relation between the new polygon, formed by the shortcut besides original polylines, and constraint points a topological condition. If the result meets these two conditions, the shortcut will be a generalized straight line, and the starting-point will alter to the next one and iterate that. It can be divided into two steps as below. Figure 5. Consistent Simplification with Shortcut The first step: Supposing we start from point P i (i [1,n-2], n is total node number), connect P i with P i+j (j [n+2,n], n is total node number), and then we can get a polygon P i P i+1 P i+j formed by shortcut PiPi+j and original polyline segments P i P i+1, P i+1 P i+2 P i+j-1 P i+j.if the conditions satisfy geometric constraints (threshold and bandwidth). And no constraint point is in the polygon, the connected point travel forward, e.g. P i with P i+j+1 ; if there is a constraint point in the polygon P i P i+1 P i+j P i+j+1, the shortcut P i P i+j will be the straight line of simplification of polyline P i P i+1 P i+j. In Figure 5, given P 4 is the starting point, shortcut P 4 P 7 and P 4 P 8 meet geometric simplification standards, but P 4 P 8 has caused topological inconsistency. As a consequence, P 4 P 7 is selected as a simplified line.
5 The second step: Continue to start from P i+j, connect P i+j+2,p i+j+3 and repeat the first step until come to the last point of the polyline. In a short word, the polylines characteristic points are chosen as critical points when it meets geometric precise and topological relation happens to change according to the above method. The approach can be used to examine constraint points adjacent to the polyline; it can effectively reduce the test range of constraint points and consequently reduce the computed data volume and computation complexity. 4.2 BLG-tree algorithm Simplified segments and original partly polyline may form one or more than one polygons (e.g. P 1 P 4 and P 4 P 8, P, P are constraint points in Figure 6). To guarantee the topological relation of the constraint points and polyline to be consistent after simplification is to make sure these points are not in these polygons. In order to avoid using DP algorithm repeatedly, we use the foregoing BLG-tree: create BLG-tree for the polyline or only for the research area, then we can inquire the sub-tree in which the research area is included and examine the topological relation between the constraint points and newly formed polygons. We can choose nodes on the sub-trees level by level until topological consistency is kept. Figure 6. Using BLG-Tree to Simply polylines with constraint points which are out of polylines (Point P and P are constraint points). The constraint point P in Figure 6 lies in polygon P 4 P 5 P 6 P 7 P 8, and topological inconsistency takes place in the left subtree of point P 8 from the BLG-tree. So we pick up P 7 in the sub-tree and examine whether P lies in the polygon Q composed of P 4 P 5 P 6 P 7.If not, P 7 will be selected or else continue to examine P 6. We can deal with constraint point P in polygon P 1 P 2 P 3 P 4 with the same approach in Figure 6a. The result of the topological consistent simplification result of Figure 6a is showed in Figure 6c. In the meanwhile, this approach is different from shortcut method because it lessens the test field by choosing point from BLG-tree. If the constraint point lies in the abandoned polygon, it indicates that the point is not in the constraint area, which is complementary concept of the above approach. As a matter of fact, holistic and contextual simplification requirement are considered in the approach to keep coordination of the graph. 5. CONCLUSION It should be noticed that we only need to deal with the sub-tree where the constraint point lies in and as more points are selected, the sub-tree will become smaller and smaller, which is of great importance for accelerating system data processing. Additionally, if a constraint point comes up in a minute sub-tree or in the details, we can artificially exaggerate it appropriately. Figure 7 is an example for consistent line simplification with BLG-tree based on the constraint points (cross line) on or not on the polyline comparing to DP algorithm. Figure 7. An Example for consistent simplification (the crosses are constraint points)
6 For the diversity of spatial objects themselves and the complexity of the spatial relation among geographic objects, it is more complicated and difficult to hold multi-feature spatial analysis. And for cartographic generalization, which is a decision-making process on the basis of spatial analysis, further research is needed to solve the spatial constraints and conflicts among geographic structural characteristics objects. This paper only solves these complex problems with simple methods based on constraints of spatial topological relation among geographic structural characteristics objects and did some abstraction and geometric work. This is a hot spot of cartographic generalization up to now. To describe spatial relations among spatial objects, especially among different kinds of spatial features, and how to handle spatial relations are more complicated and difficult in GIS spatial database design and practical implementation. 6. REFERENCES [1] Douglas D H, Peucker T K. 1973, Algorithms for the Reduction of the Number of Points Required to Represent a Line or its Caricature. The Canadian Cartographer, 10(2): [2] Buttenfield B P Digital Definitions of Scale-Dependent Structure. Auto-Carto, 1, [3] Buttenfield, B. P A Rule for Describing Line Feature Geometry. In Map generalization: Making Rules for Knowledge Representation, B. P. B. a. R. B. McMaster, (ed) Essex: Longman Scientific & Technical, pp [4] Buttenfield, B.P Scale-Dependence and Self-Similarity in Cartographic Lines. Cartographica, 26(1), [5] Cromley, R. G Hierarchical Methods of Line Simplification. Cartography and Geographic Information Systems. 18(2): [6] Peter van Oosterom, Vincent Schenkelaars. 1995, Development of an Interactive Multi-scale GIS, International Journal of Geographical Information Systems, 9(5): [7] Zhan F, Mark D M. 1993, Conflict Resolution in Map Generalization: a Cognitive Study. Auto-Carto. No [8] Saalfeld A. 1999,Topologically Consistent Line Simplification with the Douglas-Peucker Algorithm. CGIS, 26(1): [9] Cromley,R. G. and Campbell,G. M Integrating Quantitative and Qualitative Aspects of Digital Line Simplification. The Cartographic Journal. 29(1): [10] Mark de Berg, Marc ban Kreveld, Stefan Schirra, 1998, Topologically Correct Subdivision Simplification Using the Bandwidth Criterion. CGIS. 25(4): [11] Ying Shen, Guo Renzhong, 2001,Yan Haowen, Lin Henggui. An Algorithm for Detecting and eliminating intersection of Polylines in Cartographic Generalization. Science of Surveying and Mapping. 26(4) :39-41 [12] Guo QingShen, 1993,Relationships of point, linear and area features, Journal Of Wuhan Technical University Of Surveying And Mapping(Wtusm),vol18. [13] Liu yaolin, et al. 2001,Frameworks for Generalization Constraints and Operations Based on Object-Oriented Data Structure in Database Generalization, Geo-spatial information science, Vol.4,No.3.
A CONSISTENCY MAINTENANCE OF SHARED BOUNDARY AFTER POLYGON GENERALIZATION
CO-182 A CONSISTENCY MAINTENANCE OF SHARED BOUNDARY AFTER POLYGON GENERALIZATION AI T.(1), ZHANG W.(2) (1) Wuhan University, WUHAN CITY, CHINA ; (2) Zhongnan University of Economics and Law, WUHAN CITY,
More informationA non-self-intersection Douglas-Peucker Algorithm
A non-self-intersection Douglas-Peucker Algorithm WU, SHIN -TING AND MERCEDES ROCÍO GONZALES MÁRQUEZ Image Computing Group (GCI) Department of Industrial Automation and Computer Engineering (DCA) School
More informationContour Simplification with Defined Spatial Accuracy
Contour Simplification with Defined Spatial Accuracy Bulent Cetinkaya, Serdar Aslan, Yavuz Selim Sengun, O. Nuri Cobankaya, Dursun Er Ilgin General Command of Mapping, 06100 Cebeci, Ankara, Turkey bulent.cetinkaya@hgk.mil.tr
More informationA Distributed Approach to Fast Map Overlay
A Distributed Approach to Fast Map Overlay Peter Y. Wu Robert Morris University Abstract Map overlay is the core operation in many GIS applications. We briefly survey the different approaches, and describe
More informationDisplacement Methods based on Field Analysis
Displacement Methods based on Field Analysis Tinghua Ai Laboratory of Digital Mapping and Land Information Application Engineering Wuhan University, P. R. China aith@wuhan.cngb.com Peter van Oosterom Section
More informationA Method of Measuring Shape Similarity between multi-scale objects
A Method of Measuring Shape Similarity between multi-scale objects Peng Dongliang, Deng Min Department of Geo-informatics, Central South University, Changsha, 410083, China Email: pengdlzn@163.com; dengmin028@yahoo.com
More informationLINE SIMPLIFICATION BASED ON GEOGRAPHIC-FEATURE CONSTRAINT
LINE SIMPLIFICATION BASED ON GEOGRAPHIC-FEATURE CONSTRAINT Zhai Renjian 1 Wu Fang 1 Zhu Li 2 Ge Lei 1 1 Institute of Surveying and Mapping, Information Engineering University, China; 2 School of Journalism
More informationlayers in a raster model
layers in a raster model Layer 1 Layer 2 layers in an vector-based model (1) Layer 2 Layer 1 layers in an vector-based model (2) raster versus vector data model Raster model Vector model Simple data structure
More informationFACET SHIFT ALGORITHM BASED ON MINIMAL DISTANCE IN SIMPLIFICATION OF BUILDINGS WITH PARALLEL STRUCTURE
FACET SHIFT ALGORITHM BASED ON MINIMAL DISTANCE IN SIMPLIFICATION OF BUILDINGS WITH PARALLEL STRUCTURE GE Lei, WU Fang, QIAN Haizhong, ZHAI Renjian Institute of Surveying and Mapping Information Engineering
More informationMap Generalization of Road Networks
Dr. ing. Jan Terje Bjørke Norwegian Defence Research Establishment and Department of Mathematical Sciences and Technology The Agricultural University of Norway FFI, P.O. Box 115 NO-3191 Horten NORWAY fax:
More informationTOPOLOGICAL CONSTRAINTS, ACTIONS AND REFLEXES FOR GENERALIZATION BY OPTIMIZATION
10 th ICA Workshop on Generalisation and Multiple Representation, 2-3 August 2007, Moscow TOPOLOGICAL CONSTRAINTS, ACTIONS AND REFLEXES FOR GENERALIZATION BY OPTIMIZATION Jean-Luc Monnot, Paul Hardy, &
More informationPartition and Conquer: Improving WEA-Based Coastline Generalisation. Sheng Zhou
Partition and Conquer: Improving WEA-Based Coastline Generalisation Sheng Zhou Research, Ordnance Survey Great Britain Adanac Drive, Southampton, SO16 0AS, UK Telephone: (+44) 23 8005 5000 Fax: (+44) 23
More informationAN INDIRECT GENERALIZATION OF CONTOUR LINES BASED ON DEM GENERALIZATION USING THE 3D DOUGLAS-PEUCKER ALGORITHM
AN INDIRECT GENERALIZATION OF CONTOUR LINES BASED ON DEM GENERALIZATION USING THE 3D DOUGLAS-PEUCKER ALGORITHM FEI Lifan a, *, HUANG Lina a, HE Jin b a School of Resource and Environment Science, Wuhan
More informationPROGRESSIVE TRANSMISSION OF VECTOR MAP ON THE WEB
PROGRESSIVE TRANSMISSION OF VECTOR MAP ON THE WEB AI Bo a, *, AI Tinghua b, TANG Xinming c a Geomatics College, Shandong University of Science and Technology, Qingdao, China - aibo@sdust.edu.cn b School
More informationCHANGE-ONLY MODELING IN NAVIGATION GEO-DATABASES
CHANGE-ONLY MODELING IN NAVIGATION GEO-DATABASES YING Shen a, LI Lin a, LIU Xiaofei a, ZHAO Hu a, LI Dan b a School of Resource and Environment Science, Wuhan University.29 LUOYU Road, Wuhan 430079China.
More informationAutomated schematic map production using simulated annealing and gradient descent approaches
Automated schematic map production using simulated annealing and gradient descent approaches Suchith Anand 1, Silvania Avelar 2, J. Mark Ware 3, Mike Jackson 1 1 Centre for Geospatial Science, University
More informationLINE SIMPLIFICATION ALGORITHMS
LINE SIMPLIFICATION ALGORITHMS Dr. George Taylor Work on the generalisation of cartographic line data, so that small scale map data can be derived from larger scales, has led to the development of algorithms
More informationAssessing Continuous Demand Representation in Coverage Modeling
Assessing Continuous Demand Representation in Coverage Modeling Ran Wei 1, Alan T. Murray 1 1 GeoDa Center for Geospatial Analysis and Computation, School of Geographical Sciences and Urban Planning, Arizona
More informationAn approach to simplifying point features on maps using the multiplicative weighted Voronoi diagram
Journal of Spatial Science, 2013 Vol. 58, No. 2, 291 304, http://dx.doi.org/10.1080/14498596.2013.815578 An approach to simplifying point features on maps using the multiplicative weighted Voronoi diagram
More informationLine Simplification in the Presence of Non-Planar Topological Relationships
Line Simplification in the Presence of Non-Planar Topological Relationships Padraig Corcoran 1, Peter Mooney 2, Michela Bertolotto 1 1 School of Computer Science and Informatics, University College Dublin.
More informationStoring and using scale-less topological data efficiently in a clientserver DBMS environment
Storing and using scale-less topological data efficiently in a clientserver DBMS environment Maarten Vermeij, Peter van Oosterom, Wilko Quak and Theo Tijssen Faculty of Civil Engineering and Geosciences,
More informationSPATIOTEMPORAL INDEXING MECHANISM BASED ON SNAPSHOT-INCREMENT
SPATIOTEMPORAL INDEXING MECHANISM BASED ON SNAPSHOT-INCREMENT L. Lin a, Y. Z. Cai a, b, Z. Xu a a School of Resource and Environment Science,Wuhan university, Wuhan China 430079, lilin@telecarto.com b
More informationGeneralization of Spatial Data for Web Presentation
Generalization of Spatial Data for Web Presentation Xiaofang Zhou, Department of Computer Science, University of Queensland, Australia, zxf@csee.uq.edu.au Alex Krumm-Heller, Department of Computer Science,
More informationFrameworks for Generalization Constraints and Operations Based on Object-Oriented Data Structure in Database Generalization
Frameworks for Generalization Constraints and Operations Based on Object-Oriented Data Structure in Database Generalization Liu Yaolin 1, Martien Molenaar 2,Ai Tinghua 1 1 School of land information and
More informationClass #2. Data Models: maps as models of reality, geographical and attribute measurement & vector and raster (and other) data structures
Class #2 Data Models: maps as models of reality, geographical and attribute measurement & vector and raster (and other) data structures Role of a Data Model Levels of Data Model Abstraction GIS as Digital
More informationINCREASING CLASSIFICATION QUALITY BY USING FUZZY LOGIC
JOURNAL OF APPLIED ENGINEERING SCIENCES VOL. 1(14), issue 4_2011 ISSN 2247-3769 ISSN-L 2247-3769 (Print) / e-issn:2284-7197 INCREASING CLASSIFICATION QUALITY BY USING FUZZY LOGIC DROJ Gabriela, University
More informationUsing data reduction to improve the transmission and rendering. performance of SVG maps over the Internet
Using data reduction to improve the transmission and rendering performance of SVG maps over the Internet Haosheng Huang 1 and Yan Li 2 1 Institute of Geoinformation and Cartography, Vienna University of
More informationPerformance Evaluation of Line Simplification Algorithms for Vector Generalization
The Cartographic Journal Vol. 43 No. 1 pp. 27 44 March 2006 # The British Cartographic Society 2006 REFEREED PAPER Performance Evaluation of Line Simplification Algorithms for Vector Generalization Wenzhong
More informationThe Promotion Channel Investigation of BIM Technology Application
2016 International Conference on Manufacturing Construction and Energy Engineering (MCEE) ISBN: 978-1-60595-374-8 The Promotion Channel Investigation of BIM Technology Application Yong Li, Jia-Chuan Qin,
More informationPLOTTING DEPTH CONTOURS BASED ON GRID DATA IN IRREGULAR PLOTTING AREAS
PLOTTING DEPTH CONTOURS BASED ON GRID DATA IN IRREGULAR PLOTTING AREAS Zhang, L., Li, S. and Li, Y. Department of Hydrography and Cartography,Dalian Naval Academy, 667, Jiefang Road, Dalian, Liaoning,
More informationLINE SIMPLIFICATION UNDER SPATIAL CONSTRAINTS
LINE SIMPLIFICATION UNDER SPATIAL CONSTRAINTS TITUS TIENAAH June 2018 TECHNICAL REPORT NO. 314 LINE SIMPLIFICATION UNDER SPATIAL CONSTRAINTS Titus Tienaah Department of Geodesy and Geomatics Engineering
More informationSmoothing Via Iterative Averaging (SIA) A Basic Technique for Line Smoothing
Smoothing Via Iterative Averaging (SIA) A Basic Technique for Line Smoothing Mohsen Mansouryar and Amin Hedayati, Member, IACSIT Abstract Line Smoothing is the process of curving lines to make them look
More informationAutomatic Recognition and Resolution of Line Symbol Spatial Conflict in Cartography Based on Elastic Beams Model
Automatic Recognition and Resolution of Line Symbol Spatial Conflict in Cartography Based on Elastic Beams Model Zhonghai YU 1, Yongbin Tan 1, Zhujun Xiang 2 1 School of Resource and Environment Science,
More informationCaricaturing Buildings for Effective Visualization
Caricaturing Buildings for Effective Visualization Grant G. Rice III, Ergun Akleman, Ozan Önder Özener and Asma Naz Visualization Sciences Program, Department of Architecture, Texas A&M University, USA
More informationEfficient Integration of Road Maps
Efficient Integration of Road Maps Eliyahu Safra Technion Haifa, Israel safra@technion.ac.il Yaron Kanza University of Toronto Toronto, Canada yaron@cs.toronto.edu Yehoshua Sagiv The Hebrew University
More informationBUILDINGS CHANGE DETECTION BASED ON SHAPE MATCHING FOR MULTI-RESOLUTION REMOTE SENSING IMAGERY
BUILDINGS CHANGE DETECTION BASED ON SHAPE MATCHING FOR MULTI-RESOLUTION REMOTE SENSING IMAGERY Medbouh Abdessetar, Yanfei Zhong* State Key Laboratory of Information Engineering in Surveying, Mapping and
More informationBoundary Simplification in Slide 5.0 and Phase 2 7.0
Boundary Simplification in Slide 5.0 and Phase 2 7.0 Often geometry for a two dimensional slope stability or finite element analysis is taken from a slice through a geological model. The resulting two
More informationAN ITERATIVE PROCESS FOR MATCHING NETWORK DATA SETS WITH DIFFERENT LEVEL OF DETAIL
AN ITERATIVE PROCESS FOR MATCHING NETWORK DATA SETS WITH DIFFERENT LEVEL OF DETAIL Yoonsik Bang, Chillo Ga and Kiyun Yu * Dept. of Civil and Environmental Engineering, Seoul National University, 599 Gwanak-ro,
More informationMinimising Positional Errors in Line Simplification Using Adaptive Tolerance Values
ISPRS SIPT IGU UCI CIG ACSG Table of contents Table des matières Authors index Index des auteurs Search Recherches Exit Sortir Minimising Positional Errors in Line Simplification Using Adaptive Tolerance
More informationCritique for CS 448B: Topics in Modeling The Voronoi-clip Collision Detection Algorithm
Critique for CS 448B: Topics in Modeling The Voronoi-clip Collision Detection Algorithm 1. Citation Richard Bragg March 3, 2000 Mirtich B. (1997) V-Clip: Fast and Robust Polyhedral Collision Detection.
More informationFinite-Resolution Simplicial Complexes
1 Finite-Resolution Simplicial Complexes Werner Hölbling, Werner Kuhn, Andrew U. Frank Department of Geoinformation Technical University Vienna Gusshausstrasse 27-29, A-1040 Vienna (Austria) frank@geoinfo.tuwien.ac.at
More informationStoring And Using Multi-Scale Topological Data Efficiently In A Client-Server DBMS Environment
Storing And Using Multi-Scale Topological Data Efficiently In A Client-Server DBMS Environment MAARTEN VERMEIJ, PETER VAN OOSTEROM, WILKO QUAK AND THEO TIJSSEN. Faculty of Civil Engineering and Geosciences,
More informationA framework to formalize multi-scales land-use generalization in the ScaleMaster 2.0
A framework to formalize multi-scales land-use generalization in the ScaleMaster 2.0 Jean-François Girres 1, Guillaume Touya² 1 UMR GRED Université Paul Valéry Montpellier, Route de Mende 34199 Montpellier
More informationOpen Access Research on Algorithms of Spatial-Temporal Multi-Channel Allocation Based on the Greedy Algorithm for Wireless Mesh Network
Send Orders for Reprints to reprints@benthamscience.ae 690 The Open Electrical & Electronic Engineering Journal, 2014, 8, 690-694 Open Access Research on Algorithms of Spatial-Temporal Multi-Channel Allocation
More informationTCM Health-keeping Proverb English Translation Management Platform based on SQL Server Database
2019 2nd International Conference on Computer Science and Advanced Materials (CSAM 2019) TCM Health-keeping Proverb English Translation Management Platform based on SQL Server Database Qiuxia Zeng1, Jianpeng
More informationOntology-driven map generalization
Ontology-driven map generalization Lars Kulik, Matt Duckham, Max Egenhofer Department of Computer Science and Software Engineering University of Melbourne, Victoria 3010, Australia Department of Geomatics
More informationROAD DATA UPDATING USING TOOLS OF MATCHING AND MAP GENERALIZATION
ROAD DATA UPDATING USING TOOLS OF MATCHING AND MAP GENERALIZATION HU Yun gang a,*, CHEN Jun b, LI Zhi lin c, ZHAO Ren liang b a Beijing University of Civil Engineering and Architecture, 100044, Beijing,
More informationA DBMS-BASED 3D TOPOLOGY MODEL FOR LASER RADAR SIMULATION
A DBMS-BASED 3D TOPOLOGY MODEL FOR LASER RADAR SIMULATION C. Jun a, * G. Kim a a Dept. of Geoinformatics, University of Seoul, Seoul, Korea - (cmjun, nani0809)@uos.ac.kr Commission VII KEY WORDS: Modelling,
More informationComputational Geometry Algorithms Library. Geographic information Systems
Computational Geometry Algorithms Library in Geographic information Systems Edward Verbree, Peter van Oosterom and Wilko Quak TU Delft, Department of Geodesy, Thijsseweg 11, 2629 JA Delft, the Netherlands
More informationGeodatabase over Taita Hills, Kenya
Geodatabase over Taita Hills, Kenya Anna Broberg & Antero Keskinen Abstract This article introduces the basics of geographical information systems (GIS) and explains how the Taita Hills project can benefit
More informationStudy on Delaunay Triangulation with the Islets Constraints
Intelligent Information Management, 2010, 2, 375-379 doi:10.4236/iim.2010.26045 Published Online June 2010 (http://www.scirp.org/journal/iim) Study on Delaunay Triangulation with the Islets Constraints
More informationWhich n-venn diagrams can be drawn with convex k-gons?
Which n-venn diagrams can be drawn with convex k-gons? Jeremy Carroll Frank Ruskey Mark Weston Abstract We establish a new lower bound for the number of sides required for the component curves of simple
More informationCONSTRUCTION OF DATABASE PLATFORM FOR INTERACTIVE GENERALIZATION ON LARGE SCALE TOPOGRAPHIC MAP
CONSTRUCTION OF DATABASE PLATFORM FOR INTERACTIVE GENERALIZATION ON LARGE SCALE TOPOGRAPHIC MAP Cai, Z., Du, Q., Wu, H. and Liao, C. School of Resources and Environmental Science, Wuhan University, Wuhan,
More informationDEVELOPMENT OF A ROBUST IMAGE MOSAICKING METHOD FOR SMALL UNMANNED AERIAL VEHICLE
DEVELOPMENT OF A ROBUST IMAGE MOSAICKING METHOD FOR SMALL UNMANNED AERIAL VEHICLE J. Kim and T. Kim* Dept. of Geoinformatic Engineering, Inha University, Incheon, Korea- jikim3124@inha.edu, tezid@inha.ac.kr
More informationPurpose: To explore the raster grid and vector map element concepts in GIS.
GIS INTRODUCTION TO RASTER GRIDS AND VECTOR MAP ELEMENTS c:wou:nssi:vecrasex.wpd Purpose: To explore the raster grid and vector map element concepts in GIS. PART A. RASTER GRID NETWORKS Task A- Examine
More informationLecture 3: Art Gallery Problems and Polygon Triangulation
EECS 396/496: Computational Geometry Fall 2017 Lecture 3: Art Gallery Problems and Polygon Triangulation Lecturer: Huck Bennett In this lecture, we study the problem of guarding an art gallery (specified
More informationVisibility: Finding the Staircase Kernel in Orthogonal Polygons
Visibility: Finding the Staircase Kernel in Orthogonal Polygons 8 Visibility: Finding the Staircase Kernel in Orthogonal Polygons Tzvetalin S. Vassilev, Nipissing University, Canada Stefan Pape, Nipissing
More informationDept. of Computer Science. The Netherlands. Stefan Schirra. Im Stadtwald. D Saarbrucken. Germany. Abstract
A New Approach to Subdivision Simplication Mark de Berg Dept. of Computer Science Utrecht University P.O.Box 80.089 3508 TB Utrecht The Netherlands markdb@cs.ruu.nl Marc van Kreveld Dept. of Computer Science
More informationICA Tutorial on Generalisation & Multiple Representation 2 July 2011 Paris
ICA Tutorial on Generalisation & Multiple Representation 2 July 2011 Paris Lecture 4 : Constraints: in requirement analysis and evaluation (30 mins) Jantien Stoter Dr. TU Delft & Kadaster & Geonovum On
More information3 The standard grid. N ode(0.0001,0.0004) Longitude
International Conference on Information Science and Computer Applications (ISCA 2013 Research on Map Matching Algorithm Based on Nine-rectangle Grid Li Cai1,a, Bingyu Zhu2,b 1 2 School of Software, Yunnan
More informationOn Merging Straight Skeletons
On Merging Straight Skeletons Franz Aurenhammer 1 and Michael Steinkogler 2 1 Institute for Theoretical Computer Science, University of Technology, Graz, Austria auren@igi.tugraz.at 2 Institute for Theoretical
More informationA Simplex based Dimension Independent Approach for Convex Decomposition of Nonconvex polytopes
A Simplex based Dimension Independent Approach for Convex Decomposition of Nonconvex polytopes Rizwan Bulbul, Farid Karimipour and Andrew U. Frank Institute of Geoinformation and Cartography Technical
More informationAN ITERATIVE ALGORITHM FOR MATCHING TWO ROAD NETWORK DATA SETS INTRODUCTION
AN ITERATIVE ALGORITHM FOR MATCHING TWO ROAD NETWORK DATA SETS Yoonsik Bang*, Student Jaebin Lee**, Professor Jiyoung Kim*, Student Kiyun Yu*, Professor * Civil and Environmental Engineering, Seoul National
More informationLecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10
Lecture 25: Bezier Subdivision And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 1. Divide and Conquer If we are going to build useful
More informationError indexing of vertices in spatial database -- A case study of OpenStreetMap data
Error indexing of vertices in spatial database -- A case study of OpenStreetMap data Xinlin Qian, Kunwang Tao and Liang Wang Chinese Academy of Surveying and Mapping 28 Lianhuachixi Road, Haidian district,
More informationVisibilty: Finding the Staircase Kernel in Orthogonal Polygons
American Journal of Computational and Applied Mathematics 2012, 2(2): 17-24 DOI: 10.5923/j.ajcam.20120202.04 Visibilty: Finding the Staircase Kernel in Orthogonal Polygons Stefan A. Pape, Tzvetalin S.
More informationChapter 1. Introduction
Introduction 1 Chapter 1. Introduction We live in a three-dimensional world. Inevitably, any application that analyzes or visualizes this world relies on three-dimensional data. Inherent characteristics
More informationA New Approach for Data Conversion from CAD to GIS
Esin Bitik (PhD) Dursun Zafer Şeker Ziyadin ÇAKIR Hakan DENLİ A New Approach for Data Conversion from CAD to GIS June 19, 2014 Contents 1. Aim of the study 2. Introduction 3. Vector Data Structure 4. Converting
More information1/60. Geometric Algorithms. Lecture 1: Introduction. Convex Hulls
1/60 Geometric Algorithms Lecture 1: Introduction Convex Hulls Geometric algorithms scope 2/60 Geometry algorithms (practice): Study of geometric problems that arise in various applications and how algorithms
More informationAn Efficient Paving Method of Pure Quad Mesh Generation
2016 International Conference on Intelligent Manufacturing and Materials (ICIMM 2016) ISBN: 978-1-60595-363-2 An Efficient Paving Method of Pure Quad Mesh Generation Yongcai Liu, Wenliang Chen and Yidong
More informationConvex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis
CCCG 2008, Montréal, Québec, August 13 15, 2008 Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis Jérémy Barbay Eric Y. Chen Abstract We prove a tight asymptotic bound of Θ(δ
More informationDiscrete Optimization. Lecture Notes 2
Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The
More informationSmallest Intersecting Circle for a Set of Polygons
Smallest Intersecting Circle for a Set of Polygons Peter Otfried Joachim Christian Marc Esther René Michiel Antoine Alexander 31st August 2005 1 Introduction Motivated by automated label placement of groups
More informationLine Simplification Using Self-Organizing Maps
Line Simplification Using Self-Organizing Maps Bin Jiang Division of Geomatics, Dept. of Technology and Built Environment, University of Gävle, Sweden. Byron Nakos School of Rural and Surveying Engineering,
More informationResearch on Algorithm Schema of Parametric Architecture Design Based on Schema Theory
International Conference on Information Sciences, Machinery, Materials and Energy (ICISMME 2015) Research on Algorithm Schema of Parametric Architecture Design Based on Schema Theory Li Zhu 1, a, Nan Zhang
More informationTopology Optimization of an Engine Bracket Under Harmonic Loads
Topology Optimization of an Engine Bracket Under Harmonic Loads R. Helfrich 1, A. Schünemann 1 1: INTES GmbH, Schulze-Delitzsch-Str. 16, 70565 Stuttgart, Germany, www.intes.de, info@intes.de Abstract:
More informationFOUR ADVANCES IN HANDLING UNCERTAINTIES IN SPATIAL DATA AND ANALYSIS
FOUR ADVANCES IN HANDLING UNCERTAINTIES IN SPATIAL DATA AND ANALYSIS Wenzhong Shi Advanced Research Centre for Spatial Information Technology Department of Land Surveying and Geo-Informatics The Hong Kong
More informationAN APPROACH OF SEMIAUTOMATED ROAD EXTRACTION FROM AERIAL IMAGE BASED ON TEMPLATE MATCHING AND NEURAL NETWORK
AN APPROACH OF SEMIAUTOMATED ROAD EXTRACTION FROM AERIAL IMAGE BASED ON TEMPLATE MATCHING AND NEURAL NETWORK Xiangyun HU, Zuxun ZHANG, Jianqing ZHANG Wuhan Technique University of Surveying and Mapping,
More informationThe Design and Application of GIS Mathematical Model Database System with Meta-algorithm Li-Zhijiang
4th National Conference on Electrical, Electronics and Computer Engineering (NCEECE 2015) The Design and Application of GIS Mathematical Model Database System with Meta-algorithm Li-Zhijiang Yishui College,
More informationAUTOMATIC GENERATION OF DIGITAL BUILDING MODELS FOR COMPLEX STRUCTURES FROM LIDAR DATA
AUTOMATIC GENERATION OF DIGITAL BUILDING MODELS FOR COMPLEX STRUCTURES FROM LIDAR DATA Changjae Kim a, Ayman Habib a, *, Yu-Chuan Chang a a Geomatics Engineering, University of Calgary, Canada - habib@geomatics.ucalgary.ca,
More informationDIGITAL GENERATION OF CHINESE ICE-RAY LAT- TICE DESIGNS
S. Chien, S. Choo, M. A. Schnabel, W. Nakapan, M. J. Kim, S. Roudavski (eds.), Living Systems and Micro-Utopias: Towards Continuous Designing, Proceedings of the 21st International Conference of the Association
More informationMulti-Source Spatial Data Distribution Model and System Implementation
Communications and Network, 2013, 5, 93-98 http://dx.doi.org/10.4236/cn.2013.51009 Published Online February 2013 (http://www.scirp.org/journal/cn) Multi-Source Spatial Data Distribution Model and System
More informationBUILDING RECONSTRUCTION USING LIDAR DATA
BUILDING RECONSTRUCTION USING LIDAR DATA R. O.C. Tse, M. Dakowicz, C.M. Gold, and D.B. Kidner GIS Research Centre, School of Computing, University of Glamorgan, Pontypridd, CF37 1DL, Wales, UK. rtse@glam.ac.uk,mdakowic@glam.ac.uk,cmgold@glam.ac.uk,
More informationSome Thoughts on Visibility
Some Thoughts on Visibility Frédo Durand MIT Lab for Computer Science Visibility is hot! 4 papers at Siggraph 4 papers at the EG rendering workshop A wonderful dedicated workshop in Corsica! A big industrial
More informationM. Andrea Rodríguez-Tastets. I Semester 2008
M. -Tastets Universidad de Concepción,Chile andrea@udec.cl I Semester 2008 Outline refers to data with a location on the Earth s surface. Examples Census data Administrative boundaries of a country, state
More informationDIGITAL MAP GENERALIZATION USING A HIERARCHICAL COORDINATE SYSTEM. Abstract
DIGITAL MAP GENERALIZATION USING A HIERARCHICAL COORDINATE SYSTEM Geoffrey Dutton Department of Geography University of Zürich Winterthurerstrasse 1 8057 Zürich Switzerland dutton@geo.unizh.ch Abstract
More informationTHE TOOLS OF AUTOMATED GENERALIZATION AND BUILDING GENERALIZATION IN AN ArcGIS ENVIRONMENT
Vol. XIX, 2011, No. 1, 1 7, DOI: 10.2478/v10189-011-0001-4 V. DROPPOVÁ THE TOOLS OF AUTOMATED GENERALIZATION AND BUILDING GENERALIZATION IN AN ArcGIS ENVIRONMENT Veronika Droppová email: veronika.droppova@gmail.com
More informationSELF-INTERSECTING POLYGONS RESULTING FROM CONTOUR EVOLUTION FOR SHAPE SIMILARITY
International Journal of Shape Modeling Vol. 15, Nos. 1 & 2 (29) 93 19 c World Scientific Publishing Company DOI: 1.1142/S218654391227 SELF-INTERSECTING POLYGONS RESULTING FROM CONTOUR EVOLUTION FOR SHAPE
More informationComputational Geometry
Lecture 1: Introduction and convex hulls Geometry: points, lines,... Geometric objects Geometric relations Combinatorial complexity Computational geometry Plane (two-dimensional), R 2 Space (three-dimensional),
More informationExtraction of cross-sea bridges from GF-2 PMS satellite images using mathematical morphology
IOP Conference Series: Earth and Environmental Science PAPER OPEN ACCESS Extraction of cross-sea bridges from GF-2 PMS satellite images using mathematical morphology To cite this article: Chao Chen et
More informationRapid Modeling of Digital City Based on Sketchup
Journal of Mechanical Engineering Research and Developments ISSN: 1024-1752 Website: http://www.jmerd.org Vol. 38, No. 1, 2015, pp. 130-134 J. Y. Li *, H. L. Yuan, & C. Reithmeier Department of Architectural
More informationAnnouncements. Data Sources a list of data files and their sources, an example of what I am looking for:
Data Announcements Data Sources a list of data files and their sources, an example of what I am looking for: Source Map of Bangor MEGIS NG911 road file for Bangor MEGIS Tax maps for Bangor City Hall, may
More informationAUTOMATIC DIVISION OF CENSUS DISTRICT BASED ON CONSTRAINT DELAUNAY TRIANGULATION
CO-041 AUTOMATIC DIVISION OF CENSUS DISTRICT BASED ON CONSTRAINT DELAUNAY TRIANGULATION LIU D., MA W., CHENG J. Chinese Academy of surveying and Mapping, BEIJING, CHINA ABSTRACT Division of census district
More informationAccuracy of Matching between Probe-Vehicle and GIS Map
Proceedings of the 8th International Symposium on Spatial Accuracy Assessment in Natural Resources and Environmental Sciences Shanghai, P. R. China, June 25-27, 2008, pp. 59-64 Accuracy of Matching between
More information4. References. q h-1. q h
4. References -1-2 Fig. 5 polygon on which the DSW algorithm fails. C 1 Bhattacharya B K, ElGindy H. new linear convex hull algorithm for simple polygons. IEEE Transactions on Information Theory. 1994,
More informationPROGRESSIVE REPRESENTATION AND PROGRESSIVE GENERALIZATION OF STREET NETWORK VECTOR DATA
PROGRESSIVE REPRESENTATION AND PROGRESSIVE GENERALIZATION OF STREET NETWORK VECTOR DATA J. Tian ab * a School of Resource and Environment Science, Wuhan University, 129 Luoyu Road, 430079Wuhan, China -
More informationAn Improved DFSA Anti-collision Algorithm Based on the RFID-based Internet of Vehicles
2016 2 nd International Conference on Energy, Materials and Manufacturing Engineering (EMME 2016) ISBN: 978-1-60595-441-7 An Improved DFSA Anti-collision Algorithm Based on the RFID-based Internet of Vehicles
More informationGeometric and Thematic Integration of Spatial Data into Maps
Geometric and Thematic Integration of Spatial Data into Maps Mark McKenney Department of Computer Science, Texas State University mckenney@txstate.edu Abstract The map construction problem (MCP) is defined
More informationDetermining Differences between Two Sets of Polygons
Determining Differences between Two Sets of Polygons MATEJ GOMBOŠI, BORUT ŽALIK Institute for Computer Science Faculty of Electrical Engineering and Computer Science, University of Maribor Smetanova 7,
More informationResearch on the Checkpoint Server Selection Strategy Based on the Mobile Prediction in Autonomous Vehicular Cloud
2016 International Conference on Service Science, Technology and Engineering (SSTE 2016) ISBN: 978-1-60595-351-9 Research on the Checkpoint Server Selection Strategy Based on the Mobile Prediction in Autonomous
More information