Mostrar el registro sencillo del ítem

Ponencia

dc.creatorBose, Prosenjites
dc.creatorMaheshwari, Aniles
dc.creatorMorin, Patrickes
dc.creatorMorrison, Jasones
dc.creatorSmid, Michieles
dc.creatorVahrenhold, Janes
dc.date.accessioned2017-03-02T07:25:26Z
dc.date.available2017-03-02T07:25:26Z
dc.date.issued2004
dc.identifier.citationBose, P., Maheshwari, A., Morin, P., Morrison, J., Smid, M. y Vahrenhold, J. (2004). Space-efficient geometric divide-and-conquer algorithms. En 20th European Workshop on Computational Geometry, Sevilla.
dc.identifier.urihttp://hdl.handle.net/11441/55067
dc.description.abstractWe present an approach to simulate divide-and-conquer algorithms in a space-efficient way, and illustrate it by giving space-efficient algorithms for the closest-pair, bichromatic closest-pair, all-nearest-neighbors, and orthogonal line segment intersection problems.es
dc.description.sponsorshipGerman Academic Exchange Service (DAAD)es
dc.formatapplication/pdfes
dc.language.isoenges
dc.relation.ispartof20th European Workshop on Computational Geometry (2004).
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectComputational geometryes
dc.subjectSpace-efficient algorithmses
dc.subjectAll-nearest-neighborses
dc.subjectOrthogonal line segment intersectiones
dc.titleSpace-efficient geometric divide-and-conquer algorithmses
dc.typeinfo:eu-repo/semantics/conferenceObjectes
dc.type.versioninfo:eu-repo/semantics/submittedVersiones
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses
dc.relation.projectIDD/0104616es
idus.format.extent4 p.es
dc.eventtitle20th European Workshop on Computational Geometryes
dc.eventinstitutionSevillaes

FicherosTamañoFormatoVerDescripción
Space-efficient geometric ...97.46KbIcon   [PDF] Ver/Abrir  

Este registro aparece en las siguientes colecciones

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional