Undergraduate Research Opportunities Program


UROP_2016 is the home page for a research project associated with Florida State University's Undergraduate Research Opportunities Program (UROP), starting in Fall Semester 2016 and concluding in Spring Semester 2017, with the participation of Professor Bryan Quaife, Lukas Bystricky and Michael Schneier.

You can view our original project description.

Initially, we have set up a few milestones, which describe skills and knowledge that we expect all the student researchers to master. Our function will be to challenge the students with the milestone, assist them as they work through it, and then to verify that they have completed it properly.

To learn Python, we recommend that our students go through the Python tutorial offered by CodeAcademy. For some of the other topics, we are creating interactive Jupyter notebooks.

After the milestones, we expect our student researchers to propose a special topic of interest to them; at this point, our function will be to suggest references and examples, and to help with problems in programming, analysis, or writing.

After the research project has been completed, the researchers will participate in a poster presentation sponsored by UROP. Our function will be to help with the selection of topics to be presented, the design of the poster, and practice with the oral presentation that should accompany the poster.


  1. Aurenhammer reference,
    Franz Aurenhammer,
    Voronoi diagrams - a study of a fundamental geometric data structure,
    ACM Computing Surveys,
    Volume 23, Number 3, September 1991, pages 345-405.
  2. Jared Burns reference,
    Jared Burns,
    Centroidal Voronoi Tessellations
  3. Marc deBerg, Otfried Cheong, Marc Krevald, Mark Overmars,
    Computational Geometry,
    Springer, 2008,
    ISBN: 978-3-540-77973-5,
    LC: QA448.D38.C65.
  4. http:/www.personal.psu.edu/qud2/Res/Pic/gallery3.html
    Qiang Du's research gallery 3.
  5. Du, Faber, Gunzburger reference,
    Qiang Du, Vance Faber, Max Gunzburger,
    Centroidal Voronoi Tessellations: Applications and Algorithms,
    SIAM Review,
    Volume 41, Number 4, December 1999, pages 637-676.
  6. Florida Congressional Districts from 2010 Census,
    from nationalatlas.gov.
  7. Lili Ju, Qiang Du, Max Gunzburger,
    Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations,
    Parallel Computing,
    Volume 28, 2002, pages 1477-1500.
  8. Stacy Miller reference,
    Stacy Miller,
    The Problem of Redistricting: the Use of Centroidal Voronoi Diagrams to Build Unbiased Congressional Districts
  9. Joseph ORourke,
    Computational Geometry in C,
    Second Edition,
    Cambridge, 1998,
    ISBN: 0521649765,
    LC: QA448.D38.
  10. https://www.toptal.com/python/computational-geometry-in-python-from-theory-to-implementation
    Charles Marsh,
    Computational Geometry in Python: From Theory to Application.
  11. tyler_reddy.pdf (slides)
    https://www.youtube.com/watch?v=gxNa9BD5CnQ (YouTube presentation)
    Tyler Reddy,
    Veni, Vedi, Voronoi: Attacking Viruses using spherical Voronoi Diagrams in Python.

Last revised on 10 November 2016.