Generated banner for Geomaster
Generated logo for Geomaster

Geomaster

K-DenseCommunityCreated by K-Dense Inc.

  • Skill
  • Tool integration
  • Science and research
  • MIT
  • Low risk
  • Has scripts

From the author

Supports geospatial research workflows for remote sensing, vector and raster GIS, spatial statistics, terrain and network analysis, and machine learning for Earth observation. Use when processing satellite imagery, aligning coordinate systems and raster grids, accessing STAC catalogs, analyzing geospatial time series, or implementing scientific GIS workflows in Python, R, Julia, JavaScript, C++, Java, Go, or Rust.
— the description by K-Dense Inc.

AutoGineer summary

Written by AutoGineer from the skill’s own files, not by the author

GeoMaster provides a structured approach to geospatial analysis, enabling researchers to handle complex workflows involving vector and raster data. It emphasizes rigorous data provenance, coordinate system verification, and alignment of spatial grids. The skill supports a wide range of tasks, including satellite imagery processing, terrain analysis, network routing, and machine learning for Earth observation, while providing best practices for data storage and cloud-based catalog access.

What it does

  • Provides standardized workflows for processing satellite imagery and raster data.
  • Facilitates coordinate system verification and transformation for spatial datasets.
  • Enables terrain analysis, including slope, aspect, and hillshade generation.
  • Supports vector analysis and spatial joins using GeoPandas.
  • Integrates with cloud-based STAC catalogs and Earth Engine for large-scale data discovery.
  • Offers recipes for efficient storage and handling of large geospatial datasets.

When to use it

  • When performing scientific GIS workflows in Python, R, Julia, or other supported languages.
  • When aligning disparate raster grids or coordinate systems for analysis.
  • When processing remote sensing data, such as calculating NDVI or performing image classification.
  • When conducting network analysis or spatial statistics on geographic data.
  • When accessing and processing data from cloud-based STAC catalogs.

Advantages

  • Promotes reproducible research through explicit provenance and metadata tracking.
  • Encourages rigorous handling of coordinate systems and data alignment.
  • Provides modular, reusable code recipes for common geospatial tasks.
  • Supports scalable workflows using Dask and cloud-native storage formats like COG.
  • Includes clear guidelines for handling nodata, masks, and radiometric transformations.

Usage examples

“Calculate the NDVI for a Sentinel-2 stack.”
The agent uses the raster helper to compute NDVI from a verified four-band stack, applying the correct scale and offset factors.
“Perform a spatial join between points and zones.”
The agent verifies that both datasets share a common CRS, performs the join, and calculates statistics like count and mean per zone.
“Search for Sentinel-2 imagery in a specific region.”
The agent uses the STAC client to query the Planetary Computer catalog for scenes within a bounding box and date range, filtering by cloud cover.
“Generate terrain metrics from a DEM.”
The agent processes a DEM to calculate slope, aspect, and hillshade, ensuring the input is a north-up projected grid with elevations in metres.

Install

  1. Download the skill as a ZIP:

    https://mp-staging.autogineer.com/agent-skills/k-dense-ai/geomaster/download
  2. Unzip it into the cross-client skills folder of your project:

    mkdir -p .agents/skills && unzip geomaster.zip -d .agents/skills

Documentation by K-Dense Inc.

GeoMaster

Geospatial analysis across vector/raster GIS, remote sensing, spatial ML, terrain, networks, and scientific applications. Start with the relevant workflow, inspect input provenance, and load only the reference needed for the task.

Tested scope and installation

The local recipe suite targets GeoPandas 1.2.0, Rasterio 1.5.2, Shapely 2.1.2, PyProj 3.8.0, Rioxarray 0.23.0, Xarray 2026.9.0, OSMnx 2.1.1 and PySTAC Client 0.9.0. See review and source ledger for execution limits. Examples requiring actual input files are templates; authenticated Earth Engine/CDS/commercial services, desktop GIS and GPU training remain illustrative.

# In a dedicated environment; install only the workflow's optional dependencies.
uv venv --python 3.13
uv pip install geopandas==1.2.0 rasterio==1.5.2 shapely==2.1.2 pyproj==3.8.0
uv pip install rioxarray==0.23.0 xarray==2026.9.0 'dask[array]' scikit-learn==1.9.1
uv pip install pystac-client==0.9.0 planetary-computer==1.0.0 odc-stac
# For osgeo/native CLI or PDAL, use a separate conda-forge environment:
# conda create -n geo-native -c conda-forge python=3.13 gdal pdal python-pdal

Install TorchGeo/PyTorch, RSGISLib, Py6S/6S, ArcPy, QGIS or other specialist runtimes separately when required. A Rasterio wheel includes its own GDAL library; it does not install osgeo or the GDAL command-line programs.

Workflow

  1. Record product/collection ID, acquisition time, processing baseline, license, band names, scale/offset, QA meaning, horizontal/vertical CRS and units.

  2. Verify CRS from authoritative metadata. set_crs labels coordinates; to_crs transforms them. Never infer an unknown CRS from plausible bounds.

  3. Align extent, affine transform, dimensions, pixel registration and resolution. Reproject categorical masks with nearest-neighbor resampling; choose an appropriate resampler for continuous data. Matching array shape alone does not prove alignment.

  4. Preserve nodata, clouds, shadows and saturation masks. Convert unsigned integers to floating point before differences; apply the provider's radiometric transform once.

  5. Run the analysis at a defensible support/resolution. Keep training labels and validation blocks separate. Terrain elevation and horizontal units must agree.

  6. Export CRS, transform, valid-data mask, units, model settings and provenance. Check numeric expectations on a small known fixture before scaling up.

Local raster recipes

Import the bundled raster helper from its directory (add that directory to PYTHONPATH or run from it). It implements small in-memory recipes; use windows/Dask for larger data. Writers require a new output path. It does not infer band identities or masks.

NDVI
from raster_workflows import write_ndvi

# This example assumes a VERIFIED four-band B02/B03/B04/B08 stack whose mask
# already excludes clouds/shadows, and harmonized DN reflectance = DN * 0.0001.
write_ndvi('s2_masked_stack.tif', 'ndvi.tif', red_band=3, nir_band=4,
           scale=0.0001, offset=0.0)

Do not use those indices or calibration for an arbitrary sentinel2.tif. SAFE products and STAC assets are often separate single-band rasters. Additive radiometric offsets affect even NDVI. EVI/SAVI require physical reflectance. normalized_difference keeps undefined ratios and invalid cells as NaN, not zero.

Terrain
import rasterio
from raster_workflows import terrain_metrics

with rasterio.open('dem_metres.tif') as src:
    slope_deg, aspect_deg, shade = terrain_metrics(
        src.read(1, masked=True), src.transform, src.crs)

The helper requires a north-up projected metric grid and elevations in metres. Aspect points downslope clockwise from north; it is undefined for flat cells. Slope is resolution-aware; nodata contaminating a derivative stencil stays invalid. Hillshade is an illumination visualization, not hydrological flow or exposure risk.

Classification
import geopandas as gpd
from raster_workflows import classify_imagery

training = gpd.read_file('training.gpkg')  # polygons with class_id in 1..65534
model = classify_imagery('masked_features.tif', training, 'classified.tif')

The helper checks CRS, geometry, labels, valid training pixels and overlapping labels, then preserves nodata in a uint16 output. It fits a small demonstration model; it does not measure accuracy. Use spatial/temporal holdouts at the field, scene or regional level before reporting predictive performance. See machine learning.

Vector analysis

import geopandas as gpd

zones = gpd.read_file('zones.geojson')
points = gpd.read_file('points.geojson')
if zones.crs is None or points.crs is None:
    raise ValueError('Resolve missing CRS before analysis')
points = points.to_crs(zones.crs)
joined = gpd.sjoin(points, zones, how='inner', predicate='within')
stats = joined.groupby('zone_id')['value'].agg(['count', 'mean', 'std'])

# Local data only: verify the estimated CRS area of use before accepting it.
metric = zones.to_crs(zones.estimate_utm_crs())
metric['area_m2'] = metric.area
buffers = metric.geometry.buffer(1000).to_crs(zones.crs)

within excludes boundary points; overlapping zones can duplicate observations. Choose and document a boundary/overlap policy. A projected CRS need not use metres or preserve area. UTM suits local regions, not every national, polar or global task.

Cloud catalogs and Earth Engine

Data sources documents current STAC, CDSE, CDS, Overpass and geocoding contracts. Discovery is separate from downloading pixels.

from pystac_client import Client
import planetary_computer

catalog = Client.open('https://planetarycomputer.microsoft.com/api/stac/v1',
                      modifier=planetary_computer.sign_inplace)
search = catalog.search(collections=['sentinel-2-l2a'],
                        bbox=[-122.5, 37.7, -122.3, 37.9],
                        datetime='2023-06-01/2023-06-30',
                        query={'eo:cloud_cover': {'lt': 20}}, max_items=5)
items = list(search.items())
if not items:
    raise ValueError('No matching scenes')
# Save item IDs/properties; inspect asset keys, scale/offset and QA before load.

limit controls page size; max_items bounds total traversal. Planetary Computer signing returns expiring SAS asset URLs; use unsigned IDs/metadata for durable provenance and sign near the time of access. Earth Engine requires prior ee.Authenticate() and ee.Initialize(project='your-registered-project'). Cloud filters at scene level do not replace per-pixel masks. The remote-sensing reference includes SCL masking and region summaries with an explicit exclusive date end.

Networks

import osmnx as ox
import networkx as nx
G = ox.graph_from_place('Portland, Maine, USA', network_type='drive')
G = ox.routing.add_edge_speeds(G)
G = ox.routing.add_edge_travel_times(G)
origin = ox.distance.nearest_nodes(G, -70.26, 43.66)
destination = ox.distance.nearest_nodes(G, -70.27, 43.67)
route = nx.shortest_path(G, origin, destination, weight='travel_time')

This makes public Nominatim/Overpass requests. Handle no-route results and inspect imputed speeds; these estimate free-flow time, not observed traffic. Use graph CRS for nearest-node coordinates and distinguish travel-time seconds from metres.

Efficient storage

import rioxarray
from rasterio.shutil import copy as rio_copy
from rio_cogeo.cogeo import cog_validate

cube = rioxarray.open_rasterio('large.tif', masked=True,
                             chunks={'band': 1, 'x': 1024, 'y': 1024})
# Compute bounded windows or reductions; do not force the entire cube into memory.
rio_copy('input.tif', 'output_cog.tif', driver='COG', compress='DEFLATE')
valid, errors, warnings = cog_validate('output_cog.tif')
if not valid:
    raise ValueError(errors)

Tiling/compression alone does not establish COG layout. Preserve or regenerate appropriate overviews at COG creation; do not mutate the result in place.

References

Citing Scientific Agent Skills

This skill is part of Scientific Agent Skills by K-Dense. If it materially contributed to a manuscript, report, presentation, or code release, add the paper to the references or software section and tell the user you did so:

Kassis, T., Agarwal, V., He, Y., Patel, D., & Brueckner, A. M. (2026). Scientific Agent Skills: A Library of Procedural Knowledge for Research Agents. arXiv:2609.00065. https://doi.org/10.48550/arXiv.2609.00065

Always cite the current version. The DOI and https://arxiv.org/abs/2609.00065 resolve to the latest arXiv version, so never append a version suffix such as v1. When network access is available, fetch https://arxiv.org/abs/2609.00065 (or http://export.arxiv.org/api/query?id_list=2609.00065) before writing the reference and take the author list, year, and version from that record. If the record lists a journal reference or publisher DOI, cite the published version instead.

Files

references/specialized-topics.md

Specialized Topics

Geostatistics, optimization, privacy and provenance. Reviewed 2026-10-01. Data-dependent fragments remain illustrative; small numerical functions are exercised by the recipe suite. All Euclidean coordinates below require a suitable metric CRS.

Geostatistics

Variogram Analysis
import numpy as np
from scipy.spatial.distance import pdist, squareform
import matplotlib.pyplot as plt

def empirical_variogram(points, values, max_lag=None, n_lags=15):
    """
    Calculate empirical variogram.
    """
    points = np.asarray(points, dtype=float)
    values = np.asarray(values, dtype=float)
    if points.ndim != 2 or values.shape != (len(points),) or len(points) < 2:
        raise ValueError('At least two points with one value each are required')
    if not np.isfinite(points).all() or not np.isfinite(values).all():
        raise ValueError('Inputs must be finite')
    distances = pdist(points)  # unique unordered pairs; no self-pairs
    differences = pdist(values[:, None], metric='sqeuclidean')
    max_lag = distances.max() / 2 if max_lag is None else max_lag
    if not np.isfinite(max_lag) or max_lag <= 0 or n_lags < 1:
        raise ValueError('Positive finite maximum lag and positive lag count required')
    edges = np.linspace(0, max_lag, n_lags + 1)
    centers, semivariance = [], []
    for i, (low, high) in enumerate(zip(edges[:-1], edges[1:])):
        keep = (distances >= low) & ((distances <= high) if i == n_lags - 1 else (distances < high))
        if keep.any():
            centers.append(distances[keep].mean())
            semivariance.append(0.5 * differences[keep].mean())
    return np.asarray(centers), np.asarray(semivariance)

# Fit variogram model
def fit_variogram_model(lags, gammas, model='spherical'):
    """
    Fit theoretical variogram model.
    """
    from scipy.optimize import curve_fit

    def spherical(h, nugget, sill, range_):
        """Spherical model; sill argument is partial sill, total sill=nugget+sill."""
        h = np.asarray(h)
        gamma = np.where(h < range_,
                        nugget + sill * (1.5 * h/range_ - 0.5 * (h/range_)**3),
                        nugget + sill)
        return gamma

    def exponential(h, nugget, sill, range_):
        """Exponential model."""
        return nugget + sill * (1 - np.exp(-3 * h / range_))

    def gaussian(h, nugget, sill, range_):
        """Gaussian model."""
        return nugget + sill * (1 - np.exp(-3 * (h/range_)**2))

    models = {
        'spherical': spherical,
        'exponential': exponential,
        'gaussian': gaussian
    }

    # Fit model
    popt, _ = curve_fit(models[model], lags, gammas,
                        p0=[np.min(gammas), np.max(gammas), np.max(lags)/2],
                        bounds=([0, 0, 1e-12], [np.inf, np.inf, np.inf]))

    return popt, models[model]
Kriging Interpolation
from pykrige.ok import OrdinaryKriging
import numpy as np

def ordinary_kriging(x, y, z, grid_resolution=100):
    """
    Perform ordinary kriging interpolation.
    """
    # Create grid
    gridx = np.linspace(x.min(), x.max(), grid_resolution)
    gridy = np.linspace(y.min(), y.max(), grid_resolution)

    # Fit variogram
    OK = OrdinaryKriging(
        x, y, z,
        variogram_model='spherical',
        verbose=False,
        enable_plotting=False,
        coordinates_type='euclidean',
    )

    # Interpolate
    zinterp, sigmasq = OK.execute('grid', gridx, gridy)

    return zinterp, sigmasq, gridx, gridy

# Cross-validation
def kriging_cross_validation(x, y, z, groups, n_folds=5):
    """
    Perform k-fold cross-validation for kriging.
    """
    from sklearn.model_selection import GroupKFold

    kf = GroupKFold(n_splits=n_folds)
    errors = []

    for train_idx, test_idx in kf.split(z, groups=groups):
        # Train
        OK = OrdinaryKriging(
            x[train_idx], y[train_idx], z[train_idx],
            variogram_model='spherical',
            verbose=False
        )

        # Predict at test locations
        predictions, _ = OK.execute('points',
                                    x[test_idx], y[test_idx])

        # Calculate error
        rmse = np.sqrt(np.mean((predictions - z[test_idx])**2))
        errors.append(rmse)

    return np.mean(errors), np.std(errors)

Spatial Optimization

Location-allocation: explicit p-median formulation

SLSQP over thresholded fractional variables is not a binary facility solver. For a small candidate set, use binary open-site variables y_j and assignment variables x_ij, minimize sum(demand_i * cost_ij * x_ij), and constrain:

  • sum_j x_ij = 1 for every demand point;

  • x_ij <= y_j;

  • sum_j y_j = p;

  • all variables in {0,1}.

Use scipy.optimize.milp with integrality=1, Bounds(0, 1) and explicit LinearConstraint objects, then require solver success and verify feasibility, objective and chosen site count. Costs may be network travel times, not straight-line distance; unreachable pairs must be prohibited. Weighted demand needs explicit units. KMeans/snapping is a heuristic and can select duplicate sites.

Routing optimization

For a small connected undirected road graph, build a shortest-path metric closure before a TSP heuristic. G[current][candidate] assumes a direct edge and fails on ordinary sparse road graphs. NetworkX traveling_salesman_problem(G, nodes=stops, weight='length', cycle=True) computes a closure and expands the tour back onto original graph paths. Report it as approximate; repeated intermediate nodes are normal. Directed routing needs strong reachability and a compatible heuristic.

Vehicle routing additionally constrains capacity, depot starts/ends, customer demand, service time, time windows and fleet. Cluster-first routes that never inspect a capacity argument are not a capacity-constrained VRP solution. Use an appropriate routing optimizer and verify each route against the constraints afterward.

Ethics and Privacy

Privacy-preserving geospatial analysis

Independent metre-scale noise added directly to longitude/latitude is dimensionally wrong and does not establish a privacy guarantee. Define protected units, adjacency, release mechanism, sensitivity and composition before claiming differential privacy. Use a reviewed mechanism appropriate to location data and a threat model; geographic projection/extent and side information matter. For descriptive maps, aggregate to justified cells and suppress sparse groups, while reporting that aggregation alone does not prove anonymity.

Line simplification is not k-anonymity: it does not create k indistinguishable people or protect sensitive places. Audit re-identification risk and consent/access controls; preserve sensitive raw trajectories separately from permitted outputs.

Data Provenance
# Track geospatial data lineage
import pandas as pd

class DataLineage:
    def __init__(self):
        self.history = []

    def record_transformation(self, input_data, operation, output_data, params):
        """Record data transformation."""
        record = {
            'timestamp': pd.Timestamp.now(),
            'input': input_data,
            'operation': operation,
            'output': output_data,
            'parameters': params
        }
        self.history.append(record)

    def get_lineage(self, data_id):
        """Traverse recorded edges without infinite recursion on cycles."""
        lineage, seen, pending = [], set(), [data_id]
        while pending:
            current = pending.pop()
            if current in seen:
                continue
            seen.add(current)
            for record in self.history:
                if record['output'] == current:
                    lineage.append(record)
                    pending.append(record['input'])
        return lineage

Best Practices

Reproducible Research
# Use environment.yml for dependencies
# environment.yml:
"""
name: geomaster
dependencies:
  - python=3.13
  - geopandas
  - rasterio
  - scikit-learn
  - pip
  - pip:
    - torchgeo
"""

# Capture session info
def capture_environment():
    """Capture software and data versions."""
    import platform
    import geopandas as gpd
    import rasterio
    import numpy as np
    import pandas as pd

    info = {
        'os': platform.platform(),
        'python': platform.python_version(),
        'geopandas': gpd.__version__,
        'rasterio': rasterio.__version__,
        'numpy': np.__version__,
        'pandas': pd.__version__,
        'timestamp': pd.Timestamp.now()
    }

    return info

# Save with output
import json
with open('processing_info.json', 'w') as f:
    json.dump(capture_environment(), f, indent=2, default=str)
Code Organization
# Project structure
"""
project/
├── data/
│   ├── raw/
│   ├── processed/
│   └── external/
├── notebooks/
├── src/
│   ├── __init__.py
│   ├── data_loading.py
│   ├── preprocessing.py
│   ├── analysis.py
│   └── visualization.py
├── tests/
├── config.yaml
└── README.md
"""

# Configuration management
import yaml

with open('config.yaml') as f:
    config = yaml.safe_load(f)

# Access parameters
crs = config['projection']['output_crs']
resolution = config['data']['resolution']
Performance Optimization
# Memory profiling
import memory_profiler

@memory_profiler.profile
def process_large_dataset(data_path):
    """Profile memory usage."""
    data = load_data(data_path)
    result = process(data)
    return result

# Vectorization vs loops
# BAD: Iterating rows
for idx, row in gdf.iterrows():
    gdf.loc[idx, 'buffer'] = row.geometry.buffer(100)

# GOOD: Vectorized
gdf['buffer'] = gdf.geometry.buffer(100)

# Chunked processing
def process_in_chunks(gdf, func, chunk_size=1000):
    """Process GeoDataFrame in chunks."""
    results = []
    for i in range(0, len(gdf), chunk_size):
        chunk = gdf.iloc[i:i+chunk_size]
        result = func(chunk)
        results.append(result)
    return pd.concat(results)

For more code examples, see code-examples.md.

Sources: SciPy MILP, PyKrige, NetworkX TSP, GroupKFold.

Requirements and compatibility

Works with: Claude Code, Claude apps, OpenAI Codex, GitHub Copilot, Cursor, Gemini CLI, Kiro, OpenCode, Goose, Amp, Roo Code, JetBrains Junie, Factory Droid, Devin (ex-Windsurf), Mistral Vibe, OpenHands, Letta

“Works with” means the tool reads the open Agent Skills format; a skill written for one tool may use features others lack.

Needs: Needs network access, Needs Python, Needs Node.js

The author says: Core examples require Python 3.12+ and GeoPandas, Rasterio, NumPy and PyProj. Optional workflows require their named packages, native GIS applications, GPU runtimes, or service credentials and network access.

Security

What our scanner noticed· Low risk

  • Instructions that use the network
  • Scripts that your agent may run

This skill includes scripts that your agent may run. Read them before you use it.

A static scan is not a guarantee. Skills are third-party content: review a skill before you let an agent use it.

Attribution and licence

Created by
K-Dense Inc.
Publisher
K-Dense (Community)
Source
K-Dense-AI/scientific-agent-skills · skills/geomaster · commit a25cf9e
Licence
MIT License (redistribution allowed)
  • LICENSE (added by AutoGineer from LICENSE.md)
  • ATTRIBUTION.md (written by AutoGineer)
Synced

AutoGineer is not affiliated with or endorsed by K-Dense Inc. or K-Dense.

Download ZIP

The ZIP holds the skill’s files, its licence files and an ATTRIBUTION.md. Download geomaster.zip