On the language of standard discrete planes and surfaces

Authors:
Damien Jamet
Affiliations:
LIRMM, Université Montpellier II, Montpellier Cedex 5, France
Venue:
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Year:
2004

Citing 15
Cited 5

Computational geometry: an introduction

Computational geometry: an introduction
Digital surfaces

CVGIP: Graphical Models and Image Processing
Discrete Combinatorial Surfaces

Graphical Models and Image Processing
A definition of surfaces of Z3 . A new 3D discrete Jordan theorem

Theoretical Computer Science
Combinatorics of patterns of a bidimensional Sturmian sequence.

Theoretical Computer Science
Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)
Tilings and rotations on the torus: a two-dimensional generalization of Sturmian sequences

Discrete Mathematics
About local configurations in arithmetic planes

Theoretical Computer Science
Local Configurations of Digital Hyperplanes

DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
(n, m)-Cubes and Farey Nets for Naive Planes Understanding

DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
Naive Planes as Discrete Combinatorial Surfaces

DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Recognition of Digital Naive Planes and Polyhedrization

DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
An Incremental Linear Time Algorithm for Digital Line and Plane Recognition Using a Linear Incremental Feasibility Problem

DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Two-dimensional iterated morphisms and discrete planes

Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Lattices and multi-dimensional words

Theoretical Computer Science - Combinatorics of the discrete plane and tilings

Digital lines with irrational slopes

Theoretical Computer Science
Functional stepped surfaces, flips, and generalized substitutions

Theoretical Computer Science
Local rule substitutions and stepped surfaces

Theoretical Computer Science
A characterization of flip-accessibility for rhombus tilings of the whole plane

Information and Computation
Consistency of multidimensional combinatorial substitutions

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A standard discrete plane is a subset of ℤ3 verifying the double Diophantine inequality μ ≤ ax + by + cz μ + ω, with (a,b,c) ≠ (0,0,0). In the present paper we introduce a generalization of this notion, namely the (1,1,1)-discrete surfaces. We first study a combinatorial representation of discrete surfaces as two-dimensional sequences over a three-letter alphabet and show how to use this combinatorial point of view for the recognition problem for these discrete surfaces. We then apply this combinatorial representation to the standard discrete planes and give a first attempt of to generalize the study of the dual space of parameters for the latter [VC00].