论文信息 - Convex Hulls in a 3-Dimensional Space

Convex Hulls in a 3-Dimensional Space

This paper describes a new algorithm of computing the convex hull of a 3-dimensional object. The convex hull generated by this algorithm is an abstract polyhedron being described by a new data structure, the cell list, suggested by one of the authors. The correctness of the algorithm is proved and experimental results are presented.

Vladimir Kovalevsky | Henrik Schulz

[1] Vladimir Kovalevsky,et al. Algorithms and Data Structures for Computer Topology , 2000, Digital and Image Geometry.

[2] Vladimir Kovalevsky,et al. Multidimensional cell lists for investigating 3-manifolds , 2003, Discret. Appl. Math..

[3] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[4] Atsushi Imiya,et al. Digital and Image Geometry , 2002, Lecture Notes in Computer Science.

[5] William E. Lorensen,et al. Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[6] Vladimir A. Kovalevsky,et al. Finite topology as applied to image analysis , 1989, Comput. Vis. Graph. Image Process..

[7] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .

[8] Kurt Mehlhorn,et al. Four Results on Randomized Incremental Constructions , 1992, Comput. Geom..

[9] V. Kovalevsky. Digital Geometry Based on the Topology of Abstract Cell Complexes , 2022 .

[10] Reinhard Klette,et al. A Global Surface Area Estimation Algorithm for Digital Regular Solids , 2000 .