Nina Amenta, Marshall Bern, David Eppstein  Home/Search
Context Related
| uci.edu/~eppstein/...BerEppSODA97.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uci.edu/~eppstein/pubs/all (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the problem of moving a vertex in a finite element mesh to optimize the shapes of adjacent triangles. We show that many such problems can be solved in linear time using generalized linear programming. We also give efficient algorithms for some mesh smoothing problems that do not fit into the generalized linear programming paradigm. 1 Introduction Unstructured mesh generation, a key step in the finite element method, can be divided into two stages. In point placement, the input domain ... (Update)
Cited by: More
Spacetime Meshing for Discontinuous Galerkin Methods - Thite (2004) (Correct)
Compact Representations for Fast Nonrigid Registration of Medical .. - Timoner (2003) (Correct)
An Optimal Randomized Algorithm for Maximum Tukey Depth - Chan (2004) (Correct)
Active bibliography (related documents): More All
0.3: Applying Non-parametric Robust Bayesian Analysis to.. - By Joseph Kadane (1999) (Correct)
0.3: The Behrens-Fisher problem revisited: A Bayes-frequentist.. - Ghosh, Kim (2001) (Correct)
0.2: Randomized Algorithms for Geometric Optimization Problems - Agarwal, Sen (2000) (Correct)
Similar documents based on text: More All
0.4: K-Transversals of Parallel Convex Sets - Amenta (1996) (Correct)
0.4: Flipping Cubical Meshes - Marshall Bern David (2001) (Correct)
0.2: Emerging Challenges in Computational Topology - Bern, Eppstein, al. (1999) (Correct)
Related documents from co-citation: More All
14: Optismoothing: An optimization-driven approach to mesh smoothing (context) - Canann, Stephenson et al. - 1993
14: Mesh smoothing using a posteriori error estimates - Bank, Smith - 1997
13: An efficient parallel algorithm for mesh smoothing - Freitag, Jones et al. - 1995
BibTeX entry: (Update)
N. Amenta, M. Bern, and D. Eppstein, Optimal point placement for mesh smoothing, in 8th ACM-SIAM Symp. on Discrete Algorithms, New Orleans, to appear. http://citeseer.ist.psu.edu/amenta97optimal.html More
@inproceedings{ amenta97optimal,
author = "Amenta and Bern and Eppstein",
title = "Optimal Point Placement for Mesh Smoothing",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1997",
url = "citeseer.ist.psu.edu/amenta97optimal.html" }
Citations (may not include all citations):227 An analysis of the finite element method (context) - Strang, Fix - 1973
185 Applying parallel computation algorithms in the design of se.. (context) - Megiddo - 1983
117 Mesh generation and optimal triangulation - Bern, Eppstein - 1995
81 A subexponential bound for linear programming - sek, Sharir et al. - 1992
42 Data dependent triangulations for piecewise linear interpola.. (context) - Dyn, Levin et al. - 1990
42 Parallel algorithms for higher dimensional convex hulls - Amato, Goodrich et al. - 1994
39 the construction of abstract Voronoi diagrams (context) - Mehlhorn, Meiser et al. - 1991
33 Mesh smoothing using a posteriori error estimates - Bank, Smith
30 Helly-type theorems and generalized linear programming - Amenta - 1994
28 Geometric partitioning made easier (context) - Goodrich - 1993
26 On optimal interpolation triangle incidences (context) - D'Azevedo, Simpson - 1989
24 Randomized incremental construction of abstract Voronoi diag.. (context) - Klein, Mehlhorn et al. - 1993
23 An efficient parallel algorithm for mesh smoothing - Freitag, Jones et al. - 1995
21 A comparison of tetrahedral mesh improvement techniques - Freitag, Ollivier-Gooch - 1996
19 The algebraic degree of geometric optimization problems (context) - Bajaj - 1988
18 Sur le point pour lequel la somme des distances de n points .. (context) - Weiszfeld - 1937
17 Quasi-greedy triangulations approximating the minimum weight.. - Levcopoulos, Krznaric - 1996
16 Dihedral bounds for mesh generation in high dimensions - Bern, Chew et al. - 1995
13 Automated contour mapping using triangular element data stru.. (context) - Gold, Charters et al. - 1977
13 the angle condition in the finite element method (context) - ska, Aziz - 1976
12 A randomization scheme for speeding up algorithms for linear.. (context) - Adler, Shamir - 1993
11 A randomized algorithm for fixed-dimensional linear programm.. (context) - Dyer, Frieze - 1989
11 Mesh generation - Bern, Plassmann - 1996
11 Approximating the minimum weight Steiner triangulation - Eppstein - 1994
10 connected subgraph of the minimum weight triangulation (context) - Dickerson, Montague et al. - 1996
7 A subexponential algorithm for abstract optimization problem.. (context) - artner - 1995
6 Minimum energy triangulations for elliptic problems (context) - Rippa, Schiff - 1990
3 Convexity and Applications (context) - Dharmadhikari, Joag-Dev - 1988
1 Euclidean constructability in graph minimization problems (context) - Cockayne, Melzak - 1969
1 the measure of solid angles (context) - Eriksson - 1990
1 Scalable unstructured mesh computation (context) - Freitag, Ollivier-Gooch et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ics.uci.edu/~eppstein/pubs/all.html): More
Linear Complexity Hexahedral Mesh Generation - Eppstein (1996) (Correct)
Ununfoldable Polyhedra - Bern, Demaine, Eppstein, Kuo (1999) (Correct)
Parametric and Kinetic Minimum Spanning Trees - Agarwal, Eppstein, Guibas.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC