Three-Dimensional Alpha Shapes

ACM Transactions on Graphics (TOG)

Volumn 13, Issue 1, 1994, Pages 43-72

  Edelsbrunner, Herbert ^a   Mücke, Ernst P ^a  

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

Author keywords

computational graphics; Delaunay triangulations; geometric algorithms; point sets; polytopes; robust implementation; scientific computing; scientific visualization; simplicial complexes; simulated perturbation; three dimensional space

Indexed keywords

BODIES OF REVOLUTION; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER GRAPHICS; DATA STRUCTURES; MATHEMATICAL INSTRUMENTS; NATURAL SCIENCES COMPUTING; PERTURBATION TECHNIQUES; RELIABILITY; SET THEORY; TRIANGULATION; VISUALIZATION;

DELAUNAY TRIANGULATION; GEOMETRIC ALGORITHMS; OBJECT REPRESENTATIONS; POINT SETS; POLYTOPES; SCIENTIFIC VISUALIZATION; SIMPLICIAL COMPLEXES; SIMULATED PERTURBATION; THREE DIMENSIONAL ALPHA SHAPES; THREE DIMENSIONAL SPACE;

ALGORITHMS;

EID: 0028259338     PISSN: 07300301     EISSN: 15577368     Source Type: Journal    
DOI: 10.1145/174462.156635     Document Type: Article

References (42)

