Skip to main content
SpringerLink
Log in

Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

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

Included in the following conference series:

Abstract

Given a set of n colored points with a total of m (≥ 3) colors in 2D, the problem of identifying the smallest color-spanning object is studied. We have considered two different shapes: (i) corridor, and (ii) rectangle of arbitrary orientation. Our proposed algorithms for the problems (i) and (ii) run in time O(n 2logn) and O(n 3logm) respectively.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristan, V.: Smallest color-spanning objects. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 278–289. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Huttenlochar, D.P., Kedem, K., Sharir, M.: The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom. 9, 267–291 (1993)

    Article  MathSciNet  Google Scholar 

  3. Janardan, R., Preparata, F.P.: Widest-corridor problems. Nordic J. Comput. 1, 231–245 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Statistical Institute, Calcutta, 700 108, India

    Sandip Das & Subhas C. Nandy

  2. Calcutta University, Calcutta, 700 009, India

    Partha P. Goswami

Authors
  1. Sandip Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Partha P. Goswami
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Subhas C. Nandy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W, T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, P.O. Box, I-06123, Perugia, Italy

    Antonio Laganà

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, P.O. Box, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Das, S., Goswami, P.P., Nandy, S.C. (2005). Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424758_85

Download citation

  • DOI: https://doi.org/10.1007/11424758_85

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25860-5

  • Online ISBN: 978-3-540-32043-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation