Computing the Maximum Overlap of Two Convex Polygons Under Translations

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 415
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorBerg, Mark de-
dc.contributor.authorDevillers, Olivier-
dc.contributor.authorKreveld, Marc van-
dc.contributor.authorCheong, Otfried-
dc.contributor.authorTeillaud, Monique-
dc.date.accessioned2013-03-15T14:05:00Z-
dc.date.available2013-03-15T14:05:00Z-
dc.date.created2012-02-06-
dc.date.issued1996-12-16-
dc.identifier.citation7th Ann. International Symp. on Algorithms and Computation, v., no., pp.126 - 135-
dc.identifier.urihttp://hdl.handle.net/10203/120076-
dc.languageENG-
dc.titleComputing the Maximum Overlap of Two Convex Polygons Under Translations-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.beginningpage126-
dc.citation.endingpage135-
dc.citation.publicationname7th Ann. International Symp. on Algorithms and Computation-
dc.identifier.conferencecountryJapan-
dc.identifier.conferencecountryJapan-
dc.contributor.localauthorCheong, Otfried-
dc.contributor.nonIdAuthorBerg, Mark de-
dc.contributor.nonIdAuthorDevillers, Olivier-
dc.contributor.nonIdAuthorKreveld, Marc van-
dc.contributor.nonIdAuthorTeillaud, Monique-
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0