DSpace at KOASAS
College of Engineering(공과대학)School of Computing(전산학부)CS-Journal Papers(저널논문)

The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 776
  • Download : 0
Export
DC FieldValueLanguage
dc.contributor.authorAronov, Borisko
dc.contributor.authorCheong, Otfriedko
dc.contributor.authorDobbins, Michael Geneko
dc.contributor.authorGoaoc, Xavierko
dc.date.accessioned2017-03-31T05:40:46Z-
dc.date.available2017-03-31T05:40:46Z-
dc.date.created2017-03-20-
dc.date.created2017-03-20-
dc.date.created2017-03-20-
dc.date.issued2017-01-
dc.identifier.citationDISCRETE & COMPUTATIONAL GEOMETRY, v.57, no.1, pp.104 - 124-
dc.identifier.issn0179-5376-
dc.identifier.urihttp://hdl.handle.net/10203/222774-
dc.description.abstractWe show that the union of n translates of a convex body in R-3 can have Theta (n(3)) holes in the worst case, where a hole in a set X is a connected component of R-3 \ X. This refutes a 20-year-old conjecture. As a consequence, we also obtain improved lower bounds on the complexity of motion planning problems and of Voronoi diagrams with convex distance functions.-
dc.languageEnglish-
dc.publisherSPRINGER-
dc.subjectVORONOI DIAGRAMS-
dc.subjectCOMPLEXITY-
dc.titleThe Number of Holes in the Union of Translates of a Convex Set in Three Dimensions-
dc.typeArticle-
dc.identifier.wosid000393700500005-
dc.identifier.scopusid2-s2.0-84988353079-
dc.type.rimsART-
dc.citation.volume57-
dc.citation.issue1-
dc.citation.beginningpage104-
dc.citation.endingpage124-
dc.citation.publicationnameDISCRETE & COMPUTATIONAL GEOMETRY-
dc.identifier.doi10.1007/s00454-016-9820-4-
dc.contributor.localauthorCheong, Otfried-
dc.contributor.nonIdAuthorAronov, Boris-
dc.contributor.nonIdAuthorDobbins, Michael Gene-
dc.contributor.nonIdAuthorGoaoc, Xavier-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorUnion complexity-
dc.subject.keywordAuthorConvex sets-
dc.subject.keywordAuthorMotion planning-
dc.subject.keywordPlusVORONOI DIAGRAMS-
dc.subject.keywordPlusCOMPLEXITY-
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

Display Simple Item Record

qr_code

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


rss_1.0 rss_2.0 atom_1.0