Digital planarity—A review
详细信息 查看全文
- 作者：Valentin Brimkov ; David Coeurjolly ; Reinhard Klette
- 关键词：Digital planes ; Digital geometry ; Arithmetic geometry ; 2D array periodicity ; Sturmian words ; Geometric algorithms
- 刊名：Discrete Applied Mathematics
- 出版年：2007
- 出版时间：15 February 2007
- 年：2007
- 卷：155
- 期：4
- 页码：468-495
- 全文大小：1318 K
文摘
Digital planarity is defined by digitizing Euclidean planes in the three-dimensional digital space of voxels; voxels are given either in the grid-point or the grid-cube model. The paper summarizes results (also including most of the proofs) about different aspects of digital planarity, such as supporting or separating Euclidean planes, characterizations in arithmetic geometry, periodicity, connectivity, and algorithmic solutions. The paper provides a uniform presentation, which further extends and details a recent book chapter in [R. Klette, A. Rosenfeld, Digital Geometry—Geometric Methods for Digital Picture Analysis, Morgan Kaufmann, San Francisco, 2004].