Delaunay triangulation programs on surface data.

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 331
  • Download : 446
DC FieldValueLanguage
dc.contributor.authorChoi, Sunghee-
dc.contributor.authorAmenta, Nina-
dc.date.accessioned2011-02-14T01:30:59Z-
dc.date.available2011-02-14T01:30:59Z-
dc.date.created2012-02-06-
dc.date.issued2002-01-01-
dc.identifier.citationSODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms , v., no., pp.135 - 136-
dc.identifier.urihttp://hdl.handle.net/10203/22086-
dc.description.abstractThe Delaunay triangulation of a set of points in 3D can have size Θ(n2) in the worst case, but this is rarely if ever observed in practice. We compare three production-quality Delaunay triangulation programs on some 'real-world' sets of points lying on or near 2D surfaces.-
dc.description.sponsorshipWe are very grateful to Clarkson for hull, to Shewchuk for a pre-release copy of pyramid, and to Teillaud and Pion for a pre-release version of CGM. Delaunay hierarchy.en
dc.languageENG-
dc.language.isoen_USen
dc.titleDelaunay triangulation programs on surface data.-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.beginningpage135-
dc.citation.endingpage136-
dc.citation.publicationnameSODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms-
dc.contributor.localauthorChoi, Sunghee-
dc.contributor.nonIdAuthorAmenta, Nina-

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0