↓ 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 Universal Measuring Devices with Rectangular Base
  3. Altmetric Badge
    Chapter 2 Maximin Distance for n Points in a Unit Square or a Unit Circle
  4. Altmetric Badge
    Chapter 3 Congruent Dudeney Dissections of Polygons
  5. Altmetric Badge
    Chapter 4 Playing with Triangulations
  6. Altmetric Badge
    Chapter 5 The Foldings of a Square to Convex Polyhedra
  7. Altmetric Badge
    Chapter 6 On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities
  8. Altmetric Badge
    Chapter 7 On Partitioning a Cake
  9. Altmetric Badge
    Chapter 8 Constrained Equitable 3-Cuttings
  10. Altmetric Badge
    Chapter 9 On the Minimum Perimeter Triangle Enclosing a Convex Polygon
  11. Altmetric Badge
    Chapter 10 Succinct Data Structures for Approximating Convex Functions with Applications
  12. Altmetric Badge
    Chapter 11 Efficient Algorithms for Constructing a Pyramid from a Terrain
  13. Altmetric Badge
    Chapter 12 On the Face Lattice of the Metric Polytope
  14. Altmetric Badge
    Chapter 13 Partitioning a Planar Point Set into Empty Convex Polygons
  15. Altmetric Badge
    Chapter 14 Relaxed Scheduling in Dynamic Skin Triangulation
  16. Altmetric Badge
    Chapter 15 A Note on Point Subsets with a Specified Number of Interior Points
  17. Altmetric Badge
    Chapter 16 Piano-Hinged Dissections: Now Let’s Fold!
  18. Altmetric Badge
    Chapter 17 The Convex Hull for Random Lines in the Plane
  19. Altmetric Badge
    Chapter 18 Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon
  20. Altmetric Badge
    Chapter 19 On Reconfiguring Radial Trees
  21. Altmetric Badge
    Chapter 20 Viewing Cube and Its Visual Angles
  22. Altmetric Badge
    Chapter 21 Observing an Angle from Various Viewpoints
  23. Altmetric Badge
    Chapter 22 The Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Sphere
  24. Altmetric Badge
    Chapter 23 Maximal Number of Edges in Geometric Graphs without Convex Polygons
  25. Altmetric Badge
    Chapter 24 Relaxing Planarity for Topological Graphs
  26. Altmetric Badge
    Chapter 25 On the Size of a Radial Set
  27. Altmetric Badge
    Chapter 26 Tight Bounds for Visibility Matching of f-Equal Width Objects
  28. Altmetric Badge
    Chapter 27 Long Paths through Specified Vertices in 3-Connected Graphs
  29. Altmetric Badge
    Chapter 28 On the Number of Intersections of Three Monochromatic Trees in the Plane
  30. Altmetric Badge
    Chapter 29 Open Problems in Geometric Methods for Instance-Based Learning
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

facebook
1 Facebook page
wikipedia
2 Wikipedia pages
q&a
1 Q&A thread

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
84 Mendeley
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
Springer, Berlin, Heidelberg, January 2002
DOI 10.1007/b11261
ISBNs
978-3-54-020776-4, 978-3-54-044400-8
Editors

Jin Akiyama, Mikio Kano

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 84 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 84 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 1 1%
Lecturer 1 1%
Unknown 82 98%
Readers by discipline Count As %
Mathematics 1 1%
Agricultural and Biological Sciences 1 1%
Unknown 82 98%