Notes on computing peaks in k-levels and parametric spanning trees

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2001, Pages 241-248

  Katoh, N ^a   Tokuyama, T ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; GRAPH THEORY;

MINIMUM SPANNING TREES (MST);

COMPUTATIONAL GEOMETRY;

EID: 0034819876     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378583.378675     Document Type: Conference Paper

References (29)

1. Range searching
2. On levels in arrangement of lines, segments, planes, and triangles
3. Parametric and kinetic minimum spanning trees
4. Data structures for mobile data
5. Dynamic planar convex hull with optimal query time and O(log n · log log n) update time
6. Dynamic planar convex hull operations in near-logarithmic amortized time
7. An optimal algorithm for slope selection
8. On K-hulls and related problems
9. Cutting hyperplanes for divide-and-conquer
10. A bound on local minima of arrangement that implies the upper bound theorem
11. Improved bound on planar K-Sets and related problems
12. Algorithms in combinatorial geometry
13. Geometric lower bounds for parametric matroid optimization
14. Sparcification - A technique for speeding up dynamic graph algorithms
15. Using sparcification for parametric minimum spanning tree problems
16. Ambivalent data structures for dynamic 2-edge-connectivity and k-smallest spanning trees
17. Bound for the parametric spanning tree problem
18. On minimum and maximum spanning trees of linearly moving points
19. Taking a walk in a planar arrangement
20. Parametric polymatroid optimization and its geometric applications
21. Lovász's theorem for the K-level of an arrangement of concave surfaces and its applications
22. On the number of halving lines
23. Efficient partition trees
24. Applying parallel computation algorithms in the design of serial algorithms
25. K-violation linear programming
26. Parametric search
27. Point sets with many k-sets