About: Simple Features is a research topic. Over the lifetime, 113 publications have been published within this topic receiving 3193 citations. The topic is also known as: ISO 19125 & Simple Feature Access.
TL;DR: The sf package implements simple features in R, and has roughly the same capacity for spatial vector data as packages sp, rgeos and rgdal, and its place in the R package ecosystem, and the potential to connect R to other computer systems are described.
Abstract: Simple features are a standardized way of encoding spatial vector data (points, lines, polygons) in computers. The sf package implements simple features in R, and has roughly the same capacity for spatial vector data as packages sp, rgeos and rgdal. We describe the need for this package, its place in the R package ecosystem, and its potential to connect R to other computer systems. We illustrate this with examples of its use. What are simple features? Features can be thought of as “things” or objects that have a spatial location or extent; they may be physical objects like a building, or social conventions like a political state. Feature geometry refers to the spatial properties (location or extent) of a feature, and can be described by a point, a point set, a linestring, a set of linestrings, a polygon, a set of polygons, or a combination of these. The simple adjective of simple features refers to the property that linestrings and polygons are built from points connected by straight line segments. Features typically also have other properties (temporal properties, color, name, measured quantity), which are called feature attributes. Not all spatial phenomena are easy to represent by “things or objects”: continuous phenoma such as water temperature or elevation are better represented as functions mapping from continuous or sampled space (and time) to values (Scheider et al., 2016), and are often represented by raster data rather than vector (points, lines, polygons) data. Simple feature access (Herring, 2011) is an international standard for representing and encoding spatial data, dominantly represented by point, line and polygon geometries (ISO, 2004). It is widely used e.g. by spatial databases (Herring, 2010), GeoJSON (Butler et al., 2016), GeoSPARQL (Perry and Herring, 2012), and open source libraries that empower the open source geospatial software landscape including GDAL (Warmerdam, 2008), GEOS (GEOS Development Team, 2017) and liblwgeom (a PostGIS component, Obe and Hsu (2015)). The need for a new package Package sf (Pebesma, 2017) is an R package for reading, writing, handling and manipulating simple features in R, reimplementing the vector (points, lines, polygons) data handling functionality of packages sp (Pebesma and Bivand, 2005; Bivand et al., 2013), rgdal (Bivand et al., 2017) and rgeos (Bivand and Rundel, 2017). However, sp has some 400 direct reverse dependencies, and a few thousand indirect ones. Why was there a need to write a package with the potential to replace it? First of all, at the time of writing sp (2003) there was no standard for simple features, and the ESRI shapefile was by far the dominant file format for exchanging vector data. The lack of a clear (open) standard for shapefiles, the omnipresence of “bad” or malformed shapefiles, and the many limitations of the ways it can represent spatial data adversely affected sp, for instance in the way it represents holes in polygons, and a lack of discipline to register holes with their enclosing outer ring. Such ambiguities could influence plotting of data, or communication with other systems or libraries. The simple feature access standard is now widely adopted, but the sp package family has to make assumptions and do conversions to load them into R. This means that you cannot round-trip data, as of: loading data in R, manipulating them, exporting them and getting the same geometries back. With sf, this is no longer a problem. A second reason was that external libraries heavily used by R packages for reading and writing spatial data (GDAL) and for geometrical operations (GEOS) have developed stronger support for the simple feature standard. A third reason was that the package cluster now known as the tidyverse (Wickham, 2017, 2014), which includes popular packages such as dplyr (Wickham et al., 2017) and ggplot2 (Wickham, 2016), does not work well with the spatial classes of sp: • tidyverse packages assume objects not only behave like data.frames (which sp objects do by providing methods), but are data.frames in the sense of being a list with equally sized column vectors, which sp does not do. The R Journal Vol. XX/YY, AAAA 20ZZ ISSN 2073-4859 CONTRIBUTED RESEARCH ARTICLE 2 • attempts to “tidy” polygon objects for plotting with ggplot2 (“fortify”) by creating data.frame objects with records for each polygon node (vertex) were neither robust nor efficient. A simple (S3) way to store geometries in data.frame or similar objects is to put them in a geometry list-column, where each list element contains the geometry object of the corresponding record, or data.frame “row”; this works well with the tidyverse package family.
TL;DR: The motivation for GeoSPARQL is described, the current state of the art in industry and research is explained, followed by an example use case, and finally the implementation of GeoSParQL in the Parliament triple store is described.
Abstract: As the amount of Linked Open Data on the web increases, so does the amount of data with an inherent spatial context. Without spatial reasoning, however, the value of this spatial context is limited. Over the past decade there have been several vocabularies and query languages that attempt to exploit this knowledge and enable spatial reasoning. These attempts provide varying levels of support for fundamental geospatial concepts. GeoSPARQL, a forthcoming OGC standard, attempts to unify data access for the geospatial Semantic Web. As authors of the Parliament triple store and contributors to the GeoSPARQL specification, we are particularly interested in the issues of geospatial data access and indexing. In this paper, we look at the overall state of geospatial data in the Semantic Web, with a focus on GeoSPARQL. We first describe the motivation for GeoSPARQL, then the current state of the art in industry and research, followed by an example use case, and finally our implementation of GeoSPARQL in the Parliament triple store.
TL;DR: An overview of GML together with its implications for the geospatial web is given in this paper.
Abstract: Geography Markup Language (GML) is an XML application that provides a standard way to represent geographic information. GML is developed and maintained by the Open Geospatial Consortium (OGC), which is an international consortium consisting of more than 250 members from industry, government, and university departments. Many of the conceptual models described in the ISO 19100 series of geomatics standards have been implemented in GML, and it is itself en route to becoming an ISO Standard (TC/211 CD 19136). An overview of GML together with its implications for the geospatial web is given in this paper.
TL;DR: A practical framework for the semi-automatic construction of evaluation-functions for games based on a structured evaluation function representation is presented that is able to discover new features in a computationally feasible way.
Abstract: This paper discusses a practical framework for the semiautomatic construction of evaluation-functions for games. Based on a structured evaluation function representation, a procedure for exploring the feature space is presented that is able to discover new features in a computationally feasible way. Besides the theoretical aspects, related practical issues such as the generation of training positions, feature selection, and weight fitting in large linear systems are discussed. Finally, we present experimental results for Othello, which demonstrate the potential of the described approach.
TL;DR: The performance of the recogniser in terms of speed is far better than that of any other rule-based system due to the Neural Network approach employed and the basic limitation is that of the heuristics used to break down compound features into simple ones which are fed to the ANN.
Abstract: This work presents a Feature Recognition system developed using a previously trained Artificial Neural Network. The part description is taken from a B-rep solid modeller's data base. This description refers only to topological information about the faces in the part in the form of an Attributed Adjacency Graph. A set of heuristics is used for breaking down this compound feature graph into subgraphs, that correspond to simple features. Special representation patterns are then constructed for each of these subgraphs. These patterns are presented to a Neural Network which classifies them into feature classes: pockets, slots, passages, protrusions, steps, blind slots, corner pockets, and holes. The scope of instances/ variations of these features that can be recognised is very wide. A commercially available neural network modelling tool was used for training. The user interface to the neural network recogniser has been written in Pascal. The program can handle parts with up to 200 planar or curved faces. The performance of the recogniser in terms of speed is far better than that of any other rule-based system due to the Neural Network approach employed. The basic limitation is that of the heuristics used to break down compound features into simple ones which are fed to the ANN, but this is still a step ahead compared to other approaches.