scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Augmenting comprehension of geological relationships by integrating 3D laser scanned hand samples within a GIS environment

01 Jun 2017-Computers & Geosciences (Pergamon)-Vol. 103, pp 152-163
TL;DR: A Web-based graphical user interface developed using Web AppBuilder for ArcGIS for digitized meso-scale 3D scans of geological samples to be viewed alongside the macro-scale environment to demonstrate the utility of such a tool in an age of increasing global data sharing.
About: This article is published in Computers & Geosciences.The article was published on 2017-06-01. It has received 13 citations till now. The article focuses on the topics: Sample (statistics).
Citations
More filters
Journal ArticleDOI
TL;DR: In this article, geotechnical investigations associated with the biogenic gas-rich ground at Sutong GIL Yangtze River Crossing Cable Tunnel have been summarized and the potential pathways for biogenetic gas to penetrate into the shield TBM and the excavated tunnel have been analyzed.

14 citations

Journal ArticleDOI
TL;DR: This paper presents a new method for creating topological information that it is called the Compact Abstract Cell Complexes (CACC) data structure for 3D spatial objects, to express in the most compact way the topology of a model in 3D without requiring the topological space to be discrete or geometric.
Abstract: In spatial science, the relationship between spatial objects is considered to be a vital element. Currently, 3D objects are often used for visual aids, improving human insight, spatial observations, and spatial planning. This scenario involves 3D geometrical data handling without the need for topological information. Nevertheless, in the near future, users will shift to more complex queries corresponding to the existing 2D spatial approaches. Therefore, having 3D spatial objects without having these relationships or topology is impractical for 3D spatial analysis queries. In this paper, we present a new method for creating topological information that we call the Compact Abstract Cell Complexes (CACC) data structure for 3D spatial objects. The idea is to express in the most compact way the topology of a model in 3D (or more generally in nD) without requiring the topological space to be discrete or geometric. This is achieved by storing all the atomic cycles through the models (null combinatorial homotopy classes). The main idea here is to store the atomic paths through the models as an ant experiences topology: each time the ant perceives a previous trace of pheromone, it knows it has completed a cycle. The main advantage of this combinatorial topological data structure over abstract simplicial complexes is that the storage size of the abstract cell cycles required to represent the geometric topology of a model is far lower than that for any of the existing topological data structures (including abstract simplicial cell cycles) required to represent the geometric decomposition of the same model into abstract simplicial cells. We provide a thorough comparative analysis of the storage sizes for the different topological data structures to sustain this.

11 citations

Journal ArticleDOI
TL;DR: In this paper , the authors present a case study aspiring to demonstrate the benefit of a multidisciplinary approach in the characterization of a hydrocarbon-contaminated site by collecting detailed multi-source data, collected via stratigraphic boreholes, laser-induced fluorescence (LIF) surveys, electrical resistivity tomography (ERT) prospecting, groundwater hydrochemical monitoring, and gas chromatography-mass spectrometry (GC-MS) analyses.

9 citations

Journal ArticleDOI
TL;DR: In this article, the authors presented a GMT-based scripting techniques of the cartographic data processing aimed at the comparative analysis of the bathymetry, sediment thickness, geologic objects and geophysical settings in the study area based on various datasets.
Abstract: Detailed mapping based on the high-resolution grids, such as GEBCO, ETOPO1, GlobSed, EGM-2008 is crucial for various domains of Earth sciences: geophysics, glaciology, Quaternary, sedimentology, geology, environmental science, geomorphology, etc. The study presented a GMT-based scripting techniques of the cartographic data processing aimed at the comparative analysis of the bathymetry, sediment thickness, geologic objects and geophysical settings in the study area based on various datasets. The study area is located in the Ross Sea, Antarctic. The highest values of the sediment thickness over 7,500 m are dominating in the southwest segment of the Ross Sea closer to the Victoria Land, followed by the region over the Ross Ice Shelf with values between 5,500 to 7,000 m (170°-175°W). The increased sediment thickness (2,500 to 3,000 m) was also mapped seen in the region NE off the Sulzberger Bay (70-75°S to 140-155°W), caused by the closeness of the Marie Bird Land ice coasts. A remarkable correlation between the gravity and the topography of the sea-land border in the Marie Bird Land area is well reflected in the coastal line and a set of the higher values in the free-air gravity. On the contrary, negative values (–60 to -80 mGal) are notable along the submarine toughs stretching parallel in the western part of the basin: e.g. the trough stretching in NW-SE direction in the 170°W-175°E, 65°S-68°S, between the 167°W-175°W, 70°S-72°S. Such correlations are clearly visible on the map, indicating geological lineaments and bathymetric depressions correlating with gravity grids. The paper contributes to the regional studies of the Ross Sea, the Antarctic and Polar region, and development of the cartographic technical methodologies by presenting an application of the GMT for thematic mapping.

6 citations


Cites methods from "Augmenting comprehension of geologi..."

  • ...…GMT is an economical means to process geospatial data and that a GMT-based cartographic output is feasible without the need of the expensive commercial ArcGIS used by several previous studies (e.g. ANDRIAMAMONJISOA & HUBERT-FERRARI, 2019a, 2019b; LEMENKOVA et al., 2012; WILLIAMS et al., 2018)....

    [...]

References
More filters
Journal ArticleDOI
Paul J. Besl1, H.D. McKay1
TL;DR: In this paper, the authors describe a general-purpose representation-independent method for the accurate and computationally efficient registration of 3D shapes including free-form curves and surfaces, based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point.
Abstract: The authors describe a general-purpose, representation-independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves and surfaces. The method handles the full six degrees of freedom and is based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point. The ICP algorithm always converges monotonically to the nearest local minimum of a mean-square distance metric, and the rate of convergence is rapid during the first few iterations. Therefore, given an adequate set of initial rotations and translations for a particular class of objects with a certain level of 'shape complexity', one can globally minimize the mean-square distance metric over all six degrees of freedom by testing each initial registration. One important application of this method is to register sensed data from unfixtured rigid objects with an ideal geometric model, prior to shape inspection. Experimental results show the capabilities of the registration algorithm on point sets, curves, and surfaces. >

17,598 citations

Journal ArticleDOI
TL;DR: The Structure-from-Motion (SfM) method as mentioned in this paper solves the camera pose and scene geometry simultaneously and automatically, using a highly redundant bundle adjustment based on matching features in multiple overlapping, offset images.

2,901 citations

Journal ArticleDOI
TL;DR: A heuristic method has been developed for registering two sets of 3-D curves obtained by using an edge-based stereo system, or two dense3-D maps obtained by use a correlation-based stereoscopic system, and it is efficient and robust, and yields an accurate motion estimate.
Abstract: A heuristic method has been developed for registering two sets of 3-D curves obtained by using an edge-based stereo system, or two dense 3-D maps obtained by using a correlation-based stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in many practical applications, some a priori knowledge exists which considerably simplifies the problem. In visual navigation, for example, the motion between successive positions is usually approximately known. From this initial estimate, our algorithm computes observer motion with very good precision, which is required for environment modeling (e.g., building a Digital Elevation Map). Objects are represented by a set of 3-D points, which are considered as the samples of a surface. No constraint is imposed on the form of the objects. The proposed algorithm is based on iteratively matching points in one set to the closest points in the other. A statistical method based on the distance distribution is used to deal with outliers, occlusion, appearance and disappearance, which allows us to do subset-subset matching. A least-squares technique is used to estimate 3-D motion from the point correspondences, which reduces the average distance between points in the two sets. Both synthetic and real data have been used to test the algorithm, and the results show that it is efficient and robust, and yields an accurate motion estimate.

2,177 citations

Proceedings ArticleDOI
09 Apr 1991
TL;DR: The authors propose an approach that works on range data directly and registers successive views with enough overlapping area to get an accurate transformation between views and performs a functional that does not require point-to-point matches.
Abstract: The problem of creating a complete model of a physical object is studied. Although this may be possible using intensity images, the authors use range images which directly provide access to three-dimensional information. The first problem that needs to be solved is to find the transformation between the different views. Previous approaches have either assumed this transformation to be known (which is extremely difficult for a complete model) or computed it with feature matching (which is not accurate enough for integration. The authors propose an approach that works on range data directly and registers successive views with enough overlapping area to get an accurate transformation between views. This is performed by minimizing a functional that does not require point-to-point matches. Details are given of the registration method and modeling procedure, and they are illustrated on range images of complex objects. >

2,157 citations

01 Jan 1992
TL;DR: In this article, a least-squares technique is used to estimate 3D motion from the point correspondences, which reduces the average distance between curves in two sets, and yields an accurate motion estimate.
Abstract: Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in many pratical applications, some a priori knowledge exists which considerably simplifies the problem. In visual navigation, for example, the motion between successive positions is usually either small or approximately known, but a more precise registration is required for environment modeling. The algorithm described in this report meets this need. Objects are represented by free-form curves, i.e., arbitrary spaces curves of the type found in practice. A curve is available in the form of a set of chained points. The proposed algorithm is based on iteratively matching points on one curve to the closest points on the other. A least-squares technique is used to estimate 3-D motion from the point correspondences, which reduces the average distance between curves in two sets. Both synthetic and real data have been used to test the algorithm, and the results show that it is efficient and robust, and yields an accurate motion estimate. The algorithm can be easily extended to solve similar problems such as 2-D curve matching and 3-D surface matching.

1,986 citations