Applications of generalized matrix searching to geometric algorithms
- 1 May 1990
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 27 (1-2) , 3-23
- https://doi.org/10.1016/0166-218x(90)90124-u
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- An Almost Linear Time Algorithm for Generalized Matrix SearchingSIAM Journal on Discrete Mathematics, 1990
- A linear-time algorithm for computing the voronoi diagram of a convex polygonDiscrete & Computational Geometry, 1989
- The concave least-weight subsequence problem revisitedJournal of Algorithms, 1988
- Geometric applications of a matrix-searching algorithmAlgorithmica, 1987
- Computing the Largest Empty RectangleSIAM Journal on Computing, 1986
- Finding the minimum visible vertex distance between two non-intersecting simple polygonsPublished by Association for Computing Machinery (ACM) ,1986
- A linear algorithm for determining the separation of convex polyhedraJournal of Algorithms, 1985
- An improved algorithm for constructing kth-order Voronoi diagramsPublished by Association for Computing Machinery (ACM) ,1985
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- The all nearest-neighbor problem for convex polygonsInformation Processing Letters, 1978