Lineal Hull: Two Algorithms for Convex Hull

Simple item page
dc.contributor.authorSánchez, M. Garcíaen_US
dc.contributor.authorSalas, A. Leónen_US
dc.contributor.authorCantero, J. C. Torresen_US
dc.contributor.editorIsabel Navazo and Gustavo Patowen_US
dc.date.accessioned2013-11-08T10:18:33Z
dc.date.available2013-11-08T10:18:33Z
dc.date.issued2012en_US
dc.description.abstractThis poster proposes a concept that improves the existing algorithms for convex hull. This concept can be applied whether the initial points are sorted or not. The results show a comparation with Quick-Hull (QH) [BDH96]en_US
dc.description.seriesinformationSpanish Computer Graphics Conferenceen_US
dc.identifier.isbn978-3-905673-92-0en_US
dc.identifier.urihttps://doi.org/10.2312/LocalChapterEvents/CEIG/CEIG12/164-164en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectI.3.5 [Computer Graphics]en_US
dc.subjectComputational Geometry and Object Modelingen_US
dc.subjectGeometricen_US
dc.subjectalgorithmsen_US
dc.subjectlanguagesen_US
dc.subjectand systemsen_US
dc.titleLineal Hull: Two Algorithms for Convex Hullen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
164-164.pdf
Size:
157.08 KB
Format:
Adobe Portable Document Format
Download
Collections
CEIG12