z-logo
open-access-imgOpen Access
RASTERIZATION AND VOXELIZATION OF TWO- AND THREE-DIMENSIONAL SPACE PARTITIONINGS
Author(s) -
B.G.H. Gorte,
Sisi Zlatanova
Publication year - 2016
Publication title -
the international archives of the photogrammetry, remote sensing and spatial information sciences/international archives of the photogrammetry, remote sensing and spatial information sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.264
H-Index - 71
eISSN - 1682-1777
pISSN - 1682-1750
DOI - 10.5194/isprsarchives-xli-b4-283-2016
Subject(s) - voxel , polyhedron , polygon (computer graphics) , computer science , block (permutation group theory) , computer graphics (images) , object (grammar) , ellipsoid , computer vision , boundary (topology) , raster graphics , planar , artificial intelligence , algorithm , mathematics , geometry , telecommunications , mathematical analysis , physics , frame (networking) , astronomy

The paper presents a very straightforward and effective algorithm to convert a space partitioning, made up of polyhedral objects, into a 3D block of voxels, which is fully occupied, i.e. in which every voxel has a value. In addition to walls, floors, etc. there are 'air' voxels, which in turn may be distinguished as indoor and outdoor air. The method is a 3D extension of a 2D polygon-to-raster conversion algorithm. The input of the algorithm is a set of non-overlapping, closed polyhedra, which can be nested or touching. The air volume is not necessarily represented explicitly as a polyhedron (it can be treated as 'background', leading to the 'default' voxel value). The approach consists of two stages, the first being object (boundary) based, the second scan-line based. In addition to planar faces, other primitives, such as ellipsoids, can be accommodated in the first stage without affecting the second.

Optical and Laser Remote SensingGeoscience and Remote SensingUrbanis

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here