Nice Point Sets Can Have Nasty Delaunay Triangulations
Article Properties
-
DOI (url)
-
Publication Date2003/05/21
-
Indian UGC (journal)
-
Citations14
-
Jeff Erickson
Cite
Erickson, Jeff. “Nice Point Sets Can Have Nasty Delaunay Triangulations”. Discrete &Amp; Computational Geometry, vol. 30, no. 1, 2003, pp. 109-32, https://doi.org/10.1007/s00454-003-2927-4.
Erickson, J. (2003). Nice Point Sets Can Have Nasty Delaunay Triangulations. Discrete &Amp; Computational Geometry, 30(1), 109-132. https://doi.org/10.1007/s00454-003-2927-4
Erickson, Jeff. “Nice Point Sets Can Have Nasty Delaunay Triangulations”. Discrete &Amp; Computational Geometry 30, no. 1 (2003): 109-32. https://doi.org/10.1007/s00454-003-2927-4.
1.
Erickson J. Nice Point Sets Can Have Nasty Delaunay Triangulations. Discrete & Computational Geometry. 2003;30(1):109-32.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Technology
Engineering (General)
Civil engineering (General)
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets | Discrete & Computational Geometry |
| 2020 | |
A Fast and Simple Surface Reconstruction Algorithm | ACM Transactions on Algorithms |
| 2 | 2017 |
Neighborly inscribed polytopes and delaunay triangulations | Advances in Geometry |
| 5 | 2016 |
A Hierarchical Approach for Regular Centroidal Voronoi Tessellations | Computer Graphics Forum |
| 7 | 2015 |
| A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations | Discrete & Computational Geometry |
| 2 | 2014 |
Citations Analysis
The category
Science: Mathematics 9
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Provably good sampling and meshing of surfaces and was published in 2005. The most recent citation comes from a 2020 study titled Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets. This article reached its peak citation in 2014, with 2 citations. It has been cited in 9 different journals, 11% of which are open access. Among related journals, the Discrete & Computational Geometry cited this research the most, with 4 citations. The chart below illustrates the annual citation trends for this article.