1. BOISSONNAT, J. D. 1984. Geometric structures for three-dimensional shape representation. ACM Trans. Graph. 3, 4, 266-286.
2. BRISSON, E. 1993. Representing geometric structures in d dimensions: Topology and order. Discr. Comput. Geom. 9, 4, 387-426.
3. BRONSTED, A. 1983. An Introduction to Convex Polytopes. Graduate Texts in Mathematics. Springer-Verlag, New York.
4. CEN, R. Y., JAMESON, A., Liu, F. AND OSTRIKER, J. P. 1990. The universe in a box: Thermal effects in a standard cold dark matter scenario. Astrophys. J. (Letters), L41, 362.
5. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. 1990. Introduction to Algorithms. MIT Press, Cambridge, Mass.
6. DELAUNAY, B. 1934. Sur la sphère vide. Izvestia Akademii Nauk SSSR, Otdelenie Matem-aticheskii i Estestvennyka Nauk 7 793-800. In French.
7. DOBKIN, D. P., AND LASZLO, M. J. 1989. Primitives for the manipulation of three-dimensional subdivisions. Algorithmica 4, 1, 3-32.
8. DREBIN, R. A., CARPENTER, L., AND HANRAHAN, P. 1988. Volume rendering. Comput. Graph. 22, 4, 65-74.
9. DWYER, R. A. 1991. Higher-dimensional Voronoi diagrams in linear expected time. Discr. Comput. Geom. 6, 4, 343-367.
10. DYKSTERHOUSE, M. D. 1992. An alpha-shape view of our universe. Master's thesis, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, Urbana, Ill.
11. EDELSBRUNNER, H. 1992a. Geometric algorithms. In Handbook of Convex Geometry. North-Holland, Amsterdam, 699-735.
12. EDELSBRUNNER, H. 1992b. Weighted alpha shapes. Tech. Rep. UIUCDCS-R-92-1760, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, Urbana, Ill.
13. EDELSBRUNNER, H. 1987. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin.
14. EDELSBRUNNER, H., KIRKPATRICK, D. G., AND SEIDEL, R. 1983. On the shape of a set of points in the plane. IEEE Trans. Inf. Theor. IT-29, 4, 551-559.
15. EDELSBRUNNER, H., AND MÜCKE, E. P. 1990. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph. 9, 1, 66-104.
16. EDELSBRUNNER, H. AND SHAH, N. R. 1992. Incremental topological flipping works for regular triangulations. In Proceedings of the 8th Annual Symposium on Computational Geometry. ACM, New York, 43-52.
17. FAIRFIELD, J. 1979. Contoured shape generation: Forms that people see in dot patterns. In Proceedings of the IEEE Conference on Cybernetics and Society, IEEE, New York 60-64.
18. FAIRFIELD, J. 1983. Segmenting dot patterns by Voronoi diagram concavity. IEEE Trans. Patt. Anal. Mach. Intell. 5, 1, 104-110.
19. GELLER, M. J., AND HUCHRA, J. P. 1989. Mapping the universe. Science 246, 897-903.
20. GHÉLIS, C., AND YON, J. 1982. Protein Folding. Academic Press, New York.
21. GIBLIN, P. J. 1981. Graphs, Surfaces, and Homology. 2nd ed. Chapman and Hall, London.
22. GUIBAS, L. J., AND STOLFI, J. 1985. Primitives for manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graph. 4, 2, 74-123.
23. JARVIS, R. A. 1977. Computing the shape hull of points in the plane. In Proceedings of the IEEE Computing Society Conference on Pattern Recognition and Image Processing. IEEE, New York, 231-241.
24. JOE, B. 1991. Construction of three-dimensional Delaunay triangulations using local transformations. Comput. Aided Geom. Des. 8, 2, 123-142.
25. JOE, B. 1989. Three-dimensional triangulations from local transformations. SIAM J. Sci. Stat. Comput. 10, 4, 718-741.
26. KIRKPATRICK, D. G., AND RADKE, J. D. 1985. A framework for computational morphology. In Computational Geometry. Elsevier North Holland, New York, 234-244.
27. LAWSON, C. L. 1977. Software for C1 surface interpolation. In Mathematical Software III. Academic Press, New York, 161-194.
28. LEE, C. 1991. Regular triangulations of convex polytopes. In Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. American Mathematical Society, Providence, R.I., 443-456.
29. LORENSEN, W. E., AND CLINE, H. E. 1987. Marching cubes: A high resolution 3D surface construction algorithm. Comput. Graph. 21, 4, 163-169.
30. MATOUŠEK, J., AND SCHWARZKOPF, O. 1992. Linear optimization queries. In Proceedings of the 8th Annual Symposium on Computational Geometry. ACM, New York, 16-25.
31. MATULA, D. W., AND SOKAL, R. R. 1980. Properties of Gabriel graphs relevant to geographic variation research and the clustering of points in the plane. Geograph. Anal. 12, 3, 205-222.
32. MCMULLEN, P. AND SHEPARD, G. C. 1971. Convex Polytopes an the Upper Bound Conjecture. Cambridge University Press, London.
33. Moss, W. W. 1967. Some new analytic and graphic approaches to numerical taxonomy, with an example from the Dermanyssidae (Acari). Syst. Zoo. 16, 177-207.
34. MÜCKE, E. P. 1993. Shapes and implementations in three-dimensional geometry. Ph.D. thesis, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, Ubana, Ill.
35. PREPARATA, F. P., AND SHAMOS, M. I. 1985. Computational Geometry-An Introduction. Springer-Verlag, New York.
36. RICHARDS, F. M. 1991. The protein folding problem. Sci. Am. 264, 1, 54-63.
37. SEIDEL, R. 1991. Exact upper bounds for the number of faces in d-dimensional Voronoi diagrams. In Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. American Mathematical Society, Providence, R.I., 517-530.
38. SEIDEL, R. 1986. Constructing higher-dimensional convex hulls in logarithmic cost per face. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing. ACM, New York, 484-507.
39. TOUSSAINT, G. T. 1980. The relative neighborhood graph of a finite planar set. Patt. Recog. 12, 4, 261-268.
40. VELTKAMP, R. C. 1992. Closed object boundaries from scattered points. Ph.D. thesis, Erasmus Univ. Rotterdam.
41. VORONOI, G. 1908. Nouvelles applications de paramètres continus à la théorie des formes quadratiques. Deuxième Mémoire: Recherches sur les parallélloèdres primitifs. Journal für die Reine und Angewandte Mathematik 134, 198-287. In French.
42. VORONOI, G. 1907. Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Premier Mémoire: Sur quelques propriétés de formes quadratiques positives parfaites. Journal für die Reine und Angewandte Mathematik 133, 97-178. In French.