A wide-range algorithm for minimal triangulation from an arbitrary ordering
dc.contributor.author | Berry, Anne | eng |
dc.contributor.author | Bordat, Jean-Paul | eng |
dc.contributor.author | Heggernes, Pinar | eng |
dc.contributor.author | Simonet, Genevieve | eng |
dc.contributor.author | Villanger, Yngve | eng |
dc.date.accessioned | 2006-04-10T17:11:36Z | |
dc.date.available | 2006-04-10T17:11:36Z | |
dc.date.issued | 2006 | eng |
dc.Published | Journal of Algorithms 2006 58(1): 33-66 | |
dc.identifier.issn | 0196-6774 | en_US |
dc.identifier.uri | https://hdl.handle.net/1956/1147 | |
dc.format.extent | 552674 bytes | eng |
dc.format.mimetype | application/pdf | eng |
dc.language.iso | eng | eng |
dc.publisher | Elsevier | en_US |
dc.title | A wide-range algorithm for minimal triangulation from an arbitrary ordering | en_US |
dc.type | Journal article | |
dc.identifier.doi | https://doi.org/10.1016/j.jalgor.2004.07.001 |
Files in this item
This item appears in the following Collection(s)
-
Department of Informatics [1002]