The analysis of a nested dissection algorithm
Numerische Mathematik
Introduction to algorithms
Delaunay graphs are almost as good as complete graphs
Discrete & Computational Geometry
ACM Computing Surveys (CSUR)
Faster shortest-path algorithms for planar graphs
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Intersections with random geometric object
Computational Geometry: Theory and Applications
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software (TOMS)
Area-Efficient VLSI Computation
Area-Efficient VLSI Computation
Graph separator theorems and sparse gaussian elimination
Graph separator theorems and sparse gaussian elimination
Expected time analysis for Delaunay point location
Computational Geometry: Theory and Applications
The complexity of the outer face in arrangements of random segments
Proceedings of the twenty-fourth annual symposium on Computational geometry
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Practical distribution-sensitive point location in triangulations
Computer Aided Geometric Design
| Hi-index | 0.00 |
We consider a Delaunay triangulation defined on n points distributed independently and uniformly on a planar compact convex set of positive volume. Let the stabbing number be the maximal number of intersections between a line and edges of the triangulation. We show that the stabbing number S"n is @Q(n) in the mean, and provide tail bounds for P{S"n=tn}. Applications to planar point location, nearest neighbor searching, range queries, planar separator determination, approximate shortest paths, and the diameter of the Delaunay triangulation are discussed.