Towards an invertible euclidean reconstruction of a discrete object

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2886, Issue , 2003, Pages 246-256

  Breton, Rodolphe ^a   Sivignon, Isabelle ^c   Dupont, Florent ^b   Andres, Eric ^a  

^a UNIVERSITÉ DE POITIERS   (France)

^b UNIVERSITÉ LYON 1   (France)

^c SIMaP   (France)

Author keywords

Discrete object; Invertible Euclidean reconstruction

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

ANALYTICAL GEOMETRY; CLASSICAL METHODS; DISCRETE OBJECTS; EUCLIDEAN RECONSTRUCTION; MARCHING CUBE;

GEOMETRY;

EID: 0242628740     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39966-7_23     Document Type: Article

References (14)

1. Lorensen, W., Cline, H.: Marching cubes: a high resolution 3d surface construction algorithm. In: SIGGRAPH '87, Computer Graphics J. Volume 21., Anaheim, USA (1987) 163-169
2. Cœurjolly, D.: Algorithmique et géométrie discrète pour la caractérisation des courbes et des surfaces. PhD thesis, Université Lumière, Lyon 2, France (2002)
3. Andres, E.: Discrete linear objects in dimension n: the standard model. Graphical Models (2003) (To appear).
4. Vittone, J., Chassery, J.M.: (n - m)-cubes and farey nets for naive plane understanding. In: 8th Int. Workshop on Discrete Gometry for Computer Imagery. Volume 1568., Marne-la-Vallée, France (1999) 76-87
5. Vittone, J.: Caractérisation et reconnaissance de droites et de plans en géométrie discrète. PhD thesis, Université Joseph Fourier - Grenoble 1, France (1999)
6. Veelaert, P.: Geometric constructions in the digital plane. Journal of Mathematical Imaging and Vision 11 (1999) 99-118
7. Andres, E.: Defining discrete objects for polygonalization: the standard model. In A. Braquelaire, J.O.L., Vialard, A., eds.: Discrete Geometry for Computer Imagery 2002. Volume 2301 of Lecture Notes in Computer Science., Bordeaux, France, Springer (2002) 313-325
8. Lindenbaum, M., Bruckstein, A.: On recursive, o(n) partitioning of a digitized curve into digital straight segments. IEEE Transactions on Pattern Analysis and Machine Intelligence 15 (1993) 949-953
9. Andres, E., Acharya, R., Sibata, C.: Discrete analytical hyperplanes. Graphical Models and Image Processing 59 (1997) 302-309
10. Vittone, J., Chassery, J.M.: Recognition of digital naive planes and polyhedrization. In: Discrete Geometry for Computer Imagery. Volume 1953 of LNCS., Springer-Verlag (2000) 296-307
11. Sivignon, I., Dupont, F., Chassery, J.M.: Decomposition of a 3d discrete object surface into discrete plane pieces. Algorithmica, Special Issue on Shapes Algorithmics (To appear)
12. Debled-Rennesson, I.: Étude et reconnaissance des droites et plans discrets. PhD thesis, Université Louis Pasteur, Strasbourg, France (1995)
13. Schramm, J.: Coplanar tricubes. In Ahronovitz, Fioro, eds.: Discrete geometry for computer imagery. Volume 1347 of LNCS., Springer-Verlag (1997) 87-98
14. Vittone, J., Chassery, J.M.: Coexistence of tricubes in digital naive plane. In: Discrete Geometry for Computer Imagery. Volume 1347 of LNCS., Springer-Verlag (1997) 99-110