Progressive geometric algorithms

Authors

  • Sander P.A. Alewijnse
  • Timur M. Bagautdinov
  • Mark de Berg TU Eindhoven
  • Quirijn W. Bouts TU Eindhoven
  • Alex P. ten Brink TU Eindhoven
  • Kevin Buchin TU Eindhoven
  • Michel A. Westenberg

DOI:

https://doi.org/10.20382/jocg.v6i2a5

Abstract

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.

Downloads

Download data is not yet available.

Downloads

Published

2015-01-26

Issue

Vol. 6 No. 2 (2015): Special issue of Selected Papers from SoCG 2014

Section

Articles

License

Authors who publish with this journal agree to the following terms:

Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).