GML Topology Data Storage Schema Design
|
|
- Lisa Atkinson
- 6 years ago
- Views:
Transcription
1 GML Data Storage Schema Design Paper: GML Data Storage Schema Design Yuzhen Li, Jianming Lu, Jihong Guan, Mingying Fan, Ayman Haggag, and Takashi Yahagi Graduate School of Science and Technology, Chiba University [Received December 27, 2006; accepted March 19, 2007] Geography Markup Language (GML) was developed to standardize the representation of geographical data in extensible markup language (XML), which facilitates geographical information exchange and sharing. Increasing amounts of geographical data are being presented in GML as its use widens, raising the question of how to store GML data efficiently to facilitate its management and retrieval. We analyze topology data in GML and propose storing nonspatial and spatial data from GML documents in spatial databases (e.g, Oracle Spatial, DB2 Spatial, and Post- GIS/PostgreSQL.). We then use an example to analyze the topology relation. Keywords: GML, topological data, topology scheme, spatial query 1. Introduction With the development of the Worldwide Web s geographic information system (GIS), geographical data exchange and sharing has become possible in different applications. The lack of interoperability between different geographical databases that have been developed, however, makes data exchange and sharing difficult. GML is an XML-based OpenGIS consortium (OGC) specification for representing and exchanging geographic information, including geometry and the properties of geographic features [1]. The difference between XML and GML is that GML supports geometric elements corresponding to Point, LineString, LinearRing, Polygon, MultiPoint, MultiLineString, MultiPolygon, and GeometryCollection. The current versions, GML 3.1, was extended to represent geospatial phenomena in addition to simple 2D linear features, including features with complex, non-linear, 3D geometry, features with 2D topology, features with temporal properties, dynamic features, coverages, and observations. GML has significantly influenced the ability of organizations to share geographic information. Using GML, users deliver geographic information as distinct features and control how they are displayed. Best of all, users view resulting maps using a standard browser, without the need for proprietary client GIS software. We previously proposed storing nonspatial and spatial data from GML documents in spatial databases [2], first generating a GML schema tree in the given GML schema, then mapping the generated schema tree into corresponding relational schemas. All basic spatial objects are eventually stored as values of the mapped table fields. is a key requirement for data management and integrity, having such functions as managing shared geometry, defining and enforcing data integrity rules, supporting topological relationship queries and navigation, supporting sophisticated editing tools that enforce topological constraints of the data model, and constructing features from unstructured geometry. No such work has, to our knowledge, been done on GML topology storage and management, however. Here we propose storing topology data from GML documents in spatial databases. To do so, we first analyze topology data in GML, then design a database model to store GML topology data, using an example to analyze the topology relationship. 2. Background In the sections that follow, we present a brief overview of GML storage and propose storing GML documents in spatial databases. The GML database we are establishing, called GBase, is used to manage GML data efficiently. (Fig. 1) consists of six components: a schema extractor (SE), a schema simplifier (SS), a schema tree generator (STG), a mapping rules generator (MRG), a data loader (DL), and a query translator (QT). The SE extracts the GML schema from GML document that have no schema. The SS module simplifies the GML Schema. The STG generates GML schema trees by using a schema tree generation algorithm, whose input is GML application schemas. The MRG generates the mapping specifications based on the GML structure-mapping algorithm. The DL uses a GML document or GML topology data as inputs, stores it in the target SDBMS based on mapping specifications generated by the MRG or the topology scheme. The QT translates a GML query into a corresponding SQL query that ready to be submitted to the SDBMS. The results returned are constructed and delivered to the user via the QT [2]. Having designed an efficient way to manage GML data, we studied how to best store GML topology data. Vol.11 No.6, 2007 Journal of Advanced Computational Intelligence 701
2 Li, Y. et al. Schema Extractor Schema Simplifior GML Schema schema tree generation algorithm GML schema Schema Tree Generator GML structure GML schema tree mapping algorithm Mapping Rules Generator Mapping specification GML query GML results GML document Data Loader Query Translator GML topology data tuples SQL Query /results e3 f1 e1 n2 n1 e2 n3 f2 e4 f3 e5 n4 e6 Fig. 2. Simple topology manifold. SDBMS Fig. 1. GML storage architecture. 3. GML Data Analysis and Storage Model Design The sections that follow discuss how to store GML topology data in a database and use such for spatial analysis and operation Concept is the branch of mathematics describing the properties of objects that are invariant under continuous deformation. A circle, for example, is topologically equivalent to an ellipse because one can be transformed into the other by stretching. In geographic modeling, topology is mainly used in accelerating computational geometry. In a graph, the number of intersecting points, line segments, polygons, and their mutual relationships, are constant because the plane on which they are is stretched or distorted. In GIS applications, topology is used to explicitly describe, manage, and retrieve these relationships without resorting to time-consuming spatial comparison. The principles of topology are used to implement a system that enables rapid spatial data retrieval, enhanced spatial data analysis, spatial data editing and clean unimproved data consistency, management of shared geometry, and definition and enforcement of data integrity rules [3]. Some GIS applications use persistent topology, i.e., to structure data based on topological principles so that topological relationships are stored and continuously available in the database. The persistent topology approach also stores spatial data more efficiently, reduces or eliminates spatial redundancy data, implements certain spatial business rules more easily in the database, improves the management of hierarchical geographic relationships [4], and addresses coordinate precision and tolerance issues that may lead to gaps or slivers more straight forwardly [5] Data Analysis in GML The GML3 conceptual model for topology describes the correspondence of topological and geometric relationships up to 3 dimensions. In GML, spatial topology is modeled using basic building blocks nodes, edges, faces, and solids called topology primitives, together with a description of their mutual connective relationships [6]. The GML topology primitive types Node, Edge, Face, and TopoSolid are often used to describe geometry primitives, Point, Curve, Surface, and Solid. is concerned with such connective primitive relationships as the connectedness of nodes, the coincidence of edges, and the adjacency of faces and solids. Unlike GML geometry, topology does not encode coordinates and the topology model is not associated with the positioning of nodes, the direction of edges, or the shape of faces and solids. To introduce an example for interpreting a concrete concept of GML topology primitives and their relationships, Fig. 2 shows a manifold of nodes, edges, and faces abstracted from real-world objects, and gives the adjacency and containment relationships between them. Just as edges are formed from a pair of directed nodes, faces are formed from a set of directed edges that are traversed to determine face boundaries. This example has four nodes n1, n2, n3, and n4; six edges e1, e2, e3, e4, e5, and e6; and three faces f1, f2, and f3. In GML 3.1, nodes need only be identified uniquely using the gml:id attribute, so nodes in the example are encoded as follows: <gml:node gml:id="n1"/> <gml:node gml:id="n2"/> <gml:node gml:id="n3"/> <gml:node gml:id="n4"/> Edges are encoded as follows: <gml:edge gml:id="e1"> xlink:href="#n1"/> xlink:href="#n2"/> <gml:edge gml:id="e1"/> <gml:edge gml:id="e2"> xlink:href="#n2"/> xlink:href="#n3"/> <gml:edge gml:id="e2"/> 702 Journal of Advanced Computational Intelligence Vol.11 No.6, 2007
3 GML Data Storage Schema Design <gml:edge gml:id="e3"> xlink:href="#n3"/> xlink:href="#n1"/> <gml:edge gml:id="e3"/> <gml:edge gml:id="e4"> xlink:href="#n2"/> xlink:href="#n4"/> <gml:edge gml:id="e4"/> <gml:edge gml:id="e5"> xlink:href="#n1"/> xlink:href="#n4"/> <gml:edge gml:id="e5"/> <gml:edge gml:id="e6"> xlink:href="#n4"/> xlink:href="#n3"/> <gml:edge gml:id="e6"/> In this example, the xlink:href attribute is used to reference previously defined nodes. The orientation attribute is used to represent a positive orientation "+" for some of the nodes, signifying that these nodes are at the end of the corresponding edge, and negative orientation "-" signifying that these nodes are at the start of the edge. Note that each edge is directed by its start node and end node and is traversed either negatively or positively. The directed edge "+e1", for example, corresponds to traversing the path along "e1" from n1 to n2 and "-e1" traverses the path from n2 to n1. The directed edge "+e1" is encoded in GML 3.1 using the directededge property that uses the orientation attribute "+" as follows. xlink:href="#e1"/> One possible route from n1 to n4 is expressed as a TopoCurve in GML, which contains a list of directed edges +e1, and +e4 forming a connected path. The following example shows how this path from n1 to n4 is encoded as a TopoCurve: <gml:topocurve> xlink:href="#e1"/> xlink:href="#e4"/> </gml:topocurve> In the GML topology model, each face is defined by its boundary, which consists of a list of directed edges. Directed edges on the boundary of each face are traversed counter clockwise as indicated by the arrow enclosing f1 in Fig. 2. The orientation of each directed edge on the boundary of a face is either "+" or "-", depending on whether the inherent direction of the edge agrees or disagrees with the counter clockwise orientation of the face. The boundary of the face labeled f1, for example, when traversed counter clockwise, corresponds to directed edges in the set +e1, +e2, and +e3. Faces are encoded in GML 3.1 as follows: <gml:face gml:id="f1"> xlink:href="#e1"/> xlink:href="#e2"/> xlink:href="#e3"/> </gml:face> In Fig. 2, e1 and e2 are edges having a face on either side. Using e1 as an example, both faces f1 and f2 contain the directededge e1 with either a positive or negative orientation in their boundary lists. Faces f1 and f2 are said to be on the coboundary of e1. In GML3, the edge primitive has an optional property called directedface, whose value is a face that is on the coboundary of the edge. To distinguish between faces on the left and right of e1, each of the coboundary faces is assigned an orientation. A positive orientation corresponds to face f2 and a negative orientation to face f1. Note that if the orientation of a directedface on the coboundary of an edge is "+", the face must contain the directededge with the same orientation "+" in its boundary list of directed edges. Encoding of the edge e1 that describes its coboundary information in addition to its boundary information is as follows: <gml:edge gml:id="e1"> xlink:href="#n1"/> xlink:href="#n2"/> <gml:directedface orientation="-" xlink:href="#f2"/> <gml:directedface orientation="+" xlink:href="#f1"/> </gml:edge> Similarly, each node is encoded with a coboundary list of directededges to represent edges incident upon the node. A positive orientation on directed- Edge corresponds to an edge that points toward the node and a negative orientation to an edge emanating Vol.11 No.6, 2007 Journal of Advanced Computational Intelligence 703
4 Li, Y. et al. Table 1. Node table schema. Table 3. Face table schema. NodeID NGtype EdgeID1 EdgeOrientation1 EdgeID2 EdgeOrientation2... FaceID FGtype DirEdgeID1 DirEdgeOri1 DirEdgeID2 DirEdgeOri2... Table 2. Edge table schema. equal disjoint overlap cross EdgeID EGtype BNodeID TNodeID LPolygonID RPolygonID within contain touch intersection from the node. Node n2 from Fig. 2 can, for example, be encoded as follows: <gml:node gml:id="n2"> xlink:href="#e1"/> <gml:directededge orientation="-" xlink:href="#e2"/> <gml:directededge orientation="-" xlink:href="#e4"/> </gml:node> 3.3. Data Storage Based on topology data analysis in GML, a database storage schema is designed to store GML topology data Node Table Schema Design The node table schema (Table 1) is designed so that NodeID represents the gml:id attribute, e.g., the id number of node n4 is n4; NGtype describes the spatial location of node n4; EdgeID1and EdgeID2 are the ID numbers of edges associated with this node; and EdgeOrientation1and EdgeOrientation2 are orientations a positive orientation on directededge corresponding to an edge that points toward the node and a negative orientation corresponding to an edge emanating from the node. The number of edges associated with a node may be uncertain, and this uncertainty can not be resolved in relational database. Because the spatial database is objectoriented, however, it supports user-defined data types and solves the uncertainty problem Edge Table Schema Design The edge table schema (Table 2) is designed so that EdgeID is the unique ID number for this edge, e.g., the ID of edge e1 is e1; EGtype is the location representing edge e1; BNodeID is the ID number of the start node for this edge; TNodeID is the ID number of the end node for this edge; LPolygonID is the ID number of the left face for this edge; and RPolygonID is the ID number of the right face Face Table Schema Design The face table schema (Table 3) is designed so that FaceID is the unique ID number for this face; FGtype is Fig. 3. Few faces topology operation. the location of the face; DirEdgeID1, and DirEdgeID2 are the ID of the directed edge on its boundary; and DirEdge- Ori1 and DirEdgeOri2 represent orientations of each directed edge on the boundary of a face. As in node table design, the number of directed edges consisting of the face is uncertain, so we use this objectoriented technique to define the data type Relationship After GML topology data is stored in a spatial database, topology data is put to such uses as spatial analysis and operation. data is very useful because many spatial modeling operations require only topological information not coordinate locations. Finding an optimal path between two points, for example, requires a list of mutually connected arcs or lines and the cost required to traverse them in each direction. It is operated using stored topology. A road feature may consist of many edges, an area feature such as a park may consist of many faces, and some nodes may not be associated with point features. The Open GIS Consortium has specified eight topological and set predicates, i.e., equal, disjoint, intersect, touch, cross, within, contain, and overlap. We express the relationship between them are shown in the example in Fig. 3. If the interior and boundary of two geometries are spatially equal, they are topologically equal. If the boundaries and interior do not intersect, they are topologically disjoint. If geometries are not disjoint, they intersect. If boundaries of two surfaces intersect but interiors do not, they touch. If the interior of a surface intersects a curve, they topologically cross. If the interior of the given geometry does not intersect the exterior of another geometry, they are topologically within. If the given geometry contains another given geometry, they topologically contain; If the interiors of two geometries have a nonempty intersection, they topologically overlap. A feature with topology and geometry properties is represented one of two ways in a GML application schema as a feature with a two-dimensional spatial extent having both geometry and topology valued properties, and as a feature with a two-dimensional spatial extent having topology valued properties with embedded geometry valued properties (Fig. 4). 704 Journal of Advanced Computational Intelligence Vol.11 No.6, 2007
5 GML Data Storage Schema Design Node Edge Face TopoSolid property Feature Sub type Sub type property Feature (a) Node Edge Face TopoSolid (b) Geometry property Geometry Sub type PointProperty CurveProperty SurfaceProperty SolidProperty Point Curve Surface Solid Point Curve Surface Solid Fig. 4. Feature representation. (a) Feature with twodimensional spatial extent, having both geometry and topology valued properties. (b) Feature with two-dimensional spatial extent, having topology valued properties with embedded geometry valued properties. W. Chesterton Ward Milton Ward A14 F. Chesterton Ward Fig. 5. Administrative districts. The feature with a two-dimensional spatial extent and having both geometry and topology valued properties is used to produce a map from geometric data captured in the spatial model, so it would be easier for an application to extract the geometric data. The feature with a two-dimensional spatial extent and having topology valued properties with embedded geometry valued properties is used for a query that may involve both topology and geometry, such as an optimal route query. We use the second feature for our application. Fig. 4 shows a realworld example of point, line, and area features associated with the topology in Fig. 2. The smallest administrative district in our example is the ward. The manifold corresponds to three wards (Fig. 5) or administrative districts. Each face is used by a ward, e.g., Milton Ward at f1, W. Chesterton Ward at f2, and F. Chesterton Ward at f3, and A14 Road at edges e1 and e2. These administrative districts is encoded as follows:... <gml:featurecollection> <gml:boundedby> <gml:box> <gml:coordinates> 0,0 </gml:coordinates> <gml:coordinates> 100,100 </gml:coordinates> </gml:box> </gml:boundedby> <gml:featuremember> <Ward fid="w1"> <gml:name>milton</gml:name> <gml:directedtoposurface orientation="+"> <gml:toposurface> <gml:directedface orientation="+" xlink:href="simplemanifold.xml#f1"/> </gml:toposurface> </gml:directedtoposurface> </Ward> </gml:featuremember> <gml:featuremember> <Ward fid="w2"> <gml:name>w. Chesterton</gml:name> <gml:directedtoposurface orientation="+"> <gml:toposurface> <gml:directedface orientation="+" xlink:href="simplemanifold.xml#f2"/> </gml:toposurface> </gml:directedtoposurface> </Ward> </gml:featuremember> <gml:featuremember> <Ward fid="w3"> <gml:name>f. Chesterton</gml:name> <gml:directedtoposurface orientation="+"> <gml:toposurface> <gml:directedface orientation="+" xlink:href="simplemanifold.xml#f3"/> </gml:toposurface> </gml:directedtoposurface> </Ward> </gml:featuremember> <gml:featuremember> <Road fid="r11"> <gml:name>a14</gml:name> <gml:directedtopocurve orientation="+"> <gml:topocurve> xlink:href="simplemanifold.xml#e1"/> xlink:href="simplemanifold.xml#e2"/> </gml:topocurve> Vol.11 No.6, 2007 Journal of Advanced Computational Intelligence 705
6 Li, Y. et al. GML application document Data Loader data storage rules GML topology query Query Translator SQL query/ results Query results Table 4. Different types of topology queries. Q1 Equal (Milton, W.Chesterton)? Q2 Disjoint (Milton, W.Chesterton)? Q3 Touch (Milton, W.Chesterton)? Features w w w Reference n n n e e e f f f Node Edge Face Q4 Q5 Q6 Contain (Milton, W.Chesterton)? Within (Milton, W.Chesterton)? Overlap (Milton, W.Chesterton)? topology queries spatial comparation Fig. 6. GML application document with topology data. </gml:directedtopocurve> </Road> </gml:featuremember> </gml:featurecollection> We stored this GML application document in the database using our system (Fig. 6). If we want to know the spatial relationship between Milton Ward and W. Chesterton Ward, e.g., whether they are mutually adjacent, we need only to know whether they have a mutual coboundary. Milton Ward references previously defined topology face f1. W. Chesterton Ward references topology face f2, so, we get edge ID from the edge table. f1 has the edges e1, e2, and e3. f2 has the edges e5, e4, and e1. They have coboundary e1, so they are adjacent, i.e., they touch in a spatial relationship. To identify all Wards passed by Road A14, we must find the edge sequence consisting of Road A14, i.e., e1, e2, then find unions f1, f2, and f3 of the left and right faces of the edge sequence, Milton Ward references topology face f1, W. Chesterton Ward references topology face f2, and F. Chesterton Ward references topology face f3, identifying wards as Milton, W. Chesterton, and F. Chesterton. data makes spatial analysis more efficient. A spatial query requires a spatial index to be traversed and a number of compute-intensive geometric comparisons. Relationships such as overlap (share face) and touch (share edge) are held as references within the topology model. These may be traversed very quickly by table joins to identify other features that use the same node, edge, or face. Using topology improves performance by more than one order of magnitude, reducing execution time for a complex query from over a minute to just a few seconds. Topological operations also prevent the choice of coordinates for the database from affecting results of topological operations. Time cost Q1 Q2 Q3 Q4 Q5 Q6 Different queries Fig. 7. Cost time for different queries. We compared time consumed between a query using topology data and one using spatial comparison. A set of queries is first used to study the efficiency of topology approaches involving a spatial relationship query: equal, disjoint, and touch contain within and overlap (Table 4). Elapsed query times are shown in Fig. 7. In conclusion, using topology data speeded up retrieval and decreased time cost. Spatial queries relying on topological references alone are thus expected to perform much better in the topological model than in the geometrical model. 4. Conclusion We have analyzed GML topology data and designed the GML topology data storage schema based on earlier work, using a concrete example for comparing spatial queries. The structure added to data enables many spatial queries to be answered more quickly by examining topology. In projected work, we plan to provide topology analysis to make GML query processing more efficient. 706 Journal of Advanced Computational Intelligence Vol.11 No.6, 2007
7 GML Data Storage Schema Design Acknowledgements This work was supported by the National Natural Science Foundation of China under grants and and the Program for New Century Excellent Talents of the University of China under grant NCET References: [1] OpenGIS Consortium, GML Specifications, available at [2] Y. Li, J. Li, and S. Zhou, GML Storage, A Spatial Database Approach, ER (Workshops), pp , [3] E. Hoel, S. Menon, and S. Morehouse, Building Robust Topologies, In Advances in Spatial and Temporal Databases, Proceedings of the 8th International Symposium on Spatial and Temporal Databases, SSTD, Santorini Island, Greece, Springer-Verlag Lecture Notes in Computer Science 2750, [4] S. Ramage and P. Woodsford, The Benefits of in the Database, 2002, available at [5] M. Egenhofer, A. Frank, and J. Jackson, A Topological Data Model for Spatial Databases, Design and Implementation of Large Spatial Databases, Lecture Notes in Computer Science, 409, pp , [6] Galdos System Inc., Developing and Managing GML Application Schemas, 2003, available at /devcouner devnetwork/componects/gml bpv1.3 E.pdf. [7] J. E. Corcoles and P. Gonzalez, A Specification of a Spatial Query Language over GML, pp , [8] W. Chung and H.-Y. Bae, A Specification of a Moving Objects Query Language over GML for Location-Based Services, In Advanced Web Technologies and Applications: 6th Asia-Pacific Web Conference, APWeb, pp , [9] J. Guan, S. Zhou, J. Chen, X. Chen, Y. An, W. Yu, R. Wang, and X. Liu, Ontology-based GML schema matching for information integration, In: Proceedings of 2nd IEEE International Conference on Machine Learning and Cybernetics, Vol.4, pp , IEEE CS, Xian, China, November [10] Z. Guo, S. Zhou, Z. Xu, and A. Zhou, G2ST: A Novel Method to Transform GML to SVG, In: Proceedings of ACM-GIS 2003, ACM Press, November Yuzhen Li Ph.D. candidate, Graduate School of Science and Technology, Chiba University 2003 Received the B.C. degree from Wuhan University, P.R.China 2005 Received the M.S. degree from Wuhan University, P.R.China Ph.D. student of the Graduate School of Science and Technology, Chiba University, Chiba, Japan theory and application of spatial database and computer vision, etc. Jianming Lu Associate Professor, Graduate School of Science and Technology, Chiba University 1990 Received the M.S. degree from Chiba University, Japan 1993 Received the Ph.D. degree from Chiba University, Japan Associate in the Department of Information and Computer Sciences, Chiba University, Chiba, Japan Graduate School of Science and Technology, Chiba University Associate Professor in the Graduate School of Science and Technology, Chiba University theory and applications of digital signal processing and control theory Jihong Guan Professor, Department of Computer Science and Technology, Tongji University Shanghai , China Received B.S. in Computer Science from Central China Normal University Lecturer in Wuhan University Received M.S. in Computer Applications from Wuhan Technical University of Surveying and Mapping (WTUSM) Associate professor in Wuhan University Received Ph.D. in Photogrammetry and Remote Sensing from Wuhan University Professor in Wuhan University spatial database, text database, GIS, data mining and information retrieval Up to date, she has published more than 60 articles in international and domestic journals and conferences. Membership in Academic Societies: Senior member of China Computer Federation Vol.11 No.6, 2007 Journal of Advanced Computational Intelligence 707
8 Li, Y. et al. Mingying Fan Ph.D. candidate, Graduate School of Science and Technology, Chiba University Takashi Yahagi Professor, Graduate School of Science and Technology, Chiba University 2001 Received B.C. degree from Daqing petroleum Institute and Harbin Engineering University, P.R.China 2004 Received M.S. degree from Daqing petroleum Institute and Harbin Engineering University, P.R.China Ph.D. student, Graduate School of Science and Technology, Chiba University, Chiba, Japan computer vision and image processing, etc. Ayman Haggag Ph.D. candidate, Graduate School of Science and Technology, Chiba University 1994 Received B.Sc. degree from Ain Shams University, Egypt 1997 Received M.Sc. degree from Eindhoven University of Technology, The Netherlands Industrial Education College, Helwan University, Egypt Ph.D. student, Graduate School of Science and Technology, Chiba University, Japan image coding and security of data and images over networks and communication channels 1966 Received B.S. degree in electronics from the Tokyo Institute of Technology, Tokyo, Japan 1968 Received M.S. degree in electronics from the Tokyo Institute of Technology, Tokyo, Japan 1971 Received Ph.D. degree in electronics from the Tokyo Institute of Technology, Tokyo, Japan Lecturer in the Department of Electronics at Chiba University, Chiba, Japan Associate Professor in the Department of Electronics at Chiba University, Chiba, Japan Professor in the Department of Electrical Engineering at Chiba University, Chiba, Japan Department of Information and Computer Sciences Graduate School of Science and Technology, Chiba University theory and applications of digital signal processing and other related areas Theory of Digital Signal Processing, Vols.1 3, 1985, 1985, 1986 Digital Signal Processing and Basic Theory, 1996 Digital Filters and Signal Processing, 2001 Kalman Filter and Adaptive Signal Processing, 2005 co-author of the Digital Signal Processing of Speech and Images, 1996 VLSI and Digital Signal Processing, 1997 Multimedia and Digital Signal Processing, 1997 Neural Network and Fuzzy Signal Processing, 1998 Communications and Digital Signal Processing, 1999 Fast Algorithms and Parallel Signal Processing, Corona Pub., Tokyo, Japan, 2000 Editor of the Library of Digital Signal Processing, Corona Pub., Tokyo, Japan Membership in Academic Societies: President of the Research Institute of Signal Processing, Japan, and also the Editor-in-Chief of the Journal of Signal Processing (1997-) The Institute of Electrical and Electronics Engineers, Inc. (IEEE), USA The Institute of Electronics, Information and Communication Engineers (IEICE), Japan The Research Institute of Signal Processing (RISP), Japan 708 Journal of Advanced Computational Intelligence Vol.11 No.6, 2007
SPATIAL DATA STORAGE AND TOPOLOGY IN THE REDESIGNED MAF/TIGER SYSTEM
SPATIAL DATA STORAGE AND TOPOLOGY IN THE REDESIGNED MAF/TIGER SYSTEM David Galdi Abstract: Since the late 1980 s, the Geography Division has utilized the TIGER system to provide geographic support for
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 informationOGC Simple Features (for SQL and XML/GML)
Daniel Wirz, Department of Geography - GIS Division, University of Zurich mailto:wirz@geo.unizh.ch January 2004 What,...? Introduction Develop publicly available geoprocessing specifications. Open interfaces
More informationDEVELOPING A THREE-DIMENSIONAL TOPOLOGICAL DATA MODEL
DEVELOPING A THREE-DIMENSIONAL TOPOLOGICAL DATA MODEL Saadi MESGARI International Institute for Aerospace Survey and Earth Sciences (ITC) The Netherlands Mesgari@itc.nl Working Group IC/16 KEY WORDS: Data
More informationMapping Network Relationships from Spatial Database Schemas to GML Documents
Mapping Network Relationships from Spatial Database Schemas to GML Documents André C. Hora, Clodoveu A. Davis Jr., Mirella M. Moro Universidade Federal de Minas Gerais, Brazil {andrech,clodoveu,mirella}@dcc.ufmg.br
More informationThree-Dimensional Reconstruction from Projections Based On Incidence Matrices of Patterns
Available online at www.sciencedirect.com ScienceDirect AASRI Procedia 9 (2014 ) 72 77 2014 AASRI Conference on Circuit and Signal Processing (CSP 2014) Three-Dimensional Reconstruction from Projections
More informationOPERATORS FOR CELL TUPLE-BASED SPATIOTEMPORAL DATA MODEL
OPERTORS FOR CELL TUPLE-BSED SPTIOTEMPORL DT MODEL le Raza ESRI 80 New York Street, Redlands, California 97-800, US Tel.: +-909-79-85 (ext. 009) Fax: +-909-07-067 araza@esri.com Commission IV, WG IV/ KEY
More informationA 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 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 informationTopological and temporal modelling in GML
Topological and temporal modelling in GML Wilko Quak, Marian de Vries Delft University of Technology Jaffalaan 9 2628 BX Delft The Netherlands w.quak@otb.tudelft.nl, m.d.vries@otb.tudelft.nl Abstract GML
More informationMinistry of Sustainable Resource Management
Ministry of Sustainable Resource Management GML Foundation Project Developing and Managing GML Application Schemas A Best Practices Guide prepared by Galdos Systems Inc. Requested and Funded by: The Ministry
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 informationDERIVING TOPOLOGICAL RELATIONSHIPS BETWEEN SIMPLE REGIONS WITH HOLES
DERIVING TOPOLOGICAL RELATIONSHIPS BETWEEN SIMPLE REGIONS WITH HOLES Mark McKenney, Reasey Praing, and Markus Schneider Department of Computer and Information Science & Engineering, University of Florida
More informationStandards, GML and AIXM. Dr. David Burggraf Vice President Galdos Systems Inc
Standards, and AIXM Dr. David Burggraf Vice President Galdos Systems Inc Copyright Galdos Systems Inc. May 6, 2010 Geography Markup Language: What is it? A modeling language for geographic features A set
More informationLecturer 2: Spatial Concepts and Data Models
Lecturer 2: Spatial Concepts and Data Models 2.1 Introduction 2.2 Models of Spatial Information 2.3 Three-Step Database Design 2.4 Extending ER with Spatial Concepts 2.5 Summary Learning Objectives Learning
More informationA Framework of Feature-Level Transportation Geospatial Data Sharing Systems
A Framework of Feature-Level Transportation Geospatial Data Sharing Systems Zhong-Ren Peng, Ph.D. Director Center for Advanced Spatial Information Research Associate Professor Department of Urban Planning
More informationResearch Article Polygon Morphing and Its Application in Orebody Modeling
Mathematical Problems in Engineering Volume 212, Article ID 732365, 9 pages doi:1.1155/212/732365 Research Article Polygon Morphing and Its Application in Orebody Modeling Hacer İlhan and Haşmet Gürçay
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 informationImplementing Topological Predicates for Complex Regions Introduction
Implementing Topological Predicates for Complex Regions Markus Schneider University of Florida Department of Computer and Information Science and Engineering Gainesville, FL 326, USA mschneid@cise.ufl.edu
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 informationA GML SCHEMA MAPPING APPROACH TO OVERCOME SEMANTIC HETEROGENEITY IN GIS
A GML SCHEMA MAPPING APPROACH TO OVERCOME SEMANTIC HETEROGENEITY IN GIS Manoj Paul, S. K. Ghosh School of Information Technology, Indian Institute of Technology, Kharagpur 721302, India - (mpaul, skg)@sit.iitkgp.ernet.in
More informationDERIVING SPATIOTEMPORAL RELATIONS FROM SIMPLE DATA STRUCTURE
DERIVING SPATIOTEMPORAL RELATIONS FROM SIMPLE DATA STRUCTURE Ale Raza ESRI 380 New York Street, Redlands, California 9373-800, USA Tel.: +-909-793-853 (extension 009) Fax: +-909-307-3067 araza@esri.com
More informationSVENSK STANDARD SS-ISO :2004. Geografisk information Hantering av enklare objekt Del 1: Arkitektur (ISO :2004, IDT)
SVENSK STANDARD Fastställd 2004-09-24 Utgåva 1 Geografisk information Hantering av enklare objekt Del 1: Arkitektur (ISO 19125-1:2004, IDT) Geographic information Simple feature access Part 1: Common architecture
More informationChapter 3. Sukhwinder Singh
Chapter 3 Sukhwinder Singh PIXEL ADDRESSING AND OBJECT GEOMETRY Object descriptions are given in a world reference frame, chosen to suit a particular application, and input world coordinates are ultimately
More informationUsing level-2 fuzzy sets to combine uncertainty and imprecision in fuzzy regions
Using level-2 fuzzy sets to combine uncertainty and imprecision in fuzzy regions Verstraete Jörg Abstract In many applications, spatial data need to be considered but are prone to uncertainty or imprecision.
More informationSongklanakarin Journal of Science and Technology SJST R1 Ghareeb SPATIAL OBJECT MODELING IN SOFT TOPOLOGY
Songklanakarin Journal of Science and Technology SJST-0-00.R Ghareeb SPATIAL OBJECT MODELING IN SOFT TOPOLOGY Journal: Songklanakarin Journal of Science and Technology Manuscript ID: SJST-0-00.R Manuscript
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 informationOpen Geospatial Consortium Inc.
Open Geospatial Consortium Inc. Date: 2016-12-05 Reference number of this OGC document: OGC 07-036r1 Version: 3.2.2 Category: OpenGIS Standard Editor: Clemens Portele OpenGIS Geography Markup Language
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 informationAn Introduction to Spatial Databases
An Introduction to Spatial Databases R. H. Guting VLDB Journal v3, n4, October 1994 Speaker: Giovanni Conforti Outline: a rather old (but quite complete) survey on Spatial DBMS Introduction & definition
More informationGISCI GEOSPATIAL CORE TECHNICAL KNOWLEDGE EXAM CANDIDATE MANUAL AUGUST 2017
GISCI GEOSPATIAL CORE TECHNICAL KNOWLEDGE EXAM CANDIDATE MANUAL AUGUST 2017 This document provides information about the GISCI Geospatial Core Technical Knowledge Exam, now a requirement for GISCI GISP
More informationContent Based Image Retrieval system with a combination of Rough Set and Support Vector Machine
Shahabi Lotfabadi, M., Shiratuddin, M.F. and Wong, K.W. (2013) Content Based Image Retrieval system with a combination of rough set and support vector machine. In: 9th Annual International Joint Conferences
More informationProceedings of the 5th WSEAS International Conference on Telecommunications and Informatics, Istanbul, Turkey, May 27-29, 2006 (pp )
A Rapid Algorithm for Topology Construction from a Set of Line Segments SEBASTIAN KRIVOGRAD, MLADEN TRLEP, BORUT ŽALIK Faculty of Electrical Engineering and Computer Science University of Maribor Smetanova
More informationISSUES IN SPATIAL DATABASES AND GEOGRAPHICAL INFORMATION SYSTEMS (GIS) HANAN SAMET
zk0 ISSUES IN SPATIAL DATABASES AND GEOGRAPHICAL INFORMATION SYSTEMS (GIS) HANAN SAMET COMPUTER SCIENCE DEPARTMENT AND CENTER FOR AUTOMATION RESEARCH AND INSTITUTE FOR ADVANCED COMPUTER STUDIES UNIVERSITY
More informationTriangle Graphs and Simple Trapezoid Graphs
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 18, 467-473 (2002) Short Paper Triangle Graphs and Simple Trapezoid Graphs Department of Computer Science and Information Management Providence University
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 informationISSN: (Online) Volume 2, Issue 3, March 2014 International Journal of Advance Research in Computer Science and Management Studies
ISSN: 2321-7782 (Online) Volume 2, Issue 3, March 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Paper / Case Study Available online at: www.ijarcsms.com
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 informationSPATIAL RANGE QUERY. Rooma Rathore Graduate Student University of Minnesota
SPATIAL RANGE QUERY Rooma Rathore Graduate Student University of Minnesota SYNONYMS Range Query, Window Query DEFINITION Spatial range queries are queries that inquire about certain spatial objects related
More informationTopic 5: Raster and Vector Data Models
Geography 38/42:286 GIS 1 Topic 5: Raster and Vector Data Models Chapters 3 & 4: Chang (Chapter 4: DeMers) 1 The Nature of Geographic Data Most features or phenomena occur as either: discrete entities
More informationMultidimensional (spatial) Data and Modelling (2)
Multidimensional (spatial) Data and Modelling (2) 1 Representative operations on maps l l l l l are operations on layers used in maps (all 2-d). Synonyms f. map: layer, spatial partition Def. properties:
More informationSecrets of the JTS Topology Suite
Secrets of the JTS Topology Suite Martin Davis Refractions Research Inc. Overview of presentation Survey of JTS functions and components Tips for using JTS as an engine for processing Geometry Tips for
More informationMulti-dimensional database design and implementation of dam safety monitoring system
Water Science and Engineering, Sep. 2008, Vol. 1, No. 3, 112-120 ISSN 1674-2370, http://kkb.hhu.edu.cn, e-mail: wse@hhu.edu.cn Multi-dimensional database design and implementation of dam safety monitoring
More informationVisualizing and Animating Search Operations on Quadtrees on the Worldwide Web
Visualizing and Animating Search Operations on Quadtrees on the Worldwide Web František Brabec Computer Science Department University of Maryland College Park, Maryland 20742 brabec@umiacs.umd.edu Hanan
More informationMultidimensional Data and Modelling - DBMS
Multidimensional Data and Modelling - DBMS 1 DBMS-centric approach Summary: l Spatial data is considered as another type of data beside conventional data in a DBMS. l Enabling advantages of DBMS (data
More informationA Study on Metadata Extraction, Retrieval and 3D Visualization Technologies for Multimedia Data and Its Application to e-learning
A Study on Metadata Extraction, Retrieval and 3D Visualization Technologies for Multimedia Data and Its Application to e-learning Naofumi YOSHIDA In this paper we discuss on multimedia database technologies
More informationGenerating Tool Paths for Free-Form Pocket Machining Using z-buffer-based Voronoi Diagrams
Int J Adv Manuf Technol (1999) 15:182 187 1999 Springer-Verlag London Limited Generating Tool Paths for Free-Form Pocket Machining Using z-buffer-based Voronoi Diagrams Jaehun Jeong and Kwangsoo Kim Department
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 informationON DECOMPOSITION OF FUZZY BԐ OPEN SETS
ON DECOMPOSITION OF FUZZY BԐ OPEN SETS 1 B. Amudhambigai, 2 K. Saranya 1,2 Department of Mathematics, Sri Sarada College for Women, Salem-636016, Tamilnadu,India email: 1 rbamudha@yahoo.co.in, 2 saranyamath88@gmail.com
More informationCurriki Geometry Glossary
Curriki Geometry Glossary The following terms are used throughout the Curriki Geometry projects and represent the core vocabulary and concepts that students should know to meet Common Core State Standards.
More informationManaging Method of Spatial Data in Relational Database Management Systems
1000-9825/2002/13(01)0008-07 2002 Journal of Software Vol.13, No.1 Managing Method of Spatial Data in Relational Database Management Systems ZHU Tie-wen 1,2, ZHONG Zhi-nong 1, JING Ning 1 1 (School of
More informationEfficient Path Finding Method Based Evaluation Function in Large Scene Online Games and Its Application
Journal of Information Hiding and Multimedia Signal Processing c 2017 ISSN 2073-4212 Ubiquitous International Volume 8, Number 3, May 2017 Efficient Path Finding Method Based Evaluation Function in Large
More informationOpen Access The Three-dimensional Coding Based on the Cone for XML Under Weaving Multi-documents
Send Orders for Reprints to reprints@benthamscience.ae 676 The Open Automation and Control Systems Journal, 2014, 6, 676-683 Open Access The Three-dimensional Coding Based on the Cone for XML Under Weaving
More informationENCODING AND DECODING OF PLANAR MAPS THROUGH CONFORMING DELAUNAY TRIANGULATIONS
ENCODING AND DECODING OF PLANAR MAPS THROUGH CONFORMING DELAUNAY TRIANGULATIONS Edward Verbree Delft University of Technology, Research Institute OTB, Section GIS technology, Jaffalaan 9, 2628 BX, Delft,
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 informationGML, WFS and SVG: A New Frontier of Internet GIS
GML, WFS and SVG: A New Frontier of Internet GIS Zhong-Ren Peng Director Center for Advanced Spatial Information Research Associate Professor Department of Urban Planning University of Wisconsin-Milwaukee
More informationMulti-Objective Path Search Problem Based on an Extended Network Model
Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 2014 Multi-Objective Path Search Problem Based on an Extended Network
More informationMicrosoft SQL Server CLR Types Serialization Formats
[MS-SSCLRT]: Intellectual Property Rights Notice for Open Specifications Documentation Technical Documentation. Microsoft publishes Open Specifications documentation for protocols, file formats, languages,
More informationFDO Data Access Technology at a Glance
Autodesk Geospatial FDO Data Access Technology at a Glance Work seamlessly with your geospatial data whatever the format 1 The Challenge The growing need for openness and interoperability between traditional
More informationHigh Capacity Reversible Watermarking Scheme for 2D Vector Maps
Scheme for 2D Vector Maps 1 Information Management Department, China National Petroleum Corporation, Beijing, 100007, China E-mail: jxw@petrochina.com.cn Mei Feng Research Institute of Petroleum Exploration
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 informationTHE description and representation of the shape of an object
Enhancement of Shape Description and Representation by Slope Ali Salem Bin Samma and Rosalina Abdul Salam Abstract Representation and description of object shapes by the slopes of their contours or borders
More informationThe Principle of Duality in Data Structures and Euler Operators of Solid Modelers
The 3rd International Conference on Design Engineering and Science, ICDES 2014 Pilsen, Czech Republic, August 31 September 3, 2014 The Principle of Duality in Data Structures and Euler Operators of Solid
More informationComputational Geometry for Imprecise Data
Computational Geometry for Imprecise Data November 30, 2008 PDF Version 1 Introduction Computational geometry deals with algorithms on geometric inputs. Historically, geometric algorithms have focused
More informationData Models and Data processing in GIS
PDHonline Course L155G (5 PDH) Data Models and Data processing in GIS Instructor: Steve Ramroop, Ph.D. 2012 PDH Online PDH Center 5272 Meadow Estates Drive Fairfax, VA 22030-6658 Phone & Fax: 703-988-0088
More information5 MANAGING AND MODELLING OF 3D SPATIAL OBJECTS FOR URBAN ENVIROMENT
86 Advances toward 3D GIS 5 MANAGING AND MODELLING OF 3D SPATIAL OBJECTS FOR URBAN ENVIROMENT Siti Nur Awanis Mohamad Zulkifli Alias Abdul Rahman Department of Geoinformatics, Faculty of Geoinformation
More informationIntroduction to Spatial Database Systems. Outline
Introduction to Spatial Database Systems by Cyrus Shahabi from Ralf Hart Hartmut Guting s VLDB Journal v3, n4, October 1994 1 Outline Introduction & definition Modeling Querying Data structures and algorithms
More informationA Novel Method of Optimizing Website Structure
A Novel Method of Optimizing Website Structure Mingjun Li 1, Mingxin Zhang 2, Jinlong Zheng 2 1 School of Computer and Information Engineering, Harbin University of Commerce, Harbin, 150028, China 2 School
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 informationγ 2 γ 3 γ 1 R 2 (b) a bounded Yin set (a) an unbounded Yin set
γ 1 γ 3 γ γ 3 γ γ 1 R (a) an unbounded Yin set (b) a bounded Yin set Fig..1: Jordan curve representation of a connected Yin set M R. A shaded region represents M and the dashed curves its boundary M that
More information4/7/2009. Model: Abstraction of reality following formal rules e.g. Euclidean space for physical space
Model: Abstraction of reality following formal rules e.g. Euclidean space for physical space At different levels: mathematical model (Euclidean space) conceptual design model (ER model) data model (design)
More informationElastic Bands: Connecting Path Planning and Control
Elastic Bands: Connecting Path Planning and Control Sean Quinlan and Oussama Khatib Robotics Laboratory Computer Science Department Stanford University Abstract Elastic bands are proposed as the basis
More informationMicrosoft SQL Server CLR Types Serialization Formats
[MS-SSCLRT]: Intellectual Property Rights Notice for Open Specifications Documentation Technical Documentation. Microsoft publishes Open Specifications documentation for protocols, file formats, languages,
More informationORGANIZATION AND REPRESENTATION OF OBJECTS IN MULTI-SOURCE REMOTE SENSING IMAGE CLASSIFICATION
ORGANIZATION AND REPRESENTATION OF OBJECTS IN MULTI-SOURCE REMOTE SENSING IMAGE CLASSIFICATION Guifeng Zhang, Zhaocong Wu, lina Yi School of remote sensing and information engineering, Wuhan University,
More informationShapefile Overlay Using a Doubly-Connected Edge List
Shapefile Overlay Using a Doubly-Connected Edge List Phil Katz and Stephen St.Vincent Swarthmore College 500 College Ave. Swarthmore, PA 19081 [pkatz1, sstvinc2]@swarthmore.edu Abstract We present a method
More informationResearch on Construction of Road Network Database Based on Video Retrieval Technology
Research on Construction of Road Network Database Based on Video Retrieval Technology Fengling Wang 1 1 Hezhou University, School of Mathematics and Computer Hezhou Guangxi 542899, China Abstract. Based
More informationAn Integrated Regression Testing Framework to Multi-Threaded Java Programs
An Integrated Regression Testing Framework to Multi-Threaded Java Programs Bixin Li 1,2, Yancheng Wang 1, and LiLi Yang 1 1 School of Computer Science and Engineering, Southeast University No.2 Sipailou
More informationResearch of 3D part reconstruction from Orthographic Projections Based on Solid Features
Research of 3D part reconstruction from Orthographic Projections Based on Solid Features HAO Yong-tao, Xu Wenyi (CAD Research Center, Tongji University, Shanghai 201804, China, haoyt@vip.sina.com) Abstract
More informationAn introduction and overview of Geography Markup Language
An introduction and overview of Geography Markup Language Lecturer: Dr Dan Cornford d.cornford@aston.ac.uk http://wiki.aston.ac.uk/dancornford CS3210, Geographic Information Systems, Aston University,
More informationTheme Identification in RDF Graphs
Theme Identification in RDF Graphs Hanane Ouksili PRiSM, Univ. Versailles St Quentin, UMR CNRS 8144, Versailles France hanane.ouksili@prism.uvsq.fr Abstract. An increasing number of RDF datasets is published
More informationUnderstanding and Working with the OGC Geopackage. Keith Ryden Lance Shipman
Understanding and Working with the OGC Geopackage Keith Ryden Lance Shipman Introduction - Introduction to Simple Features - What is the GeoPackage? - Esri Support - Looking ahead Geographic Things 3 Why
More informationSERVO - ACES Abstract
1 of 6 12/27/2004 2:33 PM 2 of 6 12/27/2004 2:33 PM Implementing GIS Grid Services for the International Solid Earth Research Virtual Observatory Galip Aydin (1), Marlon Pierce (1), Geoffrey Fox (1), Mehmet
More informationSEQUENTIAL PATTERN MINING FROM WEB LOG DATA
SEQUENTIAL PATTERN MINING FROM WEB LOG DATA Rajashree Shettar 1 1 Associate Professor, Department of Computer Science, R. V College of Engineering, Karnataka, India, rajashreeshettar@rvce.edu.in Abstract
More informationCHAPTER 10 Creating and maintaining geographic databases Overview Learning objectives Keywords and concepts Overview Chapter summary
CHAPTER 10 Creating and maintaining geographic databases (GEO 465/565 lecture covers material through Section 10.4 only. The rest is covered in GEO 580, Advanced GIS) Overview After people, the database
More informationTOWARDS A 3D SPATIAL QUERY LANGUAGE FOR BUILDING INFORMATION MODELS
TOWARDS A D SPATIAL QUERY LANGUAGE FOR BUILDING INFORMATION MODELS André Borrmann 1, Christoph van Treeck 1, and Ernst Rank 1 ABSTRACT The paper introduces the concept of a spatial query language for building
More informationSpatial Data Management
Spatial Data Management [R&G] Chapter 28 CS432 1 Types of Spatial Data Point Data Points in a multidimensional space E.g., Raster data such as satellite imagery, where each pixel stores a measured value
More informationDEFINITION OF OPERATIONS ON NETWORK-BASED SPACE LAYOUTS
CONVR2011, International Conference on Construction Applications of Virtual Reality, 2011 DEFINITION OF OPERATIONS ON NETWORK-BASED SPACE LAYOUTS Georg Suter, PhD, Associate Professor Department of Digital
More informationWhat we have covered?
What we have covered? Indexing and Hashing Data warehouse and OLAP Data Mining Information Retrieval and Web Mining XML and XQuery Spatial Databases Transaction Management 1 Lecture 6: Spatial Data Management
More informationGeometric Modeling Mortenson Chapter 11. Complex Model Construction
Geometric Modeling 91.580.201 Mortenson Chapter 11 Complex Model Construction Topics Topology of Models Connectivity and other intrinsic properties Graph-Based Models Emphasize topological structure Boolean
More informationINFACTORY : A RESTFUL API SERVER FOR EASILY CREATING INDOORGML
INFACTORY : A RESTFUL API SERVER FOR EASILY CREATING INDOORGML Hyemi Jeong, Hyung-gyu Ryoo, Ki-Joune Li Dept. of Computer Science&Engineering, Pusan National University, Kumjeong-Gu, 46241, Pusan, South
More informationL1-Spatial Concepts L1 - Spatial Concepts
L1 - Spatial Concepts NGEN06(TEK230) Algorithms in Geographical Information Systems Aim Understand the relationship between spatial queries and mathematical concepts. Know how topological relationships
More informationPresented by Kit Na Goh
Developing A Geo-Spatial Search Tool Using A Relational Database Implementation of the FGDC CSDGM Model Presented by Kit Na Goh Introduction Executive Order 12906 was issued on April 13, 1994 with the
More informationSTUDY OF THE DEVELOPMENT OF THE STRUCTURE OF THE NETWORK OF SOFIA SUBWAY
STUDY OF THE DEVELOPMENT OF THE STRUCTURE OF THE NETWORK OF SOFIA SUBWAY ИЗСЛЕДВАНЕ НА РАЗВИТИЕТО НА СТРУКТУРАТА НА МЕТРОМРЕЖАТА НА СОФИЙСКИЯ МЕТОПОЛИТЕН Assoc. Prof. PhD Stoilova S., MSc. eng. Stoev V.,
More informationBeyond PostGIS. New developments in Open Source Spatial Databases. Karsten Vennemann. Seattle
New developments in Open Source Spatial Databases Karsten Vennemann Seattle Talk Overview Intro Relational Databases PostGIS JASPA INGRES Geospatial MySQL Spatial Support HatBox a user space extension
More informationFigure 1: An Area Voronoi Diagram of a typical GIS Scene generated from the ISPRS Working group III/3 Avenches data set. 2 ARRANGEMENTS 2.1 Voronoi Di
Qualitative Spatial Relations using Arrangements for Complex Images M. Burge and W. Burger Johannes Kepler University, Department of Systems Science Computer Vision Laboratory, A-4040 Linz, Austria burge@cast.uni-linz.ac.at
More informationThe VirGIS Geographic Integration System
The VirGIS Geographic Integration System Omar Boucelma François-Marie Colonna Mehdi Essid LSIS-CNRS, Université Paul Cézanne - Aix-Marseille Avenue Escadrille Normandie-Niemen 13397 Marseille Cedex 20
More informationComputing the Topological Relationship of Complex Regions
Computing the Topological Relationship of Complex Regions Markus Schneider University of Florida epartment of Computer & Information Science & Engineering Gainesville, FL 32611, USA mschneid@cise.ufl.edu
More information3D SPATIAL OPERATIONS FOR GEO-DBMS: GEOMETRY VS. TOPOLOGY
3D SPATIAL OPERATIONS FOR GEO-DBMS: GEOMETRY VS. TOPOLOGY T.K. Chen a, *, A. Abdul-Rahman a, S. Zlatanov b a Department of Geoinformatics, Faculty of Geoinformation Science and Engineering, Universiti
More informationModeling Historical and Future Spatio-Temporal Relationships of Moving Objects in Databases
Modeling Historical and Future Spatio-Temporal Relationships of Moving Objects in Databases Reasey Praing & Markus Schneider University of Florida, Department of Computer & Information Science & Engineering,
More informationHierarchical Representation of 2-D Shapes using Convex Polygons: a Contour-Based Approach
Hierarchical Representation of 2-D Shapes using Convex Polygons: a Contour-Based Approach O. El Badawy, M. S. Kamel Pattern Analysis and Machine Intelligence Laboratory, Department of Systems Design Engineering,
More information