Talk:Point-set triangulation
Add topic| This is the talk page for discussing improvements to the Point-set triangulation article. This is not a forum for general discussion of the subject of the article. |
Article policies
|
| Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Space Complexities
[edit]I just collected the time complexities and not the space complexities. I am unsure whether the article benefits from having space complexities because the table becomes less readable and my intention of it was to state what problems are solvable in polynomial time and which ones are (probably) not. If there are examples of other Wikipedia articles that you know of for which editors have decided either way (providing or leaving out space complexities) or know of a Wikipedia policy that clearly states how to proceed, please leave a comment. Winniehell (talk) 11:13, 23 June 2013 (UTC)
Missing reference
[edit]The original reference for height, eccentricity, and slope is not Tan 1995 but
- Bern, M.; Edelsbrunner, H.; Eppstein, D.; Mitchell, S.; Tan, T. S. (1993), "Edge insertion for optimal triangulations", Discrete and Computational Geometry, 10 (1): 47–65, doi:10.1007/BF02573962, MR 1215322
—David Eppstein (talk) 16:25, 23 June 2013 (UTC)
Thank you very much for the hint! I fixed the reference. Winniehell (talk) 18:39, 23 June 2013 (UTC)
greedy
[edit]- A related heuristic, the greedy triangulation, constructs a triangulation by repeatedly adding the shortest edge that does not intersect existing edges, …
Doesn't that give Delaunay? —Antonissimo (talk) 02:46, 30 May 2026 (UTC)