Guibas, L. and Stolfi J., Primitives form the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graphics 4 (1985) 74- 123.

Digital Library

Google Scholar

[9]

Lawson, C.L. Generation of a triangular grid with applications to contour plotting. Memo 299, Calif. Inst. Jet Propul. Lab. (1972).

Google Scholar

[10]

Preparata, F.P and Shamos, M.I, Computational Geometry- an Introduction. Springer Verlag, New York, (1985).

Digital Library

Google Scholar

[11]

Shamos, M.I., and Hoey, D. Closest-point problems. In Proc.16th Ann. IEEE Sympos. Found. Comput. Sci. (1975), 151-162. New Haven, Conn., (1978)

Google Scholar

[12]

Shamos, M.I. Computational Geometry. Ph.D. Thesis, Dept. Comput. Sci., Yale Univ., New Haven, Conn., (197$)

Digital Library

Google Scholar

[13]

Srinivasan V., Nackm~n L.R., Tang, J. and Meshkat $.N., Automatic Mesh Generation using the Symmetric Axis Transformation of Polygonal Domains, IBM RC 16132, (1990).

Google Scholar

Cited By

View all

Elshakhs YDeliparaschos KCharalambous TOliva GZolotas A(2024)A Comprehensive Survey on Delaunay Triangulation: Applications, Algorithms, and Implementations Over CPUs, GPUs, and FPGAsIEEE Access10.1109/ACCESS.2024.335470912(12562-12585)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3354709
Samanipour PPoonawala H(2023)Automated Stability Analysis of Piecewise Affine Dynamics Using Vertices2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton)10.1109/Allerton58177.2023.10313502(1-8)Online publication date: 26-Sep-2023
https://doi.org/10.1109/Allerton58177.2023.10313502
Hutcheon MTeale A(2022)Topological Analysis of Functions on Arbitrary Grids: Applications to Quantum ChemistryJournal of Chemical Theory and Computation10.1021/acs.jctc.2c0064918:10(6077-6091)Online publication date: 7-Sep-2022
https://doi.org/10.1021/acs.jctc.2c00649
Show More Cited By

Index Terms

Optimality of the Delaunay triangulation in R^d
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

A spectral characterization of the Delaunay triangulation

The Delaunay triangulation of a planar point set is a fundamental construct in computational geometry. A simple algorithm to generate it is based on flips of diagonal edges in convex quads. We characterize the effect of a single edge flip in a ...
Optimality of the Delaunay triangulation in źd

In this paper we present new optimality results for the Delaunay triangulation of a set of points in d. These new results are true in all dimensionsd. In particular, we define a power function for a triangulation and show that the Delaunay triangulation ...
Quality tetrahedral mesh smoothing via boundary-optimized Delaunay triangulation

Despite its great success in improving the quality of a tetrahedral mesh, the original optimal Delaunay triangulation (ODT) is designed to move only inner vertices and thus cannot handle input meshes containing ''bad'' triangles on boundaries. In the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SCG '91: Proceedings of the seventh annual symposium on Computational geometry

June 1991

373 pages

ISBN:0897914260

DOI:10.1145/109648

Chairman:
R. L. Scot Drysdale

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 June 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SOCG91

Sponsor:

SOCG91: 7th Annual Symposium on Computational Geometry 1991

June 10 - 12, 1991

New Hampshire, North Conway, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

40
Total Citations
View Citations
952
Total Downloads

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

Reflects downloads up to 16 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Elshakhs YDeliparaschos KCharalambous TOliva GZolotas A(2024)A Comprehensive Survey on Delaunay Triangulation: Applications, Algorithms, and Implementations Over CPUs, GPUs, and FPGAsIEEE Access10.1109/ACCESS.2024.335470912(12562-12585)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3354709
Samanipour PPoonawala H(2023)Automated Stability Analysis of Piecewise Affine Dynamics Using Vertices2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton)10.1109/Allerton58177.2023.10313502(1-8)Online publication date: 26-Sep-2023
https://doi.org/10.1109/Allerton58177.2023.10313502
Hutcheon MTeale A(2022)Topological Analysis of Functions on Arbitrary Grids: Applications to Quantum ChemistryJournal of Chemical Theory and Computation10.1021/acs.jctc.2c0064918:10(6077-6091)Online publication date: 7-Sep-2022
https://doi.org/10.1021/acs.jctc.2c00649
Jourdain BPagès G(2022)Convex Order, Quantization and Monotone Approximations of ARCH ModelsJournal of Theoretical Probability10.1007/s10959-021-01141-135:4(2480-2517)Online publication date: 18-Jan-2022
https://doi.org/10.1007/s10959-021-01141-1
Pagès GWilbertz B(2018)Sharp Rate for the Dual Quantization ProblemSéminaire de Probabilités XLIX10.1007/978-3-319-92420-5_11(405-454)Online publication date: 8-Aug-2018
https://doi.org/10.1007/978-3-319-92420-5_11
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
Gao MCao TTan THuang ZMeenakshisundaram GYoon SOlano MOtaduy M(2013)Flip-flopProceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games10.1145/2448196.2448203(45-54)Online publication date: 21-Mar-2013
https://dl.acm.org/doi/10.1145/2448196.2448203
Knupp P(2012)Measurement and Impact of Mesh Quality (Invited)46th AIAA Aerospace Sciences Meeting and Exhibit10.2514/6.2008-933Online publication date: 19-Jun-2012
https://doi.org/10.2514/6.2008-933
Shewchuk J(2012)Unstructured Mesh GenerationCombinatorial Scientific Computing10.1201/b11644-11(257-297)Online publication date: 29-Mar-2012
https://doi.org/10.1201/b11644-11
Gonzaga de Oliveira S(2012)A review on delaunay refinement techniquesProceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I10.1007/978-3-642-31125-3_14(172-187)Online publication date: 18-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-31125-3_14
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

A spectral characterization of the Delaunay triangulation

Optimality of the Delaunay triangulation in źd

Quality tetrahedral mesh smoothing via boundary-optimized Delaunay triangulation