Article

Free access

Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes

Authors:

Elefterios A. Melissaratos,

Diane L. SouvaineAuthors Info & Claims

SCG '92: Proceedings of the eighth annual symposium on Computational geometry

Pages 202 - 211

https://doi.org/10.1145/142675.142719

Published: 01 July 1992 Publication History

PDF eReader

References

[1]

B.S. Baker, E. Crosse, and C. Rafferty, "Nonobtuse Triangulation of Polygons." Discr~'te and Computational Geometry, 3, 1988, 147- 168.

Digital Library

Google Scholar

[2]

R. E. Bank. PLTMG User's Guide. SIAlvl, 1990.

Google Scholar

[3]

M. Bern, D. Eppstein, and J. Gilbert, "Preyably Good Mesh Generation," FOC$, 1990, 231-241.

Google Scholar

[4]

M. Bern and D. Eppstein, "Non-obtuse tria.ngulation of polygons with polynomial number of triangles," Proc. of A CM Syrup. on Comp. Geometry, 1991, 342-350.

Digital Library

Google Scholar

[5]

M. Bern and D. Eppstein, "Mesh generation and optimal triangulation," Euclidean Geometry and the Computer, F.K. Hwang, D.Z. Du, eds., World Scientific, 1992, to appeal'.

Google Scholar

[6]

B. Chazelle, H. Edelsbruner, L.J. Guib;xs, J.E. Hershberger, R. Seidel, and M. Sharir. "Selecting multiply covered points and reducing the size of Delaunay triangulations.", Proc. of A CM Syrup. on Comp. Geom., 19!}0, 116-127.

Digital Library

Google Scholar

[7]

P.L. Chew, "Constrained Delaunay triangulations'', Proc. of A CM Syrup. on Co,op. Geom., 1987, 215-222.

Digital Library

Google Scholar

[8]

P.L. Chew, "Guaranteed-quality triangular meshes." Cornell Univ. Tech. Rpt. TR-89- 983, 1989.

Google Scholar

[9]

H. Edelsbruner, T.S. Tan, R. Waupotitsch, "A polynomial time algorithm for minmax angle triangulation," Proc. of A CM Syrup. on Comp. Geom., 1990, 44-52.

Digital Library

Google Scholar

[10]

W. Frey and D. Field "Mesh Relaxation: A New Technique for improving triangulations,'' General Motors Research Publication GMR-6815.

Google Scholar

[11]

I. Fried "Condition of finite element ma.trices generated from nonuniform meshes", AIAA J., 1972, 10:219-221.

Crossref

Google Scholar

[12]

B. Joe, "Finite E{ement Triangulation of Complex regions Using Computationa~l Geometry,'' Ph.D Thesis, U. Waterloo, 19184.

Digital Library

Google Scholar

[13]

S.E. Laux and B.M. Grossman. "A general control volume formulation for modeling impact ionization in semiconductor transport," IEEE Trans. Electron Devices 32~ 1985, 2076- 2081.

Google Scholar

[14]

D.T. Lee, "Generalized Delaunay trialagulations for planar graphs," Discrete and Comp. Geom., 1, 1986, 201-217.

Digital Library

Google Scholar

[15]

E.A. Melissaratos and D.L. Souvaine, "Coping with Inconsistencies: A New Approach to Produce Quality Triangulations of Polygonal Domains with Holes." Rutgers Univ. Tech Rpt. LCSR-TR-163, 1991.

Google Scholar

[16]

H. Samet "The quadtree and related hierarchical data structures", A CM Computing Surveys, 16, 1984, 188-260.

Digital Library

Google Scholar

[17]

H. Samet. Design and Analysis of Spatial Data Structures, 1990.

Digital Library

Google Scholar

[18]

G. Strang and G.J. Fix. "An Analysis of the Finite Element Method," Prentice~Hall, 1973.

Google Scholar

[19]

M.S. Shephard. "Approaches to the automatic generation and control of finite element meshes." Appl. Mech. Rev., 41, 1988, 169- 185.

Crossref

Google Scholar

[20]

W. C. Thacker. "A brief review of techniques for generating irregular computational grids." Int. J. Num. Methods in Eng., 15, 1980, 1335-1341.

Crossref

Google Scholar

[21]

M.A. Yerry and M.S. Shephard. "A modified quadtree approach to the finite element mesh generation." IEEE Comp. Graphics and Appl., 3, 1983, 39-46.

Digital Library

Google Scholar

Cited By

View all

Bishop C(2023)Uniformly Acute Triangulations of PolygonsDiscrete & Computational Geometry10.1007/s00454-023-00525-w70:4(1571-1592)Online publication date: 21-Jul-2023
https://doi.org/10.1007/s00454-023-00525-w
Bishop C(2016)Nonobtuse Triangulations of PSLGsDiscrete & Computational Geometry10.1007/s00454-016-9772-856:1(43-92)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.1007/s00454-016-9772-8
Zamfirescu C(2013)Survey of two-dimensional acute triangulationsDiscrete Mathematics10.1016/j.disc.2012.09.016313:1(35-49)Online publication date: Jan-2013
https://doi.org/10.1016/j.disc.2012.09.016
Show More Cited By

