Marshall Bern, Scott A. Mitchell, Jim Ruppert  Home/Search
Context Related
| sandia.gov/~samitch...lsnonobtuse.ps.Z Cached: 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.
PS.gz PS Image Update HelpFrom: sandia.gov/~samitch/css...csguide (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We give an algorithm for triangulating n-vertex polygonal regions (with holes) so that no angle in the final triangulation measures more than =2. The number of triangles in the triangulation is only O(n), improving a previous bound of O(n 2 ), and the worst-case running time is O(n log 2 n). The basic technique used in the algorithm, recursive subdivision by disks, is new and may have wider application in mesh generation. We also report on an implementation of our algorithm. 1.... (Update)
Similar documents based on text: More All
0.4: Optimal Size Finite Element Meshes without Obtuse and Small.. - Melissaratos (1992) (Correct)
0.2: Linear-size Nonobtuse Triangulation of Polygons - Bern, Mitchell, Ruppert (1994) (Correct)
0.2: Quadrilateral Meshing by Circle Packing - Bern, Eppstein (1997) (Correct)
BibTeX entry: (Update)
M. Bern, S. Mitchell, and J. Ruppert, "Linear-size nonobtuse triangulation of polygons", in Proc. 10th Annual ACM Symp. on Computational Geometry, Stony Brook, New York, 1994, pp. 221--230. http://citeseer.ist.psu.edu/bern94linearsize.html More
@inproceedings{ bern94linearsize,
author = "Marshall W. Bern and Scott A. Mitchell and Jim Ruppert",
title = "Linear-Size Nonobtuse Triangulation of Polygons",
booktitle = "Symposium on Computational Geometry",
pages = "221-230",
year = "1994",
url = "citeseer.ist.psu.edu/bern94linearsize.html" }
Citations (may not include all citations):1254 Computational Geometry -- an Introduction (context) - Preparata, Shamos - 1985
227 An Analysis of the Finite Element Method (context) - Strang, Fix - 1973
159 A sweepline algorithm for Voronoi diagrams (context) - Fortune - 1987
109 Provably good mesh generation - Bern, Eppstein et al. - 1990
88 the angle condition in the finite element method (context) - Babuska, Aziz - 1976
82 Introduction to Geometry (context) - Coxeter - 1961
81 A linear time algorithm for computing the Voronoi diagram of.. (context) - Aggarwal, Guibas et al. - 1989
38 A new and simple algorithm for quality 2-dimensional mesh ge.. (context) - Ruppert - 1993
27 Polynomial-size nonobtuse triangulation of polygons - Bern, Eppstein - 1992
27 An upper bound for conforming Delaunay triangulations - Edelsbrunner, Tan - 1993
22 Nonobtuse triangulation of polygons (context) - Baker, Grosse et al. - 1988
22 Stable finite elements for problems with wild coefficients (context) - Vavasis - 1993
20 Triangulating polygons without large angles - Bern, Dobkin et al. - 1992
18 and Separators: a unified geometric approach to graph partit.. (context) - Teng, Spheres - 1991
16 Dihedral Bounds for Mesh Generation in High Dimensions - Bern, Chew et al. - 1993
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://endo.sandia.gov/~samitch/csstuff/csguide.html): More
Cardinality Bounds for Triangulations with Bounded Minimum Angle - Mitchell (1994) (Correct)
Edge Insertion for Optimal Triangulations - Bern, Edelsbrunner, Eppstein.. (1993) (Correct)
Quality Mesh Generation in Three Dimensions - Mitchell, Vavasis (1992) (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