1. Aaronson, S.: NP-complete problems and physical reality. SIGACT News 36(1), 30–52 (2005)
2. Angelini, P., Eppstein, D., Frati, F., Kaufmann, M., Lazard, S., Mchedlidze, T., Teillaud, M., Wolff, A.: Universal point sets for planar graph drawings with circular arcs. In: Proceedings of the 25th Canadian Conference on Computational Geometry, pp. 117–122 (2013)
3. Aurenhammer, F.: Power diagrams: properties, algorithms and applications. SIAM J. Comput. 16(1), 78–96 (1987)
4. Bern, M., Eppstein, D.: Optimal Möbius transformations for information visualization and meshing. In: 7th Workshop Algorithms and Data Structures. Lecture Notes in Computer Science, vol. 2125, pp. 14–25. Springer, Beriln (2001).
5. Bern, M., Eppstein, D.: Möbius-invariant natural neighbor interpolation. In: Proceedings of 14th ACM-SIAM Symposium. Discrete Algorithms (SODA’03), pp. 128–129 (2003). http://portal.acm.org/citation.cfm?id=644130