17 August 1994 Raster algorithms for generating Delaunay tetrahedral tessellations
Author Affiliations +
Proceedings Volume 2357, ISPRS Commission III Symposium: Spatial Information from Digital Photogrammetry and Computer Vision; (1994) https://doi.org/10.1117/12.182858
Event: Spatial Information from Digital Photogrammetry and Computer Vision: ISPRS Commission III Symposium, 1994, Munich, Germany
Abstract
Recently, many application domains need 3-D GIS. Delaunay tetrahedral tessellation (DTT) has been concerned as one kind of simplest data structure for 3-D GIS modeling due to its many advantages. But since 3-D geometry is poorly understood, no successful algorithms have been presented until now. In this paper, we are trying to challenge this sophisticated problem based on 3-D mathematical morphology and raster-vector hybrid processing. Two raster based algorithms for generating ordinary and constrained DTT have been presented, and their correctness and efficiencies also have been proven based on some experimental results.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xiaoyong Chen, Kozo Ikeda, Kazuyoshi Yamakita, and Mitsuru Nasu "Raster algorithms for generating Delaunay tetrahedral tessellations", Proc. SPIE 2357, ISPRS Commission III Symposium: Spatial Information from Digital Photogrammetry and Computer Vision, (17 August 1994); doi: 10.1117/12.182858; https://doi.org/10.1117/12.182858
PROCEEDINGS
8 PAGES


SHARE
Advertisement
Advertisement
Back to Top