Three-dimensional alpha shapes

Proceedings of the 1992 Workshop on Volume Visualization, VVS 1992

Volumn , Issue , 1992, Pages 75-82

  Edelsbrunner, Herbert ^a   Miicke, Ernst P ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

VISUALIZATION;

ALPHA-SHAPES; DELAU-NAY TRIANGULATIONS; LEVEL OF DETAIL; POINT SET; POLYTOPES;

GEOMETRY;

EID: 78249247984     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/147130.147153     Document Type: Conference Paper

References (32)

1. J D Boisronnat. Geometric structures for three-dimensional shape rep resentation. ACM Transactions on Graphics, 3(4):266-286, 1984.
2. E Brisson. Representing geometric structures in d dimensions: Topology and order. In Proceedings of the 5th Annual Symposium on Computotional Geometry, pages 218-227, 1989.
3. R Y Cen, A Jameson, F Liu, and B P Ostriker. The universe in a box: Thermal effects in a standard cold dark matter scenario. Astrophysical Journal (Letters)3, 62:141, October 1990.
4. T H Cormen, C E Leiserson, and R L Rivest. Introduction to Algorithms. MIT Press, Cambridge, Massachusetts, 1990.
5. D P Dobkin and M J Lasslo. Primitives for the manipulation of threedimensional subdivisions. Algorithmica, 4(1):3-32, 1989.
6. R A Drebin, L Carpenter, and P Hanrahan. Volume rendering. Computer Gmphics, 22(4):65-74, 1988. ACM Siggraph 88. Conference Prceedings.
7. M D Dyksterhouse. An alpha-shape view of our universe. MS thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, 1992.
8. H Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, Germany, 1987.
9. H Edelsbrunner. Geometric algorithms. To appear in P Gruber and J Wills, editors, Handbook of Convez Geometry, North-Holland, 1992.
10. H Edelsbrunner, D G Kirkpatrick, and R Seidel. On the shape of a set of point, 6 in the plane. IEEE Transactions on Information Theory, IT-29(4):551-559, 1983.
11. H Edelsbrunner and E P Mficke. Simulation of Simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Gmphics, 9(1):66-104, 1990.
12. H Edelsbrunner and N R Shah. Incremental topological flipping works for regular triangulations. In Proceedings of the 8th Annual Symposium on Computational Geometry, pages 43-52, 1992.
13. J Fairfield. Contoured shape generation: forms that people see in dot patterns. In Proceedings of the IEEE Conference on Cybernetics and Society, pages 60-64, 1979.
14. J Fairfield. Segmenting dot patterns by Voronoi diagram concavity. IEEE Transactions on Pattern Analysis and Machine Intelligence, 5(1):104-110, 1983.
15. M J Geller :tnd J P Huchra. Mapping the universe. Science, 246:897-903, November l989.
16. Ch Ghefis and J Yon. Protein Folding. Academic Press, 1982.
17. P J Giblin. Graphs, Surfaces, and Homology. Second edition. Chapman and Hall, London, 1981.
18. L J Guibas and J Stolfi. Primitives for manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Transactions on Graphics, 4(2):74-123, 1985.
19. R A Jarvis. Computing the shape hull of points in the plane. In Proceedings of the IEEE Computing Society Conference on Pattern Recognition and Image Processing, pages 231-241, 1977.
20. B Joe. Construction of three-dimensional Delaunay triangulations using local transformations. Computer Aided Geometric Design, 8(2):1123-142, 1991.
21. B Joe. Three-dimensional triangulations from local transformations. SIAM Joumol on Scientific and Statistid Computing, 10(4):X8-741, 1989.
22. C L Lawson. Software for C surface interpolation. In J R Rice, editor, Mathematical Software III, pages 161-194, Academic Press, New York, 1977.
23. C Lee. Regular triangulations of convex polytopes. In P Gritzmann and B Sturmfels, editors, Applied Geometry and Discrete Mathematics: The Victor like Festschrijt, pages 443-456, American Mathematical Society, Providence, RI, 1991.
24. W E Lorensen and H E Cline. Marching cubes: A hiih resolution 3D surface construction algorithm. Computer Graphics, 21(4):163-169, 1987. ACM Siggraph 87. Conference Proceedings.
25. J MatonSek and O Schwarzkopf. Linear optimization queries. In Proceedings of the 8th Annual Symposium on Computational Geometry, pages 16-25, 1992.
26. D W Matula and R R Sokal. Properties of Gabriel graphs rebwant to geographic variation research and the clustering of points in the plane. Geographical Analysis, 12(3):205-222, 1980.
27. W W Moss. Some new analytic and graphic approaches to numerical taxonomy, with an example from the Dermanyssidae (Atari). Systematic Zoology, 16:177-207, 1967.
28. F P Preparata and M I Shames. Computotionol Geometry-A.n Introduction. Springer-Verlag, New York, 1985.
29. F M Richards. The protein folding problem. Scientific American, 264(1):54-63, 1991.
30. R Seidel. Constructing higher-dimensional convex hulls in logarithmic cost per face. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pages 484-507, Berkeley, California, 1986.
31. R Seidel. Elxact upper bounds for the number of faces in d-dimensional Voronoi diagrams. In P Gritsmann and B Sturmfels, editors, Applied Geometry and Discrete Mathematics: The Victor Klee Fertschrift, pages 517-530, American Mathematical Society, Providence, RI, 1991.
32. G T Toussaint. The relative neighborhood graph of a finite planar set. Patlern Recognition, 12(4):261-268, 1980.