Journal ArticleDOI
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
Leonidas J. Guibas,John Hershberger,Daniel Leven,Micha Sharir,Micha Sharir,Robert E. Tarjan,Robert E. Tarjan +6 more
Reads0
Chats0
TLDR
Given a triangulation of a simple polygonP, linear-time algorithms for solving a collection of problems concerning shortest paths and visibility withinP are presented.Abstract:
Given a triangulation of a simple polygonP, we present linear-time algorithms for solving a collection of problems concerning shortest paths and visibility withinP. These problems include calculation of the collection of all shortest paths insideP from a given source vertexS to all the other vertices ofP, calculation of the subpolygon ofP consisting of points that are visible from a given segment withinP, preprocessingP for fast "ray shooting" queries, and several related problems.read more
Citations
More filters
Journal ArticleDOI
Adaptive Spatial Partitioning for Multidimensional Data Streams
TL;DR: This sketch can be used to solve spatial versions of several classical data stream queries efficiently and can track ε-hot spots, which are congruent boxes containing at least an ε fraction of the stream, and maintain hierarchical heavy hitters in d dimensions.
Proceedings ArticleDOI
Matrix searching with the shortest path metric
John Hershberger,Subhash Suri +1 more
TL;DR: An O(n) time algorithm for computing row-wise maxima or minima of an implicit, totally monotone nn matrix whose entries represent shortest-path distances between pairs of vertices in a simple polygon is presented.
Book ChapterDOI
α-visibility
TL;DR: This work studies the classical variants of point visibility, weak and complete segment visibility, and the construction of the visibility graph, and investigates the natural query versions of these problems, when α is either fixed or specified at query time.
Journal ArticleDOI
The furthest-site geodesic voronoi diagram
TL;DR: An algorithm for computing the furthest-site Voronoi diagram ofk point sites with respect to the geodesic metric within a simplen-sided polygon is presented.
Journal ArticleDOI
Applying traffic smoothing techniques for quality of service control in VBR video transmissions
Junbiao Zhang,Joseph Y. Hui +1 more
TL;DR: An effective and efficient traffic smoothing technique called the ‘minimum polyline smoothing’ is presented, which can minimize the connection costs for deterministic services and dynamically adjust QoS parameters for statistical services in VBR video transmissions.
References
More filters
Book
Data Structures and Network Algorithms
TL;DR: This paper presents a meta-trees tree model that automates the very labor-intensive and therefore time-heavy and therefore expensive process of manually selecting trees to grow in a graph.
Journal ArticleDOI
Self-adjusting binary search trees
TL;DR: The splay tree, a self-adjusting form of binary search tree, is developed and analyzed and is found to be as efficient as balanced trees when total running time is the measure of interest.
Journal ArticleDOI
Optimal Search in Planar Subdivisions
TL;DR: This work presents a practical algorithm for subdivision search that achieves the same (optimal) worst case complexity bounds as the significantly more complex algorithm of Lipton and Tarjan, namely $O(\log n)$ search time with $O(n)$ storage.
Journal ArticleDOI
Optimal point location in a monotone subdivision
TL;DR: A substantial refinement of the technique of Lee and Preparata for locating a point in $\mathcal{S}$ based on separating chains is exhibited, which can be implemented in a simple and practical way, and is extensible to subdivisions with edges more general than straight-line segments.
Journal ArticleDOI
Euclidean shortest paths in the presence of rectilinear barriers
Der-Tsai Lee,Franco P. Preparata +1 more
TL;DR: The goal is to find interesting cases for which the solution can be obtained without the explicit construction of the entire visibility graph, which solve the problems by constructing the shortest-path tree from the source to all the vertices of the obstacles and to the destination.