↓ Skip to main content

Algorithms and Data Structures

Overview of attention for book
Cover of 'Algorithms and Data Structures'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 43 Discrepancy theory and computational geometry
  3. Altmetric Badge
    Chapter 44 Dynamic motion planning in low obstacle density environments
  4. Altmetric Badge
    Chapter 45 Visibility-based pursuit-evasion in a polygonal environment
  5. Altmetric Badge
    Chapter 46 Maintaining the extent of a moving point set
  6. Altmetric Badge
    Chapter 47 Finding cores of limited length
  7. Altmetric Badge
    Chapter 48 On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem
  8. Altmetric Badge
    Chapter 49 Approximation algorithms for a genetic diagnostics problem
  9. Altmetric Badge
    Chapter 50 Cartographic line simplication and polygon CSG formulae in O ( n log * n ) time
  10. Altmetric Badge
    Chapter 51 Constrained TSP and low-power computing
  11. Altmetric Badge
    Chapter 52 On-line load balancing for related machines
  12. Altmetric Badge
    Chapter 53 A linear-time algorithm for the 1-mismatch problem
  13. Altmetric Badge
    Chapter 54 On some geometric optimization problems in layered manufacturing
  14. Altmetric Badge
    Chapter 55 New TSP construction heuristics and their relationships to the 2-opt
  15. Altmetric Badge
    Chapter 56 Pattern matching in hypertext
  16. Altmetric Badge
    Chapter 57 Multiple approximate string matching
  17. Altmetric Badge
    Chapter 58 Applied computational geometry — Abstract
  18. Altmetric Badge
    Chapter 59 Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
  19. Altmetric Badge
    Chapter 60 Voronoi diagrams for polygon-offset distance functions
  20. Altmetric Badge
    Chapter 61 Randomized algorithms for that ancient scheduling problem
  21. Altmetric Badge
    Chapter 62 Optimal parallel algorithms for proximate points, with applications
  22. Altmetric Badge
    Chapter 63 An efficient algorithm for shortest paths in vertical and horizontal segments
  23. Altmetric Badge
    Chapter 64 On geometric path query problems
  24. Altmetric Badge
    Chapter 65 On-line scheduling with hard deadlines
  25. Altmetric Badge
    Chapter 66 Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access
  26. Altmetric Badge
    Chapter 67 Parallel vs. parametric complexity
  27. Altmetric Badge
    Chapter 68 Position-independent near optimal searching and on-line recognition in star polygons
  28. Altmetric Badge
    Chapter 69 Dynamic data structures for fat objects and their applications
  29. Altmetric Badge
    Chapter 70 Intractability of assembly sequencing: Unit disks in the plane
  30. Altmetric Badge
    Chapter 71 On hamiltonian triangulations in simple polygons (Extended Abstract)
  31. Altmetric Badge
    Chapter 72 Computing orthogonal drawings with the minimum number of bends
  32. Altmetric Badge
    Chapter 73 On a simple depth-first search strategy for exploring unknown graphs
  33. Altmetric Badge
    Chapter 74 Orthogonal drawing of high degree graphs with small area and few bends
  34. Altmetric Badge
    Chapter 75 A centroid labelling technique and its application to path selection in trees
  35. Altmetric Badge
    Chapter 76 Offset-polygon annulus placement problems
  36. Altmetric Badge
    Chapter 77 Computing constrained minimum-width annuli of point sets
  37. Altmetric Badge
    Chapter 78 Geometric Applications of Posets
  38. Altmetric Badge
    Chapter 79 Constructing pairwise disjoint paths with few links
  39. Altmetric Badge
    Chapter 80 Trans-dichotomous algorithms without multiplication — some upper and lower bounds
  40. Altmetric Badge
    Chapter 81 An approximation algorithm for stacking up bins from a conveyer onto pallets
  41. Altmetric Badge
    Chapter 82 Relaxed balance through standard rotations
  42. Altmetric Badge
    Chapter 83 Efficient breakout routing in printed circuit boards
  43. Altmetric Badge
    Chapter 84 Planarity, revisited (extended abstract)
Attention for Chapter 46: Maintaining the extent of a moving point set
Altmetric Badge

About this Attention Score

  • Above-average Attention Score compared to outputs of the same age and source (52nd percentile)

Mentioned by

wikipedia
2 Wikipedia pages

Readers on

mendeley
14 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
Maintaining the extent of a moving point set
Chapter number 46
Book title
Algorithms and Data Structures
Published in
Lecture notes in computer science, July 2005
DOI 10.1007/3-540-63307-3_46
Book ISBNs
978-3-54-063307-5, 978-3-54-069422-9
Authors

Agarwal, Pankaj K., Guibas, Leonidas J., Hershberger, John, Veach, Eric, Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach

Timeline

Login to access the full chart related to this output.

If you don’t have an account, click here to discover Explorer

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 7%
Thailand 1 7%
Switzerland 1 7%
Unknown 11 79%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 5 36%
Researcher 3 21%
Student > Doctoral Student 2 14%
Student > Master 1 7%
Professor > Associate Professor 1 7%
Other 0 0%
Unknown 2 14%
Readers by discipline Count As %
Computer Science 10 71%
Physics and Astronomy 1 7%
Engineering 1 7%
Unknown 2 14%
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 28 May 2017.
All research outputs
#7,463,244
of 22,817,213 outputs
Outputs from Lecture notes in computer science
#2,487
of 8,124 outputs
Outputs of similar age
#20,148
of 57,224 outputs
Outputs of similar age from Lecture notes in computer science
#7
of 40 outputs
Altmetric has tracked 22,817,213 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,124 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 57,224 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 13th percentile – i.e., 13% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 40 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 52% of its contemporaries.