↓ Skip to main content

Algorithms — ESA '96

Overview of attention for book
Cover of 'Algorithms — ESA '96'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 42 Analysis of Shellsort and related algorithms
  3. Altmetric Badge
    Chapter 43 Drawing with colors
  4. Altmetric Badge
    Chapter 44 Approximating the unsatisfiability threshold of random formulas (Extended Abstract)
  5. Altmetric Badge
    Chapter 45 Preemptive weighted completion time scheduling of parallel jobs
  6. Altmetric Badge
    Chapter 46 Approximation algorithms for dynamic storage allocation
  7. Altmetric Badge
    Chapter 47 Positive linear programming, parallel approximation and PCP's
  8. Altmetric Badge
    Chapter 48 Scheduling jobs with communication delays: Using infeasible solutions for approximation
  9. Altmetric Badge
    Chapter 49 Randomization of search trees by subtree size
  10. Altmetric Badge
    Chapter 50 Efficient dynamic method-lookup for object oriented languages
  11. Altmetric Badge
    Chapter 51 Priority queues: Small, monotone and trans-dichotomous
  12. Altmetric Badge
    Chapter 52 Simulated Annealing and its problems to color graphs
  13. Altmetric Badge
    Chapter 53 The capacitated K-center problem
  14. Altmetric Badge
    Chapter 54 A unified local ratio approximation of node-deletion problems
  15. Altmetric Badge
    Chapter 55 Approximation algorithms for connected dominating sets
  16. Altmetric Badge
    Chapter 56 Greedy algorithms for the shortest common superstring that are asymtotically optimal
  17. Altmetric Badge
    Chapter 57 On the depth of randomly generated circuits
  18. Altmetric Badge
    Chapter 58 The analysis of linear probing hashing with buckets
  19. Altmetric Badge
    Chapter 59 Parallel algorithms for partitioning sorted sets and related problems
  20. Altmetric Badge
    Chapter 60 Fast generation of random permutations via networks simulation
  21. Altmetric Badge
    Chapter 61 On the Parallel Dynamic Dictionary Matching problem: New results with applications
  22. Altmetric Badge
    Chapter 62 Parallel algorithms for series parallel graphs
  23. Altmetric Badge
    Chapter 63 Parallel complexity of householder QR factorization
  24. Altmetric Badge
    Chapter 64 Reporting red-blue intersections between two sets of connected line segments
  25. Altmetric Badge
    Chapter 65 Matching convex shapes with respect to the symmetric difference
  26. Altmetric Badge
    Chapter 66 On minimum-area hulls
  27. Altmetric Badge
    Chapter 67 Negative-cycle detection algorithms
  28. Altmetric Badge
    Chapter 68 A new regular grammar pattern matching algorithm
  29. Altmetric Badge
    Chapter 69 Lempel-Ziv index for q -grams
  30. Altmetric Badge
    Chapter 70 Computing upper and lower bounds on textile nesting problems
  31. Altmetric Badge
    Chapter 71 On-line and off-line approximation algorithms for vector covering problems
  32. Altmetric Badge
    Chapter 72 Competitive analysis of randomized paging algorithms
  33. Altmetric Badge
    Chapter 73 On-line competitive algorithms for call admission in optical networks
  34. Altmetric Badge
    Chapter 74 Race-condition detection in parallel computation with semaphores (extended abstract)
  35. Altmetric Badge
    Chapter 75 Efficient wavelength routing on directed fiber trees
  36. Altmetric Badge
    Chapter 76 A lower bound for nearly minimal adaptive and hot potato algorithms
  37. Altmetric Badge
    Chapter 77 The structure of circular decomposable metrics
  38. Altmetric Badge
    Chapter 78 Faster algorithms for subgraph isomorphism of κ-connected partial κ-trees
  39. Altmetric Badge
    Chapter 79 Planar spanners and approximate shortest path queries among obstacles in the plane
  40. Altmetric Badge
    Chapter 80 A new approach to optimal planning of robot motion on a tree with obstacles
  41. Altmetric Badge
    Chapter 81 Generalized streets revisited
  42. Altmetric Badge
    Chapter 82 Computational aspects of organization theory
Attention for Chapter 64: Reporting red-blue intersections between two sets of connected line segments
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
8 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
Reporting red-blue intersections between two sets of connected line segments
Chapter number 64
Book title
Algorithms — ESA '96
Published in
Lecture notes in computer science, September 1996
DOI 10.1007/3-540-61680-2_64
Book ISBNs
978-3-54-061680-1, 978-3-54-070667-0
Authors

Julien Basch, Leonidas J. Guibas, G. D. Ramkumar, Basch, Julien, Guibas, Leonidas J., Ramkumar, G. D.

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 8 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 50%
Researcher 2 25%
Professor > Associate Professor 1 13%
Unknown 1 13%
Readers by discipline Count As %
Computer Science 6 75%
Physics and Astronomy 1 13%
Unknown 1 13%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 May 2012.
All research outputs
#7,454,951
of 22,790,780 outputs
Outputs from Lecture notes in computer science
#2,486
of 8,127 outputs
Outputs of similar age
#8,474
of 28,263 outputs
Outputs of similar age from Lecture notes in computer science
#3
of 7 outputs
Altmetric has tracked 22,790,780 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,127 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 55% 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 28,263 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 9th percentile – i.e., 9% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 7 others from the same source and published within six weeks on either side of this one. This one has scored higher than 4 of them.