(Enter summary)
Abstract: . Frequently, data in scientific computing is in its abstract form a finite point set in
space, and it is sometimes useful or required to compute what one might call the "shape" of the
set. For that purpose, this paper introduces the formal notion of the family of ff-shapes of a finite
point set in IR
3
. Each shape is a well-defined polytope, derived from the Delaunay triangulation
of the point set, with a parameter ff 2 IR controlling the desired level of detail. An algorithm is
presented... (Update)
Context of citations to this paper: More .... are investigated by analytical computational geometry, using the atomic coordinates of several Gla domain structures in BH PDB [24,25] . Our results demonstrate that electrostatic interac tions play a significant role in the activation of factor IX, both in aqueous and... ...with its van der Waals radius. The topological and combinatorial structure of this model has recently been explored by Edelsbrunner [9, 10, 11] . In particular from such formalizationany information regarding the topological structure and the corresponding geometry of the... Cited by: More
Dynamic Maintenance and Visualization of - Molecular Surfaces Chandrajit
(Correct)
Automatic surface reconstruction from point sets in space - Attene, Spagnuolo (2000)
(Correct)
NURBS based B-rep Models for Macromolecules - And Their Properties
(Correct)
Similar documents (at the sentence level):
12.7% : Shapes And Implementations In Three-Dimensional Geometry - Mücke (1993)
(Correct)
Active bibliography (related documents): More All
0.7 : Relative Neighborhood Graphs and Their Relatives - Jaromczyk, Toussaint (1992)
(Correct)
0.6 : On The Shape Of Three Dimensional Set Of Points - Chen, Melkemi, al.
(Correct)
0.6 : A Robust Implementation For Three-Dimensional Delaunay.. - Mücke (1995)
(Correct)
Users who viewed this document also viewed: More All
0.2 : Computational Geometry II - Lee
(Correct)
0.1 : Computational Topology - Dey, Edelsbrunner, Guha (1999)
(Correct)
0.1 : Face Recognition using View-Based and Modular Eigenspaces - Moghaddam, Pentland (1994)
(Correct)
Similar documents based on text: More All
0.2 : Optimal Two-Dimensional Triangulations - Tan (1993)
(Correct)
0.2 : Geometric Clusterings - Vasilis Capoyleas Unter
(Correct)
0.2 : Euclidean Bounded-Degree Spanning Tree Ratios - Timothy Chan School
(Correct)
Related documents from co-citation: More All
41 : Surface Reconstruction from Unorganized Points
- Hoppe, DeRose et al. - 1992
21 : Geometric structures for three-dimensional shape representation (context) - Boissonnat - 1984
21 : A Volumetric Method for Building Complex Models from Range Images
- Curless, Levoy - 1996
BibTeX entry: (Update)
H. Edelsbrunner and E. P. Mucke, "Three-dimensional Alpha Shapes", Technical Report Rept. UIUCDCS-R-92-1734, Comput. Sci. Dept., Univ., Illinois, Urbana, Illinois, 1992. http://citeseer.nj.nec.com/edelsbrunner94threedimensional.html More @article{ edelsbrunner94threedimensional,
author = "Herbert Edelsbrunner and Ernst P. M{\"{u}}cke",
title = "Three-Dimensional Alpha Shapes",
journal = "ACM Transactions on Graphics",
volume = "13",
number = "1",
pages = "43--72",
year = "1994",
url = "citeseer.nj.nec.com/edelsbrunner94threedimensional.html" }
Citations (may not include all citations):
2998
Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1114
Computational Geometry --- An Introduction (context) - Preparata, Shamos - 1985
429
Algorithms in Combinatorial Geometry (context) - Edelsbrunner - 1987
330
Marching cubes: A high resolution 3D surface construction al.. (context) - Lorensen, Cline - 1987
223
Primitives for manipulation of general subdivisions and the .. (context) - Guibas, Stolfi - 1985
122
Simulation of Simplicity: A technique to cope with degenerat..
- Edelsbrunner, Mucke - 1990
58
Geometric structures for three-dimensional shape representat.. (context) - Boissonnat - 1984
56
A framework for computational morphology (context) - Kirkpatrick, Radke - 1985
51
Incremental topological flipping works for regular triangula.. (context) - Edelsbrunner, Shah - 1992
49
Constructing higher-dimensional convex hulls in logarithmic .. (context) - Seidel - 1986
45
The relative neighborhood graph of a finite planar set (context) - Toussaint - 1980
34
Higher-dimensional Voronoi diagrams in linear expected time (context) - Dwyer - 1991
34
Primitives for the manipulation of three-dimensional subdivi.. (context) - Dobkin, Laszlo - 1989
33
surface interpolation (context) - Lawson - 1977
32
Properties of Gabriel graphs relevant to geographic variatio.. (context) - Matula, Sokal - 1980
31
Convex Polytopes and the Upper Bound Conjecture (context) - McMullen, Shepard - 1971
31
Construction of three-dimensional Delaunay triangulations us.. (context) - Joe - 1991
30
Three-dimensional triangulations from local transformations (context) - Joe - 1989
28
Representing geometric structures in d dimensions: Topology .. (context) - Brisson - 1993
26
Linear optimization queries
- Matousek, Schwarzkopf - 1992
26
An Introduction to Convex Polytopes (context) - Bronsted - 1983
24
IEEE Transactions on Information Theory (context) - Edelsbrunner, Kirkpatrick et al. - 1983
20
Closed Object Boundaries from Scattered Points (context) - Veltkamp - 1992
19
Otdelenie Matematicheskii i Estestvennyka Nauk (context) - Delaunay, sphere et al. - 1934
17
Regular triangulations of convex polytopes (context) - Lee - 1991
17
etres continus `a la th (context) - Voronoi, des - 1907
17
etres continus `a la th (context) - Voronoi, des - 1908
15
Chapman and Hall (context) - Giblin, Surfaces et al. - 1981
13
Department of Computer Science (context) - Edelsbrunner, shapes et al. - 1992
8
Shapes and Implementations in Three-Dimensional Geometry (context) - Mucke - 1993
7
The protein folding problem (context) - Richards - 1991
6
Exact upper bounds for the number of faces in d-dimensional .. (context) - Seidel - 1991
6
Contoured shape generation: Forms that people see in dot pat.. (context) - Fairfield - 1979
6
Segmenting dot patterns by Voronoi diagram concavity (context) - Fairfield - 1983
5
Mapping the universe (context) - Geller, Huchra - 1989
5
Computing the shape hull of points in the plane (context) - Jarvis - 1977
3
Protein Folding (context) - Gh'elis, Yon - 1982
3
Some new analytic and graphic approaches to numerical taxono.. (context) - Moss - 1967
2
Conference Proceedings (context) - Drebin, Carpenter et al. - 1988
2
An alpha-shape view of our universe (context) - Dyksterhouse - 1992
1
The universe in a box: Thermal effects in a standard cold da.. (context) - Cen, Jameson et al. - 1990
1
Geometric algorithms (context) - Edelsbrunner - 1992
The graph only includes citing articles where the year of publication is known. Documents on the same site (http://www.geom.umn.edu/software/cglist/GeomDir/welcome.html):
Simulation of Simplicity: A Technique to Cope with.. - Edelsbrunner, Mücke (1990)
(Correct)
Online articles have much greater impact More about CiteSeer Add search form to your site Submit documents Feedback
Feedback: feedback a t researchi ndex.org CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute