Digital planar segment based polyhedrization for surface area estimation

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

Volumn 2059, Issue , 2001, Pages 356-366

  Klette, Reinhard ^a   Sun, Hao Jie ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY;

CONVEX HULL; CONVEX SET; EUCLIDEAN PLANES; MULTIGRID CONVERGENCES; PLANAR SEGMENTS; POLYHEDRIZATION; SURFACE AREA; SURFACE AREA MEASUREMENT;

SET THEORY;

EID: 84957601116     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45129-3_32     Document Type: Conference Paper

References (21)

1. E. Andres, R. Acharya and C. Sibata: Discrete analytical hyperplanes. Graphical Models and Image Processing, 59 (1997) 302-309.
2. E. Artzy, G. Frieder, and G. T. Herman: The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm. CVGIP, 15 (1981) 1-24.
3. M. de Berg: Computational Geometry: Algorithms and Applications. Springer, New York (1997).
4. I. Debled-Renesson and J.P. Reveillés: An incremental algorithm for digital plane recognition. DGCI’94, Grenoble, France (1994) 207-222.
5. J. Françon: Discrete combinatorial surfaces. Graphical Models Image Processing, 57 (1995) 20-26.
6. J. Françon and L. Papier: Polyhedrization of the boundary of a voxel object. DGCI’99, LNCS 1568, Springer, Berlin (1999) 425-434.
7. J. Françon, J.-M. Schramm, and M. Tajine: Recognizing arithmetic straight lines and planes. DGCI’96, LNCS 1176, Springer, Berlin (1996) 141-150.
8. e série (1892) T. 8, 69-99.
9. Y. Kenmochi and R. Klette: Surface area calculation for digitized regular solids. Vision Geometry IX, SPIE-4117 (2000) 100-111.
10. R. Klette: Approximation and representation of 3D objects. in: Advances in Digital and Computational Geometry, Springer, Singapore (1998) 161-194.
11. R. Klette and B. Yip: The length of digital curves. Machine GRAPHICS & VISION, 9 (2000) 673-703.
12. V. A. Kovalevsky: New definition and fast recognition of digital straight segments and arcs. Proc. IEEE Conf. ICPR-10, Los Almitos, vol. II (1994) 31-34.
13. A. Lenoir, R. Malgouyres, and R. Revenu: Fast Computation of the normal vector field of the surface of a 3-d discrete object. DGCI’99 LNCS 1176, Berlin, Springer (1999) 101-112.
14. J. P. Reveillés: Géométrie Discrète, Calcul en nombres entiers et Algorithmique. Thése d’état soutenue à l’Université Louis Pasteur, (1991).
15. A. Rosenfeld. Digital straight line segments. IEEE Trans. Computers, 23 (1974) 1264-1269.
16. H. A. Schwarz: Sur une définition erronée de l’aire d’une surface courbe. Ges. math. Abhandl., 2 (1890) 309-311.
17. F. Sloboda and B. Zaťko: On polyhedral form for surface representation. Technical report, Institute of Control Theory and Robotics, Slovak Academy of Sciences, Bratislava (2000).
18. H. Sun: Surface Area Measurement Based on Polyhedrization. MSc Thesis, CITR Tamaki, Auckland (2001).
19. J. Vittone and J.-M. Chassery: Recognition of digital naive planes and polyhedrization. DGCI’2000, LNCS 1953, Springer, Berlin (2000) 296-307.
20. http://www.geom.umn.edu/software/qhull/.
21. http://www.ifor.math.ethz.ch/~fukuda/cddhome/cdd.html.