Article

Free access

A Delaunay based numerical method for three dimensions: generation, formulation, and partition

Authors:

Gary L. Miller,

Dafna Talmor,

Shang-Hua Teng,

Noel WalkingtonAuthors Info & Claims

STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Pages 683 - 692

https://doi.org/10.1145/225058.225286

Published: 29 May 1995 Publication History

PDF eReader

References

[1]

N.M. Amato, M,T, Goodrich, and E.A. Ramo:s. Parallel algo-rithms for higher-dimensional convex hull. {n 35th Annual Symposium on Foundations of Computer Scimce, 683-694, 1994. IEEE.

Google Scholar

[2]

I. Babu3ka and A.K. Aziz. On the angle condition in the finite element method. SIAM J. Nume~ Anal., 13{2):214- 226, 1976.

Google Scholar

[3]

M. Bern, D. Eppstein, and J. R, Gilbert. Provably good mesh generation. InFOCS90,231-241, 1990. IEEE.

Google Scholar

[4]

M. Bern and D. Eppstein. Mesh Generation and optimal Triangulation. Xerox Corporation, Palo Alto, CA, 1992.

Crossref

Google Scholar

[5]

M, Bern, D. Eppstein, and S.-H. Teng. Parallel construc-tion of quad trees and quality triangulations. In Algorithms and Data Structures, Third Workshop, WADS, 188-1 99. Spnnger-Verlag, 1993. Lecture Notes in Computer Science, vol. 709.

Digital Library

Google Scholar

[6]

M. Bern, D. Eppstein, and F. F. Yao. The expected extremes in a delaunay triangulation. Inter J. of Computational Ge-ometry and Appl., 1(1):79-91, 1991.

Crossref

Google Scholar

[7]

K.Q. Brown. Voronoi diagrams from convex hull. Inform. Process. Lett., 9:223-228, 1979.

Crossref

Google Scholar

[8]

K.Q. Brown. Geometric transforms for fast geometric al-gorithms. Technical Report CMU-CS-80-I 01, CMU, 1980. PhD Thesis.

Digital Library

Google Scholar

[9]

B. Chazelle. An optimal convex hull algorithm and new re-sults on cutting. In 32th Annual Symposium on Foundations of Computer Science, 29-38. IEEE, 1991.

Digital Library

Google Scholar

[10]

L.P. Chew. Guaranteed-quality triangular meshes. Technical Report TR 89-983, CS. Cornell, 1989.

Crossref

Google Scholar

[11]

P. G, Ciarlet. The Finite Element Method for Elliptic Prob-lems, North-Holland, 1978.

Digital Library

Google Scholar

[12]

P. G. Ciarlet and P. A. Raviart. Maximum principle and uni-form convergence for the finite element method. Computer Methods in Applied Mechanics and Engineering, 2: 17-3 1, 1973.

Crossref

Google Scholar

[13]

K.L. Clarkson and P.W. Shor. Applications of random sam-pling in computational geometry, II. Discrete and Compu-tational Geometry, 4:387-421, 1989.

Digital Library

Google Scholar

[14]

T. K. Dey, C. L. Bajaj, and K. Sugihara. On good trian-gulations in three dimensions. In Proceedings of the ACM symposium on solid modeling and CAD/CAM Applications 1991,431-441. ACM, 1991.

Digital Library

Google Scholar

[15]

H. Edelsbrunner and R. Seidel. Voronoi diagrams and ar-rangements. Discrete and Computational Geometry, 1:25- 44, 1986.

Digital Library

Google Scholar

[16]

H. Edelsbrunner. Algorithms in Combinatorial Geome-try, volume 10 of EATCS Monographs on Theoretical CS. Springer-Verlag, 1987.

Digital Library

Google Scholar

[17]

S. Fortune. Voronoi diagrams and delaunay triangulations. In Ding-Zhu Du and Frank Hwang, editors, Computing in Euclidean Geometry, volume 1 of Lecture Notes Series on Computing, 193-233. World Scientific Publ. Co., River Edge NJ, 1992.

Google Scholar

[18]

A. M. Frieze, G. L. Miller, and S.-H. Teng. Applications of geometric separator theorem in computational geome-try. In 1992 ACM Symposium on Parallel Algorithms and Architectunar, pages 420-430,1992. ACM.

Digital Library

Google Scholar

[19]

L. J. Guibas, D. E. Knuth, and M. Shark. Randomized in-cremental construction of Delaunay and Voronoi diagrams. Algorithmic, 7:381-413,1992.

Crossref

Google Scholar

[20]

K. M. Karp and J. M. Steele. Probabilistic analysis of hueris -tics. In Lawler, Lenstra, Rinnooy Kan, and Shmoys, editors, The Traveling SAlesman Problem: A Guided Tour of Com-binatorial Optimization. Wiley, N. Y., 1985.

Google Scholar

[21]

V. Klee. On the complexity of d-dimensional Voronoi dia-grams. Archiv der Mathematik, 34:75-80, 1980.

Crossref

Google Scholar

[22]

R. H. MacNeal. An asymmetrical finite difference network. Quarterly ofApplied Math, 11:295-310,1953.

Crossref

Google Scholar

[23]

R. E. Miles. On the homogeneous planar poisson point process. Mathematical Biosciences, 6:85-127, 1970.

Crossref

Google Scholar

[24]

G. L Miller and D. Talmor. Mesh generation using well spaced points. Manuscript, 1995.

Google Scholar

[25]

G. L Miller and D. Talmor and S.-H. Teng. More than uni-form distribution: generating more interesting experimental data for computational geometry Manuscript, 1995.

Google Scholar

[26]

G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis. Automatic mesh partitioning. In A. George, J. Gilbert, and J. Liu, editors, Graphs Theory and Sparse Matrix Computa-tion, The IMA Volumes in Mathematics and its Application, 57-84. Springer-Verlag, 1993. Vol 56.

Google Scholar

[27]

G. L. Miller, S-H. Teng, W. Thurston, and S. A. Vavasis. Geometric separators for finite element meshes. SIAM J. Scienttjic Computing to appear, 1995.

Digital Library

Google Scholar

[28]

G. L. Miller and S. A. Vavasis. Density graphs and separa-tors, In Second Annual ACA4-SIAM Symposium on Discrete Algorithms, 33 1-336, 1991. ACM-SIAM.

Digital Library

Google Scholar

[29]

S. A. Mitchell and S. A. Vavasis. Quality mesh generation in three dimensions. In Proceedings of the ACM Computa-tional Geometry Conference, 2 12-221, 1992.

Digital Library

Google Scholar

[30]

R. A. Nicolaides. Direct discretization of planar div-curl problems. SIAM J. Numez Anal., 29(1):32-56, 1992.

Digital Library

Google Scholar

[31]

F. P. Preparata. Steps into computational geometry. Tech-nical report, Coordinated Science Laboratory, University of Illinois, 1977.

Google Scholar

[32]

F, P. Preparata and M. 1. Shames, Computational Geom-etry An Introduction. Texts and Monographs in Computer Science. Springer-Verlag, 1985.

Digital Library

Google Scholar

[33]

J. Ruppert. A new and simple algorithm for quality 2- dimensional mesh generation. In Third Annual ACM-SIAM Symposium on Discrete Algorithms, 83-92, 1992.

Digital Library

Google Scholar

[34]

R. Seidel. Constructing higher-dimensional convex hulls at logarithmic cost per face. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pages 404-413. ACM, 1986.

Digital Library

Google Scholar

[35]

P. Su. Efficient parallel algorithms for closest point prob-lems. Technical Report PCS-TR94-238, Dartmouth College, NH, 1994. PhD Thesis.

Digital Library

Google Scholar

[36]

S.-H. Teng and F. F. Yao. k-nearest-neighbor clustering and percolation theory. In Workshop on Algorithms and Computation, page Hong-Kong, 1993.

Google Scholar

[37]

Y. A. Teng, F. Sullivan, 1. Beichl, and E. Puppo. A data-parallel algorithm for three-dimensional delaunay triangu-lation and its implementation. In SuperComputing 93, 112- 121. ACM, 1993.

Digital Library

Google Scholar

Cited By

View all

Li NSong XXiao KLi SLi CWang K(2018)Part II: A demonstration of integrating multiple-scale 3D modelling into GIS-based prospectivity analysis: A case study of the Huayuan-Malichang district, ChinaOre Geology Reviews10.1016/j.oregeorev.2018.02.03495(292-305)Online publication date: Apr-2018
https://doi.org/10.1016/j.oregeorev.2018.02.034
Teng S(2016)Scalable Algorithms for Data and Network AnalysisFoundations and Trends® in Theoretical Computer Science10.1561/040000005112:1-2(1-274)Online publication date: 1-May-2016
https://dl.acm.org/doi/10.1561/0400000051
Cheng SDey TShewchuk J(2016)Meshing piecewise smooth complexesDelaunay Mesh Generation10.1201/b12987-17(349-384)Online publication date: 19-Apr-2016
https://doi.org/10.1201/b12987-17
Show More Cited By

Index Terms

A Delaunay based numerical method for three dimensions: generation, formulation, and partition

Recommendations

TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator

TetGen is a C++ program for generating good quality tetrahedral meshes aimed to support numerical methods and scientific computing. The problem of quality tetrahedral mesh generation is challenged by many theoretical and practical issues. TetGen uses ...
Sliver-free three dimensional delaunay mesh generation
Sliver-Free Three Dimensional Delaunay Mesh Generation

Comments

Information & Contributors

Information

Published In

STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

May 1995

776 pages

ISBN:0897917189

DOI:10.1145/225058

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: 29 May 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC95

Sponsor:

SIGACT

STOC95: Symposium on Theory of Computing

May 29 - June 1, 1995

Nevada, Las Vegas, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

63
Total Citations
View Citations
917
Total Downloads

Downloads (Last 12 months)89
Downloads (Last 6 weeks)15

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li NSong XXiao KLi SLi CWang K(2018)Part II: A demonstration of integrating multiple-scale 3D modelling into GIS-based prospectivity analysis: A case study of the Huayuan-Malichang district, ChinaOre Geology Reviews10.1016/j.oregeorev.2018.02.03495(292-305)Online publication date: Apr-2018
https://doi.org/10.1016/j.oregeorev.2018.02.034
Teng S(2016)Scalable Algorithms for Data and Network AnalysisFoundations and Trends® in Theoretical Computer Science10.1561/040000005112:1-2(1-274)Online publication date: 1-May-2016
https://dl.acm.org/doi/10.1561/0400000051
Cheng SDey TShewchuk J(2016)Meshing piecewise smooth complexesDelaunay Mesh Generation10.1201/b12987-17(349-384)Online publication date: 19-Apr-2016
https://doi.org/10.1201/b12987-17
van de Ven WHu YBarentsz JKarssemeijer NBarratt DHuisman H(2016)Biomechanical modeling constrained surface‐based image registration for prostate MR guided TRUS biopsyMedical Physics10.1118/1.491748142:5(2470-2481)Online publication date: 30-Nov-2016
https://doi.org/10.1118/1.4917481
Li NBagas LLindsay MWedge DBai LSong X(2016)An irregular triangle mesh buffer analysis method for boundary representation geological object in three-dimensionEarth Science Informatics10.1007/s12145-016-0283-110:2(149-167)Online publication date: 14-Dec-2016
https://doi.org/10.1007/s12145-016-0283-1
Foteinos PChrisochoides N(2015)4D space---time Delaunay meshing for medical imagesEngineering with Computers10.1007/s00366-014-0380-z31:3(499-511)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.1007/s00366-014-0380-z
Sebastian JSivadasan NBanerjee R(2014)GPU accelerated three dimensional unstructured geometric multigrid solver2014 International Conference on High Performance Computing & Simulation (HPCS)10.1109/HPCSim.2014.6903663(9-16)Online publication date: Jul-2014
https://doi.org/10.1109/HPCSim.2014.6903663
Foteinos PChrisochoides N(2014)High quality real-time Image-to-Mesh conversion for finite element simulationsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2013.11.00274:2(2123-2140)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1016/j.jpdc.2013.11.002
Li LKuai X(2014)An efficient dichotomizing interpolation algorithm for the refinement of TIN-based terrain surface from contour mapsComputers & Geosciences10.1016/j.cageo.2014.07.00172:C(105-121)Online publication date: 1-Nov-2014
https://dl.acm.org/doi/10.1016/j.cageo.2014.07.001
Javani HPeerlings RGeers M(2014)Consistent remeshing and transfer for a three dimensional enriched mixed formulation of plasticity and non-local damageComputational Mechanics10.1007/s00466-013-0922-z53:4(625-639)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.1007/s00466-013-0922-z
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

TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator

Sliver-free three dimensional delaunay mesh generation

Sliver-Free Three Dimensional Delaunay Mesh Generation

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

TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator

Sliver-free three dimensional delaunay mesh generation

Sliver-Free Three Dimensional Delaunay Mesh Generation

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