• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Mesh Generation And Optimal Triangulation (1992)

Cached

  • Download as a PDF

Download Links

  • [www.ics.uci.edu]
  • [www.ics.uci.edu]
  • [www.cs.berkeley.edu]
  • [www.eecs.berkeley.edu]
  • [www.ann.jussieu.fr]
  • [www.cs.berkeley.edu]
  • [www.eecs.berkeley.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Marshall Bern , David Eppstein
Citations:213 - 7 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Bern92meshgeneration,
    author = {Marshall Bern and David Eppstein},
    title = {Mesh Generation And Optimal Triangulation},
    year = {1992}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We survey the computational geometry relevant to finite 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 discuss algorithms both for the optimization of triangulations on a fixed set of vertices and for the placement of new vertices (Steiner points). We briefly survey the heuristic algorithms used in some practical mesh generators.

Keyphrases

optimal triangulation    mesh generation    geometric domain    fixed set    computational geometry relevant    new vertex    heuristic algorithm    steiner point    element mesh generation    practical mesh generator   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University