DC Field | Value | Language |
---|---|---|
dc.contributor.author | Aronov, Boris | ko |
dc.contributor.author | Cheong, Otfried | ko |
dc.contributor.author | Dobbins, Michael Gene | ko |
dc.contributor.author | Goaoc, Xavier | ko |
dc.date.accessioned | 2017-01-16T01:19:38Z | - |
dc.date.available | 2017-01-16T01:19:38Z | - |
dc.date.created | 2017-01-02 | - |
dc.date.created | 2017-01-02 | - |
dc.date.issued | 2016-06-15 | - |
dc.identifier.citation | 32nd International Symposium on Computational Geometry, SoCG 2016, pp.10.1 - 10.16 | - |
dc.identifier.uri | http://hdl.handle.net/10203/219415 | - |
dc.description.abstract | We show that the union of n translates of a convex body in ℝ3 can have Θ(n3) holes in the worst case, where a hole in a set X is a connected component of ℝ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.language | English | - |
dc.publisher | Computational Geometry Committee | - |
dc.title | The number of holes in the union of translates of a convex set in three dimensions | - |
dc.type | Conference | - |
dc.identifier.scopusid | 2-s2.0-84976876712 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 10.1 | - |
dc.citation.endingpage | 10.16 | - |
dc.citation.publicationname | 32nd International Symposium on Computational Geometry, SoCG 2016 | - |
dc.identifier.conferencecountry | US | - |
dc.identifier.conferencelocation | Boston, MA | - |
dc.identifier.doi | 10.4230/LIPIcs.SoCG.2016.10 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Cheong, Otfried | - |
dc.contributor.nonIdAuthor | Aronov, Boris | - |
dc.contributor.nonIdAuthor | Dobbins, Michael Gene | - |
dc.contributor.nonIdAuthor | Goaoc, Xavier | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.