Lineal Hull: Two Algorithms for Convex Hull
View/
Date
2012Pay-Per-View via TIB Hannover:
Try if this item/paper is available.
Metadata
Show full item recordAbstract
This 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]
BibTeX
@inproceedings {10.2312:LocalChapterEvents:CEIG:CEIG12:164-164,
booktitle = {Spanish Computer Graphics Conference},
editor = {Isabel Navazo and Gustavo Patow},
title = {{Lineal Hull: Two Algorithms for Convex Hull}},
author = {Sánchez, M. García and Salas, A. León and Cantero, J. C. Torres},
year = {2012},
publisher = {The Eurographics Association},
ISBN = {978-3-905673-92-0},
DOI = {10.2312/LocalChapterEvents/CEIG/CEIG12/164-164}
}
booktitle = {Spanish Computer Graphics Conference},
editor = {Isabel Navazo and Gustavo Patow},
title = {{Lineal Hull: Two Algorithms for Convex Hull}},
author = {Sánchez, M. García and Salas, A. León and Cantero, J. C. Torres},
year = {2012},
publisher = {The Eurographics Association},
ISBN = {978-3-905673-92-0},
DOI = {10.2312/LocalChapterEvents/CEIG/CEIG12/164-164}
}