Mostrar el registro sencillo del ítem
Ponencia
Finding a widest empty 1-corner corridor
dc.creator | Díaz Báñez, José Miguel | es |
dc.creator | López, Mario A. | es |
dc.creator | Sellarès Chiva, Joan Antoni | es |
dc.date.accessioned | 2017-03-02T07:08:20Z | |
dc.date.available | 2017-03-02T07:08:20Z | |
dc.date.issued | 2004 | |
dc.identifier.citation | Díaz Báñez, J.M., López, M.A. y Sellarès Chiva, J.A. (2004). Finding a widest empty 1-corner corridor. En 20th European Workshop on Computational Geometry, Sevilla. | |
dc.identifier.uri | http://hdl.handle.net/11441/55064 | |
dc.description.abstract | Given a set of n points in the plane, we consider the problem of computing a widest empty 1-corner corridor. We star giving a characterization of the 1-corner corridors that we call locally widest. Our approach to finding a widest empty 1-corner corridor consists of identifying a set of 1-corner corridors locally widest, that is guaranteed to contain a solution. We describe an algorithm that solves the problem in O(n4 log n) time and O(n) space. | es |
dc.description.sponsorship | Ministerio de Ciencia y Tecnología | es |
dc.description.sponsorship | National Science Foundation | es |
dc.description.sponsorship | Generalitat de Catalunya | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.title | Finding a widest empty 1-corner corridor | es |
dc.type | info:eu-repo/semantics/conferenceObject | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/submittedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada II (ETSI) | es |
dc.relation.projectID | BFM2000-1052 | es |
dc.relation.projectID | DMS-0107628 | es |
dc.relation.projectID | TIC2001-2392-C03-01 | es |
dc.relation.projectID | DURSI-2001SGR-00296 | es |
dc.contributor.group | Universidad de Sevilla. FQM241: Grupo de Investigación en Localización | es |
idus.format.extent | 4 p. | es |
dc.eventtitle | 20th European Workshop on Computational Geometry | es |
dc.eventinstitution | Sevilla | es |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Finding a widest empty 1-corner ... | 123.9Kb | [PDF] | Ver/ | |