Skip to main content

On the Number of Radial Orderings of Colored Planar Point Sets

  • Chapter
Computational Geometry (EGC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7579))

Included in the following conference series:

Abstract

Let n be an even natural number and let S be a set of n red and n blue points in general position in the plane. Let p ∉ S be a point such that S ∪ {p} is in general position. A radial ordering of S with respect to p is a circular ordering of the elements of S by angle around p. A colored radial ordering is a radial ordering of S in which only the colors of the points are considered. We show that: the number of distinct radial orderings of S is at most O(n4) and at least Ω(n2); the number of colored radial orderings of S is at most O(n4) and at least Ω(n); there exists sets of points with Θ(n4) colored radial orderings and sets of points with only O(n2) colored radial orderings.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bárány, I., Matoušek, J.: Simultaneous partitions of measures by k-fans. Discrete & Comput. Geom. 25, 317–334 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bárány, I., Matoušek, J.: Equipartition of two measures by a 4-fan. Discrete & Comput. Geom. 27, 293–301 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bereg, S.: Equipartitions of measures by 2-fans. Discrete & Comput. Geom. 34, 87–96 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bespamyatnikh, S., Kirkpatrick, D., Snoeyink, J.: Generalizing ham-sandwich cuts to equitable subdivisions. Discrete & Comput. Geom. 24, 605–622 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Deneen, L., Shute, B.: Polygonizations of point sets in the plane. Discrete Comput. Geom. 3(1), 77–87 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gfeller, B., Mihalák, M., Suri, S., Vicari, E., Widmayer, P.: Counting Targets with Mobile Sensors in an Unknown Environment. In: Kutyłowski, M., Cichoń, J., Kubiak, P. (eds.) ALGOSENSORS 2007. LNCS, vol. 4837, pp. 32–45. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Kannianen, O., Allho, T.M.R.: Minimalist navigation for a mobile robot based on a simple visibility sensor information, pp. 68–75 (2008)

    Google Scholar 

  8. Langerman, S., Steiger, W.: Optimization in Arrangements. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 50–61. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Suri, S., Vicari, E., Widmayer, P.: Simple robots with minimal sensing: From local visibility to global geometry. Int. J. Rob. Res. 27, 1055–1067 (2008)

    Article  Google Scholar 

  10. Tovar, B., Freda, L., LaValle, S.M.: Using a robot to learn geometric information from permutations of landmarks. In: Topology and Robotics. Contemp. Math., vol. 438, pp. 33–45. Amer. Math. Soc., Providence (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Díaz-Báñez, J.M., Fabila-Monroy, R., Pérez-Lantero, P. (2012). On the Number of Radial Orderings of Colored Planar Point Sets. In: Márquez, A., Ramos, P., Urrutia, J. (eds) Computational Geometry. EGC 2011. Lecture Notes in Computer Science, vol 7579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34191-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34191-5_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34190-8

  • Online ISBN: 978-3-642-34191-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics