Skip to main content

On the Structure of Discrete Metric Spaces Isometric to Circles

  • Conference paper
  • First Online:
Algorithmic Aspects in Information and Management (AAIM 2019)

Abstract

A metric space (XD) is called circular if it is isometric to a subspace of a metric circle, that is, a circle in which distances are measured by the length of the shorter arc connecting them. We show that the following three conditions are equivalent: (1) X is circular, (2) every 4-point subset of X can be labeled as abcd so that \(D(a,b)+D(b,c)=D(a,c)\), \(D(b,c)+D(c,d)=D(b,d)\) holds, and (3) every 4-point subset of X is circular.

This paper was supported in part by the National Natural Science Foundation of China under Grant No. 11471209.

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 EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Notes

  1. 1.

    As always, given any metric space \(X=(X,D)\) and any two points \(x,y\in X\), we denote by [xy] the interval \([x,y]=[x,y]_{D}:=\{z\in X: D(x,y)=D(x,z)+D(z,y)\}\) spanned by x and y relative to D. Recall that \(x,y,z,u\in X, y\in [x,z]\), and \(z\in [x,u]\) always implies \(y\in [x,u]\) and \(z\in [y,u]\).

References

  1. Apostol, T.M.: Ptolemy’s inequality and the chordal metric. Math. Mag. 40, 233–235 (1967)

    Article  MathSciNet  Google Scholar 

  2. Berger, M.: Geometry I. Springer, Heidelberg (1967). 1977. MAA

    Google Scholar 

  3. Blumenthal, L.: A new concept in distance geometry with applications to spherical subsets. Bull. Am. Math. Soc. 47(6), 435–443 (1941)

    Article  MathSciNet  Google Scholar 

  4. Blumenthal, L.: Theory and Applications of Distance Geometry, 2nd edn. Chelsce Pub. Co., Bronx (1970)

    MATH  Google Scholar 

  5. Chepoi, V., Fichet, B.: A note on circular decomposable metrics. Geom. Ded. 69, 237–240 (1998)

    Article  MathSciNet  Google Scholar 

  6. Deza, E., Deza, M.M.: Dictionary of Distances. Elsevier, Tokyo (2006)

    MATH  Google Scholar 

  7. Deza, M., Laurent, M.: Geometry of Cuts and Metrics. Algorithms and Combinatorics, vol. 15. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-04295-9

    Book  Google Scholar 

  8. Robinson, P.L.: The sphere is not flat. Am. Math. Monthly 113, 171–172 (2006)

    Article  MathSciNet  Google Scholar 

  9. Tóth, L.F.: Langerungen in der Ebene auf Kugel unt im Raum. Springer, Heidelberg (1972). https://doi.org/10.1007/978-3-642-65234-9

    Book  Google Scholar 

Download references

Acknowledgment

We wish to thank Michel Deza for various interesting and helpful discussions of the topic of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhenbing Zeng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dress, A.W.M., Maehara, H., Pang, S.X.M., Zeng, Z. (2019). On the Structure of Discrete Metric Spaces Isometric to Circles. In: Du, DZ., Li, L., Sun, X., Zhang, J. (eds) Algorithmic Aspects in Information and Management. AAIM 2019. Lecture Notes in Computer Science(), vol 11640. Springer, Cham. https://doi.org/10.1007/978-3-030-27195-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-27195-4_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-27194-7

  • Online ISBN: 978-3-030-27195-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics