Search for dissertations about: "tredimensionellt rutnät"

Found 2 swedish dissertations containing the words tredimensionellt rutnät.

  2. 1. Modeling and optimization of least-cost corridors

    Author : Lindsi Seegmiller; Takeshi Shirabe; Kai-Florian Richter; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; raster data modeling; raster-based geographic information systems; route planning; optimal routing; corridor; wide path; corridor width; distortion; three-dimensional grid; rasterdatamodellering; rasterbaserade geografiska informationssystem; ruttplanering; optimal dirigering; korridor; bred väg; korridorbredd; distorsion; tredimensionellt rutnät; Geoinformatics; Geoinformatik;

    Abstract : Given a grid of cells, each having a value indicating its cost per unit area, a variant of the least-cost path problem is to find a corridor of a specified width connecting two termini such that its cost-weighted area is minimized. A computationally efficient method exists for finding such corridors, but as is the case with conventional raster-based least-cost paths, their incremental orientations are limited to a fixed number of (typically eight orthogonal and diagonal) directions, and therefore, regardless of the grid resolution, they tend to deviate from those conceivable on the Euclidean plane. READ MORE

  4. 2. Modeling Width in Spatial Optimization in Raster Space

    Author : Lindsi Seegmiller; Takeshi Shirabe; Lars Harrie; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; raster-based geographic information system; spatial optimization; region selection; width; optimal routing; raster data modeling; distortion; corridor; rasterbaserat geografiskt informationssystem; rumslig optimering; regionval; bredd; optimal routing; rasterdatamodellering; distorsion; korridor; Geoinformatik; Geoinformatics;

    Abstract : Given a grid of cells, each of which is assigned a numerical value quantifying its utility (or cost) for a certain use, a popular type of problem in geographic information science is raster-based spatial optimization. Such problems commonly seek to find a set of cells that maximizes (or minimizes) that utility (or cost) while adhering to a given set of constraints. READ MORE