Dense Point Sets Have Sparse Delaunay Triangulations or "... But Not Too Nasty". Erickson, J. Discrete & Computational Geometry, 33(1):83--115, 2005. ![Dense Point Sets Have Sparse Delaunay Triangulations or "... But Not Too Nasty" [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper bibtex @article{DBLP:journals/dcg/Erickson05,
author = {Jeff Erickson},
title = {Dense Point Sets Have Sparse Delaunay Triangulations or "... But Not
Too Nasty"},
journal = {Discrete {\&} Computational Geometry},
volume = {33},
number = {1},
pages = {83--115},
year = {2005},
url = {http://www.springerlink.com/index/10.1007/s00454-004-1089-3},
timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/bib/journals/dcg/Erickson05},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"65LiJFbhNJLHuqM4d","bibbaseid":"erickson-densepointsetshavesparsedelaunaytriangulationsorbutnottoonasty-2005","downloads":0,"creationDate":"2018-05-03T22:36:53.758Z","title":"Dense Point Sets Have Sparse Delaunay Triangulations or \"... But Not Too Nasty\"","author_short":["Erickson, J."],"year":2005,"bibtype":"article","biburl":"https://dblp.org/pid/e/JeffErickson.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Jeff"],"propositions":[],"lastnames":["Erickson"],"suffixes":[]}],"title":"Dense Point Sets Have Sparse Delaunay Triangulations or \"... But Not Too Nasty\"","journal":"Discrete & Computational Geometry","volume":"33","number":"1","pages":"83--115","year":"2005","url":"http://www.springerlink.com/index/10.1007/s00454-004-1089-3","timestamp":"Tue, 21 Nov 2017 00:00:00 +0100","biburl":"https://dblp.org/rec/bib/journals/dcg/Erickson05","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/dcg/Erickson05,\n author = {Jeff Erickson},\n title = {Dense Point Sets Have Sparse Delaunay Triangulations or \"... But Not\n Too Nasty\"},\n journal = {Discrete {\\&} Computational Geometry},\n volume = {33},\n number = {1},\n pages = {83--115},\n year = {2005},\n url = {http://www.springerlink.com/index/10.1007/s00454-004-1089-3},\n timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},\n biburl = {https://dblp.org/rec/bib/journals/dcg/Erickson05},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Erickson, J."],"key":"DBLP:journals/dcg/Erickson05","id":"DBLP:journals/dcg/Erickson05","bibbaseid":"erickson-densepointsetshavesparsedelaunaytriangulationsorbutnottoonasty-2005","role":"author","urls":{"Paper":"http://www.springerlink.com/index/10.1007/s00454-004-1089-3"},"downloads":0},"search_terms":["dense","point","sets","sparse","delaunay","triangulations","nasty","erickson"],"keywords":[],"authorIDs":[],"dataSources":["B2t5ThadzZEEe7GQd"]}