Mostrar el registro sencillo del ítem
Ponencia
New bound for incremental constructing arrangements of curves
dc.creator | Abellanas Oar, Manuel | es |
dc.creator | Calatayud Ramos, Aymée | es |
dc.creator | García López, Jesús | es |
dc.date.accessioned | 2017-03-20T11:38:03Z | |
dc.date.available | 2017-03-20T11:38:03Z | |
dc.date.issued | 2004 | |
dc.identifier.citation | Abellanas Oar, M., Calatayud Ramos, A. y García López, J. (2004). New bound for incremental constructing arrangements of curves. En 20th European Workshop on Computational Geometry, Sevilla. | |
dc.identifier.uri | http://hdl.handle.net/11441/56017 | |
dc.description.abstract | Let A(Γ) be the arrangement induced by a set Γ of n unbounded Jordan curves in the plane that intersect each other in at most two points. The upper bound for constructing those arrangements by an incremental method is, up to now, O(nλ4(n)). In this paper we improve this bound to O(nλ3(n)). | es |
dc.description.sponsorship | Ministerio de Ciencia y Tecnología | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.relation.ispartof | 20th European Workshop on Computational Geometry (2004). | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Arrangements of curves | es |
dc.subject | Incremental algorithms | es |
dc.subject | Zones | es |
dc.title | New bound for incremental constructing arrangements of curves | es |
dc.type | info:eu-repo/semantics/conferenceObject | es |
dc.type.version | info:eu-repo/semantics/submittedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.relation.projectID | MCYT TIC2003-08933-C02-01 | es |
dc.relation.projectID | MCYT TIC2002-01541 | 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 |
---|---|---|---|---|
New bound for incremental ... | 105.6Kb | [PDF] | Ver/ | |