Computational aspects of digital plane and hyperplane recognition

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

Volumn 4040 LNCS, Issue , 2006, Pages 291-306

  Coeurjolly, David ^a   Brimkov, Valentin ^b  

^a UNIVERSITÉ LYON 1   (France)

^b BUFFALO STATE COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY;

COMPUTATIONAL ASPECTS; DIGITAL PLANE; HYPERPLANE RECOGNITION;

COMPUTER SCIENCE;

EID: 33746239132     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11774938_23     Document Type: Conference Paper

References (39)

1. Qhull. http://www.qhull.org/.
2. D.M. Acketa and J.D. Žunić. On the maximal number of edges of convex digital polygons included into a m × m-grid. Journal of Combinatorial Theory, Serie A(69):358-368, 1995.
3. E. Andres, R. Acharya, and C. Sibata. Discrete analytical hyperplanes. Graphical Models and Image Processing, 59(5):302-309, September 1997.
4. D. Avis. lrs: implementation as a callable library of the reverse search algorithm for vertex enumeration/convex hull problems, http://cgm.cs.mcgill.ca/ ~avis/C/lrs.html.
5. A. Balog and I. Bárány. On the convex hull of the integer points in a disc. In ACM-SIGACT ACM-SIGGRAPH, editor, Proceedings of the 7th Annual Symposium on Computational Geometry (SCG '91), pages 162-165, North Conway, NH, USA, June 1991. ACM Press.
6. I. Barany. Random points, convex bodies, lattices. In ICM: Proceedings of the International Congress of Mathematicians, 2002.
7. I. Barany, Howe, and Lovasz. On integer points in polyhedra: A lower bound. Combinatorica, 12, 1992.
8. I. Bárány and D. G. Larman. The convex hull of the integer points in a large ball. Math. Annalen, 312:167-181, 1998.
9. C. B. Barber, D. P. Dobkin, and H. Huhdanpaa. The quickhull algorithm for convex hulls. ACM Transactions on Mathematical Software, 22(4):469-483, December 1996.
10. R. P. Barneva, V. E. Brimkov, and P. Nehlig. Thin discrete triangular meshes. Theoretical Computer Science, 246(1-2):73-105, 2000.
11. D. Bremner. Incremental convex hull algorithms are not output sensitive. Discrete & Computational Geometry, 21(1):57-68, 1999.
12. V. Brimkov, D. Coeurjolly, and R. Klette. Digital planarity - a review. Technical report, Laboratoire LIRIS, Université Claude Bernard Lyon 1, 2004. http://liris.cnrs.fr/publis/?id=1933.
13. V. E. Brimkov and S. S. Dantchev. Complexity analysis for digital hyperplane recognition in arbitrary fixed dimension. In International Conference on Discrete Geometry for Computer Imagery, pages 287-298, 2005.
14. L. Buzer. A linear incremental algorithm for naive and standard digital lines and planes recognition. Graphical Models, 65(1-3):61-76, May 2003.
15. D. Coeurjolly. Algorithmique et géométrie discrète pour la caractérisation des courbes et des surfaces. PhD thesis, Université Lumière Lyon 2, Bron, Laboratoire ERIC, dec 2002.
16. D. Coeurjolly, Alexis Guillaume, and I. Sivignon. Reversible discrete volume polyhedrization using marching cubes simplification. In SPIE Vision Geometry XII, volume 5300, pages 1-11, San Jose, USA, 2004.
17. D. Coeurjolly, I. Sivignon, F. Dupont, F. Feschet, and J.-M. Chassery. On digital plane preimage structure. Discrete Applied Mathematics, 151(1-3):78-92, 2005.
18. I. Debled-Rennesson. Etude et reconnaissance des droites et plans discrets. PhD thesis, Université Louis Pasteur, 1995.
19. J. Françon, J.M. Schramm, and M. Tajine. Recognizing arithmetic straight lines and planes. In 6th Discrete Geometry for Computer Imagery, volume 1176 of LNCS, pages 141-150. Springer-Verlag, 1996.
20. J. Françon and L. Papier. Polyhedrization of the boundary of a voxel object. In 8th International Conference in Discrete Geometry for Computer Imagery, volume 1568 of LNCS, pages 425-434. Springer-Verlag, 1999.
21. M. R. Garey and D. S. Johnson. Computers and intractability; a guide to the theory of NP-completeness. W.H. Freeman, 1979.
22. Y. Gerard, I. Debled-Rennesson, and P. Zimmermann. An elementary digital plane recognition algorithm. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 151, 2005.
23. C. E. Kim. Three-dimensional digital planes. IEEE Trans. on Pattern Analysis and Machine Intelligence, 6:639-645, 1984.
24. C. E. Kim and I. Stojmenovic. On the recognition of digital planes in three-dimensional space. Pattern Recognition Letters, 12(11):665-669, 1991.
25. R. Klette, I. Stojmenovic, and J. D. Zunic. A parametrization of digital planes by least-squares fits and generalizations. CVGIP: Graphical Model and Image Processing, 58(3):295-300, 1996.
26. R. Klette and H. J. Sun. Digital planar segment based polyhedrization for surface area estimation. In IWVF, pages 356-366, 2001.
27. N. Megiddo. Linear programming in linear time when the dimension is fixed. JACM: Journal of the ACM, 31, 1984.
28. M. M. Mesmoudi. A simplified recognition algorithm of digital planes pieces. In 10th International Conference, Discrete Geometry for Computer Imagery, volume 2301 of LNCS, pages 404-416, Bordeaux, France, april 2002. Springer Verlag.
29. F. P. Preparata and M. I. Shamos. Computational Geometry : An Introduction. Springer-Verlag, 1985.
30. A. Rosenfeld. Digital straight lines segments. IEEE Transactions on Computers, pages 1264-1369, 1974.
31. A. Rosenfeld and R. Klette. Digital straightness. In Int. Workshop on Combinatorial Image Analysis, volume 46 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, August 2001.
32. A. Schrijver. Theory of Linear and Integer Programming. Wiley and Sons, 1986.
33. I. Sivignon and D. Coeurjolly. From digital plane segmentation to polyhedral representation. In Theoretical Foundations of Computer Vision "Geometry, Morphology, and Computational Imaging ", number 2616 in LNCS, Springer-Verlag, pages 356-367, 2003.
34. I. Sivignon, F. Dupont, and J. M. Chassery. Decomposition of a three-dimensional discrete object surface into discrete plane pieces. Algorithmica, 38(1):25-43, 2003.
35. I. Stojmenović and R. Tosić. Digitization schemes and the recognition of digital straight lines, hyperplanes and flats in arbitrary dimensions. In Vision Geometry,contemporary Mathematics Series, volume 119, pages 197-212, American Mathematical Society, Providence, RI, 1991.
36. P. Veelaert. On the flatness of digital hyperplanes. Journal of Mathematical Imaging and Vision, 3:205-221, 1993.
37. P. Veelaert. Digital planarity of rectangular surface segments. IEEE Pattern Analysis and Machine Intelligence, 16(6):647-652, jun 1994.
38. J. Vittone and J.-M. Chassery. Recognition of digital naive planes and polyhedization. In 9th Discrete Geometry for Computer Imagery, volume 1953 of LNCS, pages 296-307. Springer, 2000.
39. N. Y. Zolotykh. On the number of vertices in integer linear programming problems. Technical report, University of Nizhni Novgorod, 2000.