Ernst Peter Mücke  Home/Search
Context
Related
| uiuc.edu/Visualiza...DCSR931836.ps.Z Cached: PS.gz PS PDF DjVu Image Update Help From: uiuc.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is often useful or required to compute what one might call the "shape" of the set. For that purpose, this thesis deals with the formal notion of the family of alpha shapes of a finite point set in three- dimensional space. Each shape is a well-defined polytope, derived from the Delaunay triangulation of the point set, with a real parameter controlling the desired level of detail. Algorithms and... (Update)
Similar documents (at the sentence level):
5.2%: Three-dimensional Alpha Shapes - Edelsbrunner, Mücke (1994) (Correct)
Active bibliography (related documents): More All
1.3: A Robust Implementation For Three-Dimensional Delaunay.. - Mücke (1995) (Correct)
0.7: Relative Neighborhood Graphs and Their Relatives - Jaromczyk, Toussaint (1992) (Correct)
0.6: Interactive Direct Volume Rendering Of Curvilinear And.. - Williams (1992) (Correct)
Similar documents based on text: More All
0.3: Simulation of Simplicity: A Technique to Cope with.. - Edelsbrunner, Mücke (1990) (Correct)
0.1: Gamut boundary determination using alpha-shapes - Cholewo, Love (1999) (Correct)
0.1: EMM Estimation of Affine and Nonaffine Term Structure Models - Duffee, Stanton (2000) (Correct)
BibTeX entry: (Update)
@misc{ cke-shapes,
author = "Ernst Peter Mücke",
title = "Shapes And Implementations In Three-Dimensional Geometry",
url = "citeseer.nj.nec.com/514237.html" }
Citations (may not include all citations):2929 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1102 Computational Geometry An Introduction (context) - Preparata, Shamos - 1985
329 Marching cubes: A high resolution 3D surface construction al.. (context) - Lorensen, Cline - 1987
219 Primitives for manipulation of general subdivisions and the .. (context) - Guibas, Stolfi - 1985
158 Volume 2: S'eminumerical Algorithms (context) - Knuth, of - 1969
120 Simulation of Simplicity: A technique to cope with degenerat.. - Edelsbrunner, Mficke - 1990
85 Randomized incremental construction of Delaunay and Voronoi .. (context) - Guibas, Knuth et al. - 1990
76 Data Structures and Algorithms 3: Multidimensional Sorting a.. (context) - Mehlhorn - 1984
65 Verifiable implementations of geometric algorithms using fin.. (context) - Milenkovic - 1988
57 Geometric structures for three-dimensional shape representat.. (context) - Boissonnat - 1984
54 A framework for computational morphology (context) - Kirkpatrick, Radke - 1985
53 Epsilon geometry: Building robust algorithms from inprecise .. (context) - Guibas, Salesin et al. - 1989
53 A geometric consistency theorem for a symbolic perturbation .. (context) - Yap - 1988
51 Towards exact geometric computation - Yap - 1993
50 Efficient exact arithmetic for computational geometry - Fortune, Van Wyk - 1993
49 Incremental topological flipping works for regular triangula.. (context) - Edelsbrunner, Shah - 1992
49 Convex hulls of finite sets of points in two and three dimen.. (context) - Preparata, Hong - 1977
49 Constructing higher-dimensional convex hulls in logarithmic .. (context) - Seidel - 1986
44 Computing Dirichlet tessellations (context) - Bowyer - 1981
42 The relative neighborhood graph of a finite planar set (context) - Toussaint - 1980
37 The union of balls and its dual shape (context) - Edelsbrunner - 1993
35 Voronoi diagrams from convex hulls (context) - Brown - 1979
35 Efficient Delaunay triangulation using rational arithmetic (context) - Karasick, Lieher et al. - 1991
34 Relative neighborhood graphs and their relatives - Jaromczyk, Toussaint - 1992
34 Primitives for the manipulation of three-dimensional subdivi.. (context) - Dobkin, Laszlo - 1989
34 Higher-dimensional Voronoi diagrams in linear expected time (context) - Dwyer - 1991
33 surface interpolation (context) - Lawson - 1977
32 An efficient approach to removing geometric degeneracies - Emiris, Canny - 1992
32 A general approach to removing degeneracies - Emiris, Canny - 1991
31 Computing Dirichlet tessellations in the plane (context) - Green, Sibson - 1978
31 Convex Polytopes and the Upper Bound Conjecture (context) - McMullen, Shepard - 1971
31 Stable maintenance of point-set triangulations in two dimens.. (context) - Fortune - 1989
31 Construction of three-dimensional Delaunay triangulations us.. (context) - Joe - 1991
30 Properties of Gabriel graphs relevant to geographic variatio.. (context) - Matula, Sokal - 1980
29 Three-dimensional triangulations from local transformations (context) - Joe - 1989
29 An incremental algorithm for Betti numbers of simplicial com.. (context) - Delfinado, Edelsbrunner - 1993
27 Representing geometric structures in d dimensions: Topology .. (context) - Brisson - 1993
26 An Introduction to Convex Polytopes (context) - Br - 1983
25 Symbolic treatment of geometric degeneracies (context) - Yap - 1987
23 IEEE Transactions an Information Theory (context) - Edelsbrunner, Kirkpatrick et al. - 1983
19 Otdelenie Matematicheskii i Estestven- nyka Nauk (context) - Delaunay, sphere et al. - 1934
19 Lecture Notes in Computer S'cience (context) - Knuth, Hulls - 1992
17 Regular triangulations of convex polytopes (context) - Lee - 1991
15 Chapman and Hall (context) - Giblin, Surfaces et al. - 1981
13 Department of Com- puter Science (context) - Edelsbrunner, shapes et al. - 1992
13 A convex hull algorithm optimal for point sets in even dimen.. (context) - Seidel - 1981
12 Calculating approximate curve arrangements using rounded ari.. - Milenkovic - 1989
12 BigNum: A Portable and Efficient Package for Arbitrary- Prec.. - Serpette, Vuillemin et al.
12 Numerical stability of geometric algorithms (context) - Ottman, Thiemt et al. - 1987
11 Computational geometry a survey (context) - Lee, Preparata - 1984
8 Computationalgeometry and computer graphics - Dobkin - 1992
8 Generation of a triangular grid with applications to contour.. (context) - Lawson - 1972
8 Voronoi diagrams a survey of a fundamental data structure (context) - Aurenhammer - 1991
7 The protein folding problem (context) - Richards - 1991
6 Segmenting dot patterns by Voronoi diagram concavity (context) - Fairfield - 1983
6 Contoured shape generation: Forms that people see in dot pat.. (context) - Fairfield - 1979
6 Algorithms and Data Structures with Applications to Graphics.. (context) - Nievergelt, Hinrichs - 1993
6 Exact upper bounds for the number of faces in d-dimensional .. (context) - Seidel - 1991
5 Calculation of molecular volumes and areas for structures of.. (context) - Richards - 1985
5 Computing the shape hull of points in the plane (context) - Jarvis - 1977
5 Computational geometry in practice (context) - Forrest - 1985
3 Department of Computer Science (context) - Mcke, implementation et al. - 1988
3 Some new analytic and graphic approaches to numerical taxono.. (context) - Moss - 1967
2 Nouvelles applications des paramatres continus h la thorie d.. (context) - Voronoi - 1907
2 An alpha-shape view of our universe (context) - Dyksterhouse - 1992
2 Computers and Graphics (context) - Pickover, on et al. - 1988
2 Constructing Delaunay and regular triangulations in three di.. (context) - Facello - 1993
2 Conference Proceedings (context) - Drebin, Carpenter et al. - 1988
2 Degeneracy Control in Geometric Programs (context) - Rosenberger - 1990
2 Nouvelles applications des paramatres continus h la thorie d.. (context) - Voronoi - 1908
1 Molecular interstitial skeleton (context) - Cormoily - 1991
1 Molecular surface triangulation (context) - Cormoily - 1985
1 An Implementation of a Plane-5'weep Algorithm on a Personal .. (context) - Beretta - 1984
1 Optimality of the Delaunay triangulation on Ed (context) - Rajah - 1991
1 A merge-first divide-and-conquer algorithm for E d Delaunay .. (context) - Cignoni, Montani et al. - 1992
1 Analytical molecular surface calculation (context) - Cormoily - 1983
1 Closed Object Boundaries from 3'cartered Points (context) - Veltkamp - 1992
1 Computation of molecular volume (context) - Cormoily - 1985
1 Elsevier North Holland (context) - Tonssaint, Computational - 1985
1 NCSA Technical Report UIUCNCSA-TR (context) - Edelsbrunner, Fu et al. - 1993
1 Algorithms in Cambinatarial Geometry (context) - Edelsbrunner - 1987
1 Handbook of Convex Geometry (context) - Edelsbrunner, To et al. - 1992
1 Protein Folding (context) - Ghdis, Yon - 1982
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.ncsa.uiuc.edu.html): More
Surviving the Three Revolutions in Social Science Computing - Richard Rockwell (Correct)
The Evolution Of Cosmic Ray Mediated Mhd Shocks : A Two-Fluid.. - Byung-Il Jun (Correct)
The Evolution Of Cosmic Ray Mediated Mhd Shocks : A Two-Fluid.. - Byung-Il Jun (Correct)
Online articles have much greater impact More about CiteSeer Add search form to your site Submit documents
CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute