David Eppstein - Publications

• Optimal point placement for mesh smoothing.
  N. Amenta, M. Bern, and D. Eppstein.
  8th ACM-SIAM Symp. Discrete Algorithms, New Orleans, 1997, pp. 528–537.
  Symp. Computational Geometry Approaches to Mesh Generation, SIAM 45th Anniversary Mtg., Stanford, 1997.
  arXiv:cs.CG/9809081.
  J. Algorithms 30: 302–322, 1999 (special issue for SODA 1997).

  We study finite element mesh smoothing problems in which we move vertex locations to optimize the shapes of nearby triangles. Many such problems can be solved in linear time using generalized linear programming; we also give efficient algorithms for some non-LP-type mesh smoothing problems. One lemma may be of independent interest: the locus of points in R^d from which a d-1 dimensional convex set subtends a given solid angle is convex.

  (SODA paper)

Publications – David Eppstein – Theory Group – Inf. & Comp. Sci. – UC Irvine

Semi-automatically filtered from a common source file.