Progressive geometric algorithms

S.P.A. Alewijnse, T.M. Bagautdinov, M.T. Berg, de, Q.W. Bouts, A.P. Brink, ten, K. Buchin, M.A. Westenberg

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)
55 Downloads (Pure)

Samenvatting

Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, and develop efficient progressive algorithms for two geometric problems: computing the convex hull of a planar point set, and finding popular places in a set of trajectories.
Originele taal-2Engels
Titel30th ACM Symposium on Computational Geometry (SoCG, Kyoto, Japan, June 8-11, 2014)
Plaats van productieNew York
UitgeverijAssociation for Computing Machinery, Inc
Pagina's50-59
ISBN van geprinte versie978-1-4503-2594-3
DOI's
StatusGepubliceerd - 2014
Evenement30th Annual Symposium on Computational Geometry (SoCG 2014) - Kyoto, Japan
Duur: 8 jun 201411 jun 2014
Congresnummer: 30

Congres

Congres30th Annual Symposium on Computational Geometry (SoCG 2014)
Verkorte titelSoCG '14
LandJapan
StadKyoto
Periode8/06/1411/06/14
Ander30th ACM Symposium on Computational Geometry

Vingerafdruk Duik in de onderzoeksthema's van 'Progressive geometric algorithms'. Samen vormen ze een unieke vingerafdruk.

  • Citeer dit

    Alewijnse, S. P. A., Bagautdinov, T. M., Berg, de, M. T., Bouts, Q. W., Brink, ten, A. P., Buchin, K., & Westenberg, M. A. (2014). Progressive geometric algorithms. In 30th ACM Symposium on Computational Geometry (SoCG, Kyoto, Japan, June 8-11, 2014) (blz. 50-59). Association for Computing Machinery, Inc. https://doi.org/10.1145/2582112.2582156