Advertisement

Reconstructing a Simple Polygon from Its Angles

  • Yann Disser
  • Matúš Mihalák
  • Peter Widmayer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6139)

Abstract

We study the problem of reconstructing a simple polygon from angles measured at the vertices of the polygon. We assume that at each vertex, a sensing device returns the sequence of angles between each pair of vertices that are visible. We prove that the sequence of angle measurements at all vertices of a simple polygon in cyclic order uniquely determines the polygon up to similarity. Furthermore, we propose an algorithm that reconstructs the polygon from this information in polynomial time.

Keywords

Short Path Greedy Algorithm Angle Measurement Reconstruction Problem Simple Polygon 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Biedl, T., Durocher, S., Snoeyink, J.: Reconstructing polygons from scanner data. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 862–871. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  2. 2.
    Bilò, D., Disser, Y., Mihalák, M., Suri, S., Vicari, E., Widmayer, P.: Reconstructing visibility graphs with simple robots. In: Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity, pp. 87–99 (2009)Google Scholar
  3. 3.
    Chalopin, J., Das, S., Disser, Y., Mihalák, M., Widmayer, P.: How simple robots benefit from looking back. In: Proceedings of the 7th International Conference on Algorithms and Complexity (to appear)Google Scholar
  4. 4.
    Formann, M., Woeginger, G.: On the reconstruction of simple polygons. Bulletin of the EATCS 40, 225–230 (1990)zbMATHGoogle Scholar
  5. 5.
    Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, Cambridge (2007)zbMATHCrossRefGoogle Scholar
  6. 6.
    Ghosh, S.K., Goswami, P.P.: Unsolved problems in visibility graph theory. In: Proceedings of the India-Taiwan Conference on Discrete Mathematics, pp. 44–54 (2009)Google Scholar
  7. 7.
    Jackson, L., Wismath, K.: Orthogonal polygon reconstruction from stabbing information. Computational Geometry 23(1), 69–83 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Jansen, K., Woeginger, G.: The complexity of detecting crossingfree configurations in the plane. BIT Numerical Mathematics 33(4), 580–595 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Kameda, T., Yamashita, M.: On the reconstruction of polygons with (simple) robots. Personal communication (2009)Google Scholar
  10. 10.
    Rappaport, D.: On the complexity of computing orthogonal polygons from a set of points. Technical Report SOCS-86.9, McGill University, Montréal, Canada (1986)Google Scholar
  11. 11.
    Sidlesky, A., Barequet, G., Gotsman, C.: Polygon reconstruction from line cross-sections. In: Proceedings of the 18th Annual Canadian Conference on Computational Geometry, pp. 81–84 (2006)Google Scholar
  12. 12.
    Skiena, S., Smith, W., Lemke, P.: Reconstructing sets from interpoint distances. In: Proceedings of the Sixth Annual Symposium on Computational Geometry, pp. 332–339 (1990)Google Scholar
  13. 13.
    Snoeyink, J.: Cross-ratios and angles determine a polygon. In: Proceedings of the 14th Annual Symposium on Computational Geometry, pp. 49–57 (1998)Google Scholar
  14. 14.
    Suri, S., Vicari, E., Widmayer, P.: Simple robots with minimal sensing: From local visibility to global geometry. International Journal of Robotics Research 27(9), 1055–1067 (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Yann Disser
    • 1
  • Matúš Mihalák
    • 1
  • Peter Widmayer
    • 1
  1. 1.Institute of Theoretical Computer ScienceETH Zürich 

Personalised recommendations