Share Email Print
cover

Proceedings Paper

Raster algorithms for generating Delaunay tetrahedral tessellations
Author(s): Xiaoyong Chen; Kozo Ikeda; Kazuyoshi Yamakita; Mitsuru Nasu
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 17 August 1994
PDF: 8 pages
Proc. SPIE 2357, ISPRS Commission III Symposium: Spatial Information from Digital Photogrammetry and Computer Vision, (17 August 1994); doi: 10.1117/12.182858
Show Author Affiliations
Xiaoyong Chen, Asia Air Survey Co., Ltd (Japan)
Kozo Ikeda, Asia Air Survey Co., Ltd (Japan)
Kazuyoshi Yamakita, Asia Air Survey Co., Ltd (Japan)
Mitsuru Nasu, Asia Air Survey Co., Ltd (Japan)


Published in SPIE Proceedings Vol. 2357:
ISPRS Commission III Symposium: Spatial Information from Digital Photogrammetry and Computer Vision
Heinrich Ebner; Christian Heipke; Konrad Eder, Editor(s)

© SPIE. Terms of Use
Back to Top