↓ 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
Attention for Chapter 21: Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Readers on

mendeley
6 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.
Chapter title
Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms
Chapter number 21
Book title
Discrete and Computational Geometry
Published by
Springer, Berlin, Heidelberg, December 1998
DOI 10.1007/978-3-540-46515-7_21
Book ISBNs
978-3-54-067181-7, 978-3-54-046515-7
Authors

Frank Nielsen, Nielsen, Frank

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 17%
Unknown 5 83%

Demographic breakdown

Readers by professional status Count As %
Professor 2 33%
Student > Ph. D. Student 2 33%
Professor > Associate Professor 1 17%
Other 1 17%
Readers by discipline Count As %
Computer Science 6 100%