Mesh Generation

• Optimal Point Placement for Mesh Smoothing
  N. Amenta, M. Bern, and D. Eppstein
  8th ACM-SIAM Symposium on Discrete Algorithms, 1997, 528-537.

• Dihedral Bounds for Mesh Generation in High Dimensions
  M. Bern, L.P. Chew, D. Eppstein, and J. Ruppert
  6th ACM-SIAM Symposium on Discrete Algorithms, 1995, 189-196.

• Linear-size Nonobtuse Triangulation of Polygons
  M. Bern, S. Mitchell, and J. Ruppert
  10th ACM Symposium on Computational Geometry, 1994, 221-230.
  Discrete and Computational Geometry 14 (1995) 411-428.

• Parallel Construction of Quadtrees and Quality Triangulations
  M. Bern, D. Eppstein, and S.-H. Teng
  3rd Workshop on Algorithms and Data Structures, Springer-Verlag LNCS 709 (1993) 188-199.

• Compatible Tetrahedralizations
  M. Bern
  9th ACM Symposium on Computational Geometry, 1993, 281-288.
  Fundamenta Informaticae 2 (1994) 371-384.

• Triangulating Polygons without Large Angles
  M. Bern, D. Dobkin, and D. Eppstein
  8th ACM Symposium on Computational Geometry, 1992, 222-231.
  Int. J. Comp. Geom. and Applic. 5 (1995) 171-192.

• Edge Insertion for Optimal Triangulations
  M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T.-S. Tan
  1st Latin Amer. Symp Theoretical Informatics, Sao Paulo, Springer-Verlag LNCS 583, 1992, 46-60.
  Discrete and Computational Geometry 10 (1992) 47-65.

• Polynomial-Size Nonobtuse Triangulation of Polygons
  M. Bern and D. Eppstein
  7th ACM Symposium on Computational Geometry, 1991, 342-350.
  Int. J. Comp. Geom. and Applic. 2 (1992) 241-255.

• Provably Good Mesh Generation
  M. Bern, D. Eppstein, and J. Gilbert
  31st IEEE Foundations of Computer Science , 1990, 231-241.
  Journal of Computer and System Sciences 48 (1994) 384-409.

Graphics

• A New Voronoi-Based Surface Reconstruction Algorithm
  N. Amenta, M. Bern, and M. Kamvysselis
  Computer Graphics, Proceedings ACM Siggraph 98, 1998, 415-421.

• Surface Reconstruction by Voronoi Filtering
  N. Amenta and M. Bern
  14th ACM Symposium on Computational Geometry, 1998, 39-48.

• The Crust and the Beta-Skeleton: Combinatorial Curve Reconstruction
  N. Amenta, M. Bern, and D. Eppstein,
  Graphical Models and Image Processing 60/2 (1998), 125-135.

• Hidden Surface Removal for Rectangles
  M. Bern
  4th ACM Symposium on Computational Geometry, 1988, 183-192.
  Journal of Computer and System Sciences 40 (1990) 49-69

• Visibility with a Moving Point of View
  M. Bern, D. Dobkin, D. Eppstein, and R. Grossman
  1st ACM-SIAM Symposium on Discrete Algorithms, 1990, 107-118.
  Algorithmica 11 (1994) 360-378.

Probabilistic Geometry

• The Expected Extremes in a Delaunay Triangulation
  M. Bern, D. Eppstein, and F. Yao
  18th Int. Coll. Automata, Languages, and Programming, Madrid, Spain, 1991
  Springer-Verlag LNCS 510 (1991) 674-685.
  Int. J. Comp. Geom. & Appl. 1 (1991) 79-92.

• Two Probabilistic Results on Rectilinear Steiner Trees
  M. Bern
  18th ACM Symp. Theory of Computing, 1986, 433-441.
  Algorithmica 3 (1988) 191-204.

Robust Statistics and Geometry

• Multivariate Regression Depth
  M. Bern and D. Eppstein
  Manuscript, 1999.

• Regression Depth and Center Points
  N. Amenta, M. Bern, D. Eppstein, and S.-H. Teng
  Manuscript, 1998.

Discrete and Combinatorial Geometry

• Pushing Disks Together-The Continuous Motion Case
  M. Bern and A. Sahai
  28th ACM Symposium on Theory of Computing, 1996.

• The Centroid of Points with Approximate Weights
  M. Bern, D. Eppstein, L. Guibas, J. Hershberger, S. Suri, and J. Wolter
  3rd European Symposium on Algorithms, Corfu, 1995.
  Springer-Verlag LNCS 979 (1995) 460-472.

• On the Number of Minimal 1-Steiner Trees
  B. Aronov, M. Bern, and D. Eppstein
  Disc. & Comp. Geometry 12 (1994), 29-34.

• Horizon Theorems for Lines and Polygons
  M. Bern, D. Eppstein, Paul Plassmann, and F. Yao
  Discrete and Computational Geometry: Papers from the DIMACS Special Year, J. Goodman, R. Pollack, and W. Steiger, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science 6, Amer. Math. Soc. (1992) 45-66.

Miscellaneous Geometry

• Ununfoldable Polyhedra
  M. Bern, E. Demaine, D. Eppstein, and E. Kuo
  11th Canadian Conf. on Comp. Geometry 1999, 37-48.

• A Disk-Packing Algorithm for an Origami Magic Trick
  M. Bern, E. Demaine, D. Eppstein, and B. Hayes
  Fun with Algorithms 1998.

• The Complexity of Flat Origami
  M. Bern and B. Hayes
  7th ACM-SIAM Symp. on Disc. Algorithms 1996, 175-183.

• Worst-Case Bounds for Subadditive Geometric Graphs
  M. Bern and D. Eppstein
  9th ACM Symp. Comp. Geometry, 1993, 183-188.

• Approximate Closest-Point Queries in High Dimensions
  M. Bern
  Inform. Proc. Letters 45 (1993) 95-99.

• Drawing the Planar Dual
  M. Bern and J. Gilbert
  Inform. Proc. Letters 43 (1992) 7-13.

• Fast Geometric Approximation Techniques and Geometric Embedding Problems
  M. Bern, H. Karloff, P. Raghavan, and B. Schieber
  5th ACM Symp. on Comp. Geometry 1989, 292-301.
  Theoretical Computer Science 106 (1990) 265-281.

On-Line Algorithms

• On-Line Algorithms for Cache Sharing
  M. Bern, D. Greene, and A. Raghunathan
  25th ACM Symp. Theory of Computing, 1993, 422-429.

• On-Line Algorithms for Locating Checkpoints
  M. Bern, D. Greene, A. Raghunathan, and M. Sudan
  22nd ACM Symp. Theory of Computing 1990, 359-368.
  Algorithmica 11 (1994) 33-52.

Graph Algorithms

• Polynomially Solvable Special Cases of the Steiner Problem in Planar Networks
  M. Bern and D. Bienstock
  Annals of Operations Research 33 (1991) 405-418.

• Faster Exact Algorithms for Steiner Trees in Planar Networks
  M. Bern
  Networks 20, 1990, 109-120.

• The Steiner Problem with Edge Lengths 1 and 2
  M. Bern and Paul Plassmann,
  Inform. Proc. Letters 32, 1989, 171-176.

• Why Certain Subgraph Computations Require Only Linear Time
  M. Bern, E. Lawler, and A.L. Wong
  26th Annual IEEE Foundations of Computer Science, 1985, 117-126.
  Journal: Linear-time Computation of Optimal Subgraphs of Decomposable Graphs
  J. Algorithms 8 (1987) 216-235.

Combinatorics

• Bounds on the Convex Label Number of Trees
  M. Bern, M. Klawe, and A.L. Wong
  Combinatorica 7 (1987) 221-230.

Survey and Popular Articles

• Mesh Generation
  M. Bern and Paul Plassmann
  Chapter 6 in Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, eds., Elsevier Science, 1999.

• Approximation Algorithms for Geometric Problems
  M. Bern and D. Eppstein
  In Approximation Algorithms for NP-hard Problems, D. Hochbaum, ed., PWS Publications, 1996.

• Mesh Generation and Optimal Triangulation
  M. Bern and D. Eppstein
  In Computing in Euclidean Geometry, D.-Z. Du and F.K. Hwang, eds., World Scientific, 1992, 2nd edition, 1995.

• The Shortest-Network Problem
  M. Bern and R.L. Graham
  Scientific American, January, 1989.