Index Terms

Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Trees
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Handling Revision Inconsistencies: Creating Useful Explanations
HICSS '15: Proceedings of the 2015 48th Hawaii International Conference on System Sciences

With ever growing knowledge bases the presence of inconsistencies has become a major challenge. In the past mainly the problems of finding and removing inconsistencies from knowledge bases have been addressed. However, knowledge is not static and needs ...
Empty pseudo-triangles in point sets

We study empty pseudo-triangles in a set P of n points in the plane, where an empty pseudo-triangle has its vertices at the points of P, and no points of P lie inside. We give bounds on the minimum and maximum number of empty pseudo-triangles. If P lies ...
Managing inconsistencies in an evolving specification
RE '95: Proceedings of the Second IEEE International Symposium on Requirements Engineering

In an evolving specification, considerable effort is spent handling recurrent inconsistencies. Detecting and resolving inconsistencies is only part of the problem: a resolved inconsistency might not stay resolved. Frameworks in which inconsistency is ...

Comments

Information & Contributors

Information

Published In

SCG '92: Proceedings of the eighth annual symposium on Computational geometry

July 1992

384 pages

ISBN:0897915178

DOI:10.1145/142675

Chairman:
David Avis

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SOCG92

Sponsor:

SOCG92: 8th Annual Symposium on Computational Geometry 1992

June 10 - 12, 1992

Berlin, Germany

Acceptance Rates

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
353
Total Downloads

Downloads (Last 12 months)27
Downloads (Last 6 weeks)9

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bishop C(2023)Uniformly Acute Triangulations of PolygonsDiscrete & Computational Geometry10.1007/s00454-023-00525-w70:4(1571-1592)Online publication date: 21-Jul-2023
https://doi.org/10.1007/s00454-023-00525-w
Bishop C(2016)Nonobtuse Triangulations of PSLGsDiscrete & Computational Geometry10.1007/s00454-016-9772-856:1(43-92)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.1007/s00454-016-9772-8
Zamfirescu C(2013)Survey of two-dimensional acute triangulationsDiscrete Mathematics10.1016/j.disc.2012.09.016313:1(35-49)Online publication date: Jan-2013
https://doi.org/10.1016/j.disc.2012.09.016
Bedregal CRivara M(2013)A Study on Size-Optimal Longest Edge Refinement AlgorithmsProceedings of the 21st International Meshing Roundtable10.1007/978-3-642-33573-0_8(121-136)Online publication date: 2013
https://doi.org/10.1007/978-3-642-33573-0_8
Xu YDai WKatoh NOhsaki M(2007)Triangulating a convex polygon with fewer number of non-standard barsTheoretical Computer Science10.1016/j.tcs.2007.08.011389:1-2(143-151)Online publication date: 10-Dec-2007
https://dl.acm.org/doi/10.1016/j.tcs.2007.08.011
Xu YDai WKatoh NOhsaki M(2005)Triangulating a Convex Polygon with Small Number of Non-standard BarsProceedings of the 11th Annual International Conference on Computing and Combinatorics - Volume 359510.5555/2958119.2958130(481-489)Online publication date: 16-Aug-2005
https://dl.acm.org/doi/10.5555/2958119.2958130
Xu YDai WKatoh NOhsaki M(2005)Triangulating a Convex Polygon with Small Number of Non-standard BarsComputing and Combinatorics10.1007/11533719_49(481-489)Online publication date: 2005
https://doi.org/10.1007/11533719_49
Aurenhammer FKatoh NKojima HOhsaki MXu Y(2002)Approximating uniform triangular meshes in polygonsTheoretical Computer Science10.1016/S0304-3975(01)00407-8289:2(879-895)Online publication date: 30-Oct-2002
https://dl.acm.org/doi/10.1016/S0304-3975%2801%2900407-8
Mackerle J(2001)2D and 3D finite element meshing and remeshingEngineering Computations10.1108/EUM000000000649518:8(1108-1197)Online publication date: 1-Dec-2001
https://doi.org/10.1108/EUM0000000006495
Rivara MHitschfeld NSimpson B(2001)Terminal-edges Delaunay (small-angle based) algorithm for the quality triangulation problemComputer-Aided Design10.1016/S0010-4485(00)00125-133:3(263-277)Online publication date: Mar-2001
https://doi.org/10.1016/S0010-4485(00)00125-1
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Handling Revision Inconsistencies: Creating Useful Explanations

Empty pseudo-triangles in point sets

Managing inconsistencies in an evolving specification

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Handling Revision Inconsistencies: Creating Useful Explanations

Empty pseudo-triangles in point sets

Managing inconsistencies in an evolving specification

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations