↓ Skip to main content

Discrete and Computational Geometry

Overview of attention for book
Cover of 'Discrete and Computational Geometry'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Radial Perfect Partitions of Convex Sets in the Plane
  3. Altmetric Badge
    Chapter 2 Dudeney Dissection of Polygons
  4. Altmetric Badge
    Chapter 3 Effective Use of Geometric Properties for Clustering
  5. Altmetric Badge
    Chapter 4 Living with lrs
  6. Altmetric Badge
    Chapter 5 On the Existente of a Point Subset with 4 or 5 Interior Points
  7. Altmetric Badge
    Chapter 6 Planar Drawing Algorithms of Survivable Telecommunication Networks
  8. Altmetric Badge
    Chapter 7 Polygon Cutting: Revisited
  9. Altmetric Badge
    Chapter 8 Algorithms for Packing Two Circles in a Convex Polygon
  10. Altmetric Badge
    Chapter 9 Folding and Cutting Paper
  11. Altmetric Badge
    Chapter 10 An Interpolant Based on Line Segment Voronoi Diagrams
  12. Altmetric Badge
    Chapter 11 2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces
  13. Altmetric Badge
    Chapter 12 NP-Completeness of Stage Illumination Problems
  14. Altmetric Badge
    Chapter 13 On the Maximum Degree of Bipartite Embeddings of Trees in the Plane
  15. Altmetric Badge
    Chapter 14 Efficient Regular Polygon Dissections
  16. Altmetric Badge
    Chapter 15 On Soddy’s Hexlet and a Linked 4-Pair
  17. Altmetric Badge
    Chapter 16 Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs
  18. Altmetric Badge
    Chapter 17 Visibility of Disks on the Lattice Points
  19. Altmetric Badge
    Chapter 18 Convex Hull Problem with Imprecise Input
  20. Altmetric Badge
    Chapter 19 One-Dimensional Tilings with Congruent Copies of a 3-Point Set
  21. Altmetric Badge
    Chapter 20 Polygonal Approximations for Curved Problems: An Application to Arrangements
  22. Altmetric Badge
    Chapter 21 Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms
  23. Altmetric Badge
    Chapter 22 Folding and Unfolding in Computational Geometry
  24. Altmetric Badge
    Chapter 23 Crossing Numbers
  25. Altmetric Badge
    Chapter 24 A Note on the Existente of Plane Spanning Trees of Geometrie Graphs
  26. Altmetric Badge
    Chapter 25 Embeddings of Equilateral Polygons in Unit Lattices
  27. Altmetric Badge
    Chapter 26 Order- k Voronoi Diagrams, k -Sections, and k -Sets
  28. Altmetric Badge
    Chapter 27 ”Impossible Objects” Are Not Necessarily Impossible – Mathematical Study on Optical Illusion –
  29. Altmetric Badge
    Chapter 28 An Efficient Solution to the Corridor Search Problem
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (94th percentile)
  • High Attention Score compared to outputs of the same age and source (88th percentile)

Mentioned by

book_reviews
1 book reviewer
wikipedia
11 Wikipedia pages

Citations

dimensions_citation
5 Dimensions
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Discrete and Computational Geometry
Published by
Lecture notes in computer science, January 2000
DOI 10.1007/b75044
ISBNs
978-3-54-067181-7, 978-3-54-046515-7
Authors

Jin Akiyama, Mikio Kano, Masatsugu Urabe

Editors

Akiyama, Jin, Kano, Mikio, Urabe, Masatsugu

Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 10. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 17 October 2022.
All research outputs
#3,066,060
of 23,543,207 outputs
Outputs from Lecture notes in computer science
#645
of 8,139 outputs
Outputs of similar age
#5,473
of 109,366 outputs
Outputs of similar age from Lecture notes in computer science
#2
of 18 outputs
Altmetric has tracked 23,543,207 research outputs across all sources so far. Compared to these this one has done well and is in the 86th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 8,139 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.1. This one has done particularly well, scoring higher than 91% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 109,366 tracked outputs that were published within six weeks on either side of this one in any source. This one has done particularly well, scoring higher than 94% of its contemporaries.
We're also able to compare this research output to 18 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 88% of its contemporaries.