Mostrar el registro sencillo del ítem

Ponencia

dc.creatorFunke, Stefanes
dc.creatorMalamatos, Theocharises
dc.creatorRay, Rahules
dc.date.accessioned2017-03-02T07:56:37Z
dc.date.available2017-03-02T07:56:37Z
dc.date.issued2004
dc.identifier.citationFunke, S., Malamatos, T. y Ray, R. (2004). Finding planar regions in a terrain. En 20th European Workshop on Computational Geometry, Sevilla.
dc.identifier.urihttp://hdl.handle.net/11441/55074
dc.description.abstractWe consider the problem of computing large connected regions in a triangulated terrain of size n for which the normals of the triangles deviate by at most some small fixed angle. In previous work an exact near-quadratic algorithm was presented, but only a heuristic implementation with no guarantee was practicable. We present a new approximation algorithm for the problem which runs in O(n/e2) time and-apart from giving a guarantee on the quality of the produced solution-has been implemented and shows good performance on real data sets representing fracture surfaces with around half a million triangles.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.titleFinding planar regions in a terraines
dc.typeinfo:eu-repo/semantics/conferenceObjectes
dc.type.versioninfo:eu-repo/semantics/submittedVersiones
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses
idus.format.extent4 p.es
dc.eventtitle20th European Workshop on Computational Geometryes
dc.eventinstitutionSevillaes

FicherosTamañoFormatoVerDescripción
Finding planar regions in a ...184.0KbIcon   [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