#### Filter Results:

#### Publication Year

1985

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Nina Amenta, Marshall W. Bern
- Discrete & Computational Geometry
- 1998

We give a simple combinatorial algorithm that computes a piecewise-linear approximation of a smooth surface from a nite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled surfaces, where density depends on \local feature size", the… (More)

- Nina Amenta, Marshall W. Bern, Manolis Kamvysselis
- SIGGRAPH
- 1998

We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in I R 3. The algorithm is the first for this problem with provable guarantees. Given a " good sample " from a smooth surface, the output is guaranteed to be topologically correct and convergent to the original surface as the sampling density… (More)

We construct a graph on a planar point set, which captures its shape in the following sense: if a smooth curve is sampled densely enough, the graph on the samples is a polygonalization of the curve, with no extraneous edges. The required sampling density v aries with the Local Feature Size on the curve, so that areas of less detail can besampled less… (More)

- Marshall W. Bern, Paul E. Plassmann
- Inf. Process. Lett.
- 1989

We survey the computational geometry relevant to nite element mesh generation. We especially focus on optimal triangulations of geometric domains in two-and three-dimensions. An optimal triangulation is a partition of the domain into triangles or tetrahedra, that is best according to some criterion that measures the size, shape, or number of triangles. We… (More)

- Marshall W. Bern, David Eppstein, John R. Gilbert
- FOCS
- 1990

We study several versions of the problem of generating triangular meshes for finite element methods. We show how to triangulate a planar point set or polygonally bounded domain with triangles of bounded aspect ratio; how to triangulate a planar point set with triangles having no obtuse angles; how to triangulate a point set in arbitrary dimension with… (More)

- Marshall W. Bern, Eugene L. Lawler, A. L. Wong
- J. Algorithms
- 1987

- Yuanxin Zhu, Bridget Carragher, +14 authors Clinton S Potter
- Journal of structural biology
- 2004

Manual selection of single particles in images acquired using cryo-electron microscopy (cryoEM) will become a significant bottleneck when datasets of a hundred thousand or even a million particles are required for structure determination at near atomic resolution. Algorithm development of fully automated particle selection is thus an important research… (More)

- Nina Amenta, Marshall W. Bern, David Eppstein
- Graphical Models and Image Processing
- 1998

- Leonardo B. Oliveira, Hao Chi Wong, Marshall W. Bern, Ricardo Dahab, Antonio Alfredo Ferreira Loureiro
- Fifth IEEE International Symposium on Network…
- 2006

Clustered sensor networks have been shown to increase system throughput, decrease system delay, and save energy. While those with rotating cluster heads, such as LEACH, have also advantages in terms of security, the dynamic nature of their communication makes most existing security solutions inadequate for them. In this paper, we show how random key… (